mirror of
https://github.com/chylex/Discord-History-Tracker.git
synced 2024-11-25 14:42:44 +01:00
Compare commits
2 Commits
d35280a6a6
...
7392987165
Author | SHA1 | Date | |
---|---|---|---|
7392987165 | |||
492dddb35d |
14
README.md
14
README.md
@ -16,7 +16,6 @@ Fork the repository and clone it to your computer (if you've never used git, you
|
|||||||
|
|
||||||
Folder organization:
|
Folder organization:
|
||||||
* `app/` contains a Visual Studio solution for the desktop app
|
* `app/` contains a Visual Studio solution for the desktop app
|
||||||
* `lib/` contains utilities required to build the project
|
|
||||||
* `web/` contains source code of the [official website](https://dht.chylex.com), which can be used as a template when making your own website
|
* `web/` contains source code of the [official website](https://dht.chylex.com), which can be used as a template when making your own website
|
||||||
|
|
||||||
To start editing source code for the desktop app, install the [.NET 8 SDK](https://dotnet.microsoft.com/en-us/download/dotnet/8.0), and then open `app/DiscordHistoryTracker.sln` in [Visual Studio](https://visualstudio.microsoft.com/downloads/) or [Rider](https://www.jetbrains.com/rider/).
|
To start editing source code for the desktop app, install the [.NET 8 SDK](https://dotnet.microsoft.com/en-us/download/dotnet/8.0), and then open `app/DiscordHistoryTracker.sln` in [Visual Studio](https://visualstudio.microsoft.com/downloads/) or [Rider](https://www.jetbrains.com/rider/).
|
||||||
@ -29,22 +28,13 @@ To build a `Release` version of the desktop app, follow the instructions for you
|
|||||||
|
|
||||||
#### Release – Windows (64-bit)
|
#### Release – Windows (64-bit)
|
||||||
|
|
||||||
1. Install [Python 3](https://www.python.org/downloads), and ensure the `python` executable is in your `PATH`
|
1. Install [Powershell 5](https://docs.microsoft.com/en-us/powershell/scripting/install/installing-powershell-on-windows) or newer (on Windows 10, the included version of Powershell should be enough)
|
||||||
2. Install [Powershell 5](https://docs.microsoft.com/en-us/powershell/scripting/install/installing-powershell-on-windows) or newer (on Windows 10, the included version of Powershell should be enough)
|
|
||||||
|
|
||||||
The `lib/` folder contains an installation of [Node](https://nodejs.org/en) and [uglify-js](https://www.npmjs.com/package/uglify-js), which are used to minify the tracking script. This installation will only work on 64-bit Windows; building on 32-bit Windows is not supported, but you can try.
|
|
||||||
|
|
||||||
Run the `app/build.bat` script, and read the [Distribution](#distribution) section below.
|
Run the `app/build.bat` script, and read the [Distribution](#distribution) section below.
|
||||||
|
|
||||||
#### Release – Other Operating Systems
|
#### Release – Other Operating Systems
|
||||||
|
|
||||||
1. Install [Python 3](https://www.python.org/downloads), and ensure the `python` executable exists and launches Python 3
|
1. Install the `zip` package from your repository
|
||||||
- On Debian and derivatives, you can install `python-is-python3`
|
|
||||||
- On other distributions, you can create a link manually, for ex. `ln -s /usr/bin/python3 /usr/bin/python`
|
|
||||||
- If you don't want `python` to mean Python 3, then edit `Desktop.csproj` and change `python` to `python3`
|
|
||||||
2. Install [Node + npm](https://nodejs.org/en)
|
|
||||||
3. Install [uglify-js](https://www.npmjs.com/package/uglify-js) globally (`npm install -g uglify-js`)
|
|
||||||
4. Install the `zip` package from your repository
|
|
||||||
|
|
||||||
Run the `app/build.sh` script, and read the [Distribution](#distribution) section below.
|
Run the `app/build.sh` script, and read the [Distribution](#distribution) section below.
|
||||||
|
|
||||||
|
@ -40,20 +40,8 @@
|
|||||||
</ItemGroup>
|
</ItemGroup>
|
||||||
<ItemGroup>
|
<ItemGroup>
|
||||||
<AvaloniaResource Include="Resources/icon.ico" />
|
<AvaloniaResource Include="Resources/icon.ico" />
|
||||||
<EmbeddedResource Include="../Resources/Tracker/bootstrap.js">
|
<EmbeddedResource Include="Resources/tracker-loader.js">
|
||||||
<LogicalName>Tracker\%(RecursiveDir)%(Filename)%(Extension)</LogicalName>
|
<LogicalName>tracker-loader.js</LogicalName>
|
||||||
<Link>Resources/Tracker/%(RecursiveDir)%(Filename)%(Extension)</Link>
|
|
||||||
<Visible>false</Visible>
|
|
||||||
</EmbeddedResource>
|
|
||||||
<EmbeddedResource Include="../Resources/Tracker/scripts/**" Condition=" '$(Configuration)' == 'Debug' ">
|
|
||||||
<LogicalName>Tracker\scripts\%(RecursiveDir)%(Filename)%(Extension)</LogicalName>
|
|
||||||
<Link>Resources/Tracker/scripts/%(RecursiveDir)%(Filename)%(Extension)</Link>
|
|
||||||
<Visible>false</Visible>
|
|
||||||
</EmbeddedResource>
|
|
||||||
<EmbeddedResource Include="../Resources/Tracker/styles/**">
|
|
||||||
<LogicalName>Tracker\styles\%(RecursiveDir)%(Filename)%(Extension)</LogicalName>
|
|
||||||
<Link>Resources/Tracker/styles/%(RecursiveDir)%(Filename)%(Extension)</Link>
|
|
||||||
<Visible>false</Visible>
|
|
||||||
</EmbeddedResource>
|
</EmbeddedResource>
|
||||||
<EmbeddedResource Include="../Resources/Viewer/**">
|
<EmbeddedResource Include="../Resources/Viewer/**">
|
||||||
<LogicalName>Viewer\%(RecursiveDir)%(Filename)%(Extension)</LogicalName>
|
<LogicalName>Viewer\%(RecursiveDir)%(Filename)%(Extension)</LogicalName>
|
||||||
@ -61,19 +49,4 @@
|
|||||||
<Visible>false</Visible>
|
<Visible>false</Visible>
|
||||||
</EmbeddedResource>
|
</EmbeddedResource>
|
||||||
</ItemGroup>
|
</ItemGroup>
|
||||||
<Target Name="MinifyResources" BeforeTargets="PrepareForBuild" Condition=" '$(Configuration)' == 'Release' ">
|
|
||||||
<PropertyGroup>
|
|
||||||
<MinifiedResourceDir>$(ProjectDir)bin/.res/scripts</MinifiedResourceDir>
|
|
||||||
</PropertyGroup>
|
|
||||||
<ItemGroup>
|
|
||||||
<UpToDateCheckInput Include="$(ProjectDir)../Resources/Tracker/scripts/**" Visible="false" />
|
|
||||||
<EmbeddedResource Include="$(MinifiedResourceDir)/discord.js" LogicalName="Tracker\scripts\discord.js" Visible="false" />
|
|
||||||
<EmbeddedResource Include="$(MinifiedResourceDir)/dom.js" LogicalName="Tracker\scripts\dom.js" Visible="false" />
|
|
||||||
<EmbeddedResource Include="$(MinifiedResourceDir)/gui.js" LogicalName="Tracker\scripts\gui.js" Visible="false" />
|
|
||||||
<EmbeddedResource Include="$(MinifiedResourceDir)/settings.js" LogicalName="Tracker\scripts\settings.js" Visible="false" />
|
|
||||||
<EmbeddedResource Include="$(MinifiedResourceDir)/state.js" LogicalName="Tracker\scripts\state.js" Visible="false" />
|
|
||||||
</ItemGroup>
|
|
||||||
<RemoveDir Directories="$(ProjectDir)bin/.res/scripts" />
|
|
||||||
<Exec Command="python $(ProjectDir)../Resources/minify.py" WorkingDirectory="$(ProjectDir)../Resources" IgnoreExitCode="false" />
|
|
||||||
</Target>
|
|
||||||
</Project>
|
</Project>
|
||||||
|
@ -52,14 +52,10 @@ sealed class TrackingPageModel : BaseModel {
|
|||||||
OnPropertyChanged(nameof(IsToggleAppDevToolsButtonEnabled));
|
OnPropertyChanged(nameof(IsToggleAppDevToolsButtonEnabled));
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
|
|
||||||
public async Task<bool> OnClickCopyTrackingScript() {
|
public async Task<bool> OnClickCopyTrackingScript() {
|
||||||
string bootstrap = await Resources.ReadTextAsync("Tracker/bootstrap.js");
|
string url = $"http://127.0.0.1:{ServerManager.Port}/get-tracking-script?token={HttpUtility.UrlEncode(ServerManager.Token)}";
|
||||||
string script = bootstrap.Replace("= 0; /*[PORT]*/", "= " + ServerManager.Port + ";")
|
string script = (await Resources.ReadTextAsync("tracker-loader.js")).Trim().Replace("{url}", url);
|
||||||
.Replace("/*[TOKEN]*/", HttpUtility.JavaScriptStringEncode(ServerManager.Token))
|
|
||||||
.Replace("/*[IMPORTS]*/", await Resources.ReadJoinedAsync("Tracker/scripts/", '\n'))
|
|
||||||
.Replace("/*[CSS-CONTROLLER]*/", await Resources.ReadTextAsync("Tracker/styles/controller.css"))
|
|
||||||
.Replace("/*[CSS-SETTINGS]*/", await Resources.ReadTextAsync("Tracker/styles/settings.css"));
|
|
||||||
|
|
||||||
var clipboard = window.Clipboard;
|
var clipboard = window.Clipboard;
|
||||||
if (clipboard == null) {
|
if (clipboard == null) {
|
||||||
|
1
app/Desktop/Resources/tracker-loader.js
Normal file
1
app/Desktop/Resources/tracker-loader.js
Normal file
@ -0,0 +1 @@
|
|||||||
|
fetch("{url}").then(r => r.ok ? (r.headers.get("X-DHT") === "1" ? r.text() : Promise.reject("Invalid response")) : Promise.reject(r.status + " " + r.statusText)).then(s => eval(s)).catch(e => alert("Could not load tracking script:\n" + e));
|
3
app/Resources/Tracker/bootstrap.js
vendored
3
app/Resources/Tracker/bootstrap.js
vendored
@ -121,7 +121,7 @@
|
|||||||
onTrackingContinued(false);
|
onTrackingContinued(false);
|
||||||
}
|
}
|
||||||
else {
|
else {
|
||||||
const anyNewMessages = await STATE.addDiscordMessages(info.id, messages);
|
const anyNewMessages = await STATE.addDiscordMessages(messages);
|
||||||
onTrackingContinued(anyNewMessages);
|
onTrackingContinued(anyNewMessages);
|
||||||
}
|
}
|
||||||
} catch (e) {
|
} catch (e) {
|
||||||
@ -156,3 +156,4 @@
|
|||||||
GUI.showSettings();
|
GUI.showSettings();
|
||||||
}
|
}
|
||||||
})();
|
})();
|
||||||
|
/*[DEBUGGER]*/
|
||||||
|
@ -174,10 +174,9 @@ const STATE = (function() {
|
|||||||
},
|
},
|
||||||
|
|
||||||
/**
|
/**
|
||||||
* @param {String} channelId
|
|
||||||
* @param {DiscordMessage[]} discordMessageArray
|
* @param {DiscordMessage[]} discordMessageArray
|
||||||
*/
|
*/
|
||||||
async addDiscordMessages(channelId, discordMessageArray) {
|
async addDiscordMessages(discordMessageArray) {
|
||||||
// https://discord.com/developers/docs/resources/channel#message-object-message-types
|
// https://discord.com/developers/docs/resources/channel#message-object-message-types
|
||||||
discordMessageArray = discordMessageArray.filter(msg => (msg.type === 0 || msg.type === 19 || msg.type === 21) && msg.state === "SENT");
|
discordMessageArray = discordMessageArray.filter(msg => (msg.type === 0 || msg.type === 19 || msg.type === 21) && msg.state === "SENT");
|
||||||
|
|
||||||
|
@ -1,27 +0,0 @@
|
|||||||
#!/usr/bin/env python3
|
|
||||||
|
|
||||||
import glob
|
|
||||||
import os
|
|
||||||
import shutil
|
|
||||||
import sys
|
|
||||||
|
|
||||||
if os.name == "nt":
|
|
||||||
uglifyjs = os.path.abspath("../../lib/uglifyjs.cmd")
|
|
||||||
else:
|
|
||||||
uglifyjs = "uglifyjs"
|
|
||||||
|
|
||||||
if shutil.which(uglifyjs) is None:
|
|
||||||
print("Cannot find executable: {0}".format(uglifyjs))
|
|
||||||
sys.exit(1)
|
|
||||||
|
|
||||||
input_dir = os.path.abspath("./Tracker/scripts")
|
|
||||||
output_dir = os.path.abspath("../Desktop/bin/.res/scripts")
|
|
||||||
|
|
||||||
os.makedirs(output_dir, exist_ok=True)
|
|
||||||
|
|
||||||
for file in glob.glob(input_dir + "/*.js"):
|
|
||||||
name = os.path.basename(file)
|
|
||||||
print("Minifying {0}...".format(name))
|
|
||||||
os.system("{0} {1} -o {2}/{3}".format(uglifyjs, file, output_dir, name))
|
|
||||||
|
|
||||||
print("Done!")
|
|
@ -16,11 +16,11 @@ abstract class BaseEndpoint {
|
|||||||
private static readonly Log Log = Log.ForType<BaseEndpoint>();
|
private static readonly Log Log = Log.ForType<BaseEndpoint>();
|
||||||
|
|
||||||
protected IDatabaseFile Db { get; }
|
protected IDatabaseFile Db { get; }
|
||||||
private readonly ServerParameters parameters;
|
protected ServerParameters Parameters { get; }
|
||||||
|
|
||||||
protected BaseEndpoint(IDatabaseFile db, ServerParameters parameters) {
|
protected BaseEndpoint(IDatabaseFile db, ServerParameters parameters) {
|
||||||
this.Db = db;
|
this.Db = db;
|
||||||
this.parameters = parameters;
|
this.Parameters = parameters;
|
||||||
}
|
}
|
||||||
|
|
||||||
private async Task Handle(HttpContext ctx, StringValues token) {
|
private async Task Handle(HttpContext ctx, StringValues token) {
|
||||||
@ -29,7 +29,7 @@ abstract class BaseEndpoint {
|
|||||||
|
|
||||||
Log.Info("Request: " + request.GetDisplayUrl() + " (" + request.ContentLength + " B)");
|
Log.Info("Request: " + request.GetDisplayUrl() + " (" + request.ContentLength + " B)");
|
||||||
|
|
||||||
if (token.Count != 1 || token[0] != parameters.Token) {
|
if (token.Count != 1 || token[0] != Parameters.Token) {
|
||||||
Log.Error("Token: " + (token.Count == 1 ? token[0] : "<missing>"));
|
Log.Error("Token: " + (token.Count == 1 ? token[0] : "<missing>"));
|
||||||
response.StatusCode = (int) HttpStatusCode.Forbidden;
|
response.StatusCode = (int) HttpStatusCode.Forbidden;
|
||||||
return;
|
return;
|
||||||
|
30
app/Server/Endpoints/GetTrackingScriptEndpoint.cs
Normal file
30
app/Server/Endpoints/GetTrackingScriptEndpoint.cs
Normal file
@ -0,0 +1,30 @@
|
|||||||
|
using System.Reflection;
|
||||||
|
using System.Text;
|
||||||
|
using System.Threading.Tasks;
|
||||||
|
using System.Web;
|
||||||
|
using DHT.Server.Database;
|
||||||
|
using DHT.Server.Service;
|
||||||
|
using DHT.Utils.Http;
|
||||||
|
using DHT.Utils.Resources;
|
||||||
|
using Microsoft.AspNetCore.Http;
|
||||||
|
|
||||||
|
namespace DHT.Server.Endpoints;
|
||||||
|
|
||||||
|
sealed class GetTrackingScriptEndpoint : BaseEndpoint {
|
||||||
|
private static ResourceLoader Resources { get; } = new (Assembly.GetExecutingAssembly());
|
||||||
|
|
||||||
|
public GetTrackingScriptEndpoint(IDatabaseFile db, ServerParameters parameters) : base(db, parameters) {}
|
||||||
|
|
||||||
|
protected override async Task<IHttpOutput> Respond(HttpContext ctx) {
|
||||||
|
string bootstrap = await Resources.ReadTextAsync("Tracker/bootstrap.js");
|
||||||
|
string script = bootstrap.Replace("= 0; /*[PORT]*/", "= " + Parameters.Port + ";")
|
||||||
|
.Replace("/*[TOKEN]*/", HttpUtility.JavaScriptStringEncode(Parameters.Token))
|
||||||
|
.Replace("/*[IMPORTS]*/", await Resources.ReadJoinedAsync("Tracker/scripts/", '\n'))
|
||||||
|
.Replace("/*[CSS-CONTROLLER]*/", await Resources.ReadTextAsync("Tracker/styles/controller.css"))
|
||||||
|
.Replace("/*[CSS-SETTINGS]*/", await Resources.ReadTextAsync("Tracker/styles/settings.css"))
|
||||||
|
.Replace("/*[DEBUGGER]*/", ctx.Request.Query.ContainsKey("debug") ? "debugger;" : "");
|
||||||
|
|
||||||
|
ctx.Response.Headers.Append("X-DHT", "1");
|
||||||
|
return new HttpOutput.File("text/javascript", Encoding.UTF8.GetBytes(script));
|
||||||
|
}
|
||||||
|
}
|
@ -27,4 +27,21 @@
|
|||||||
<ItemGroup>
|
<ItemGroup>
|
||||||
<Compile Include="..\Version.cs" Link="Version.cs" />
|
<Compile Include="..\Version.cs" Link="Version.cs" />
|
||||||
</ItemGroup>
|
</ItemGroup>
|
||||||
|
<ItemGroup>
|
||||||
|
<EmbeddedResource Include="../Resources/Tracker/bootstrap.js">
|
||||||
|
<LogicalName>Tracker\%(RecursiveDir)%(Filename)%(Extension)</LogicalName>
|
||||||
|
<Link>Resources/Tracker/%(RecursiveDir)%(Filename)%(Extension)</Link>
|
||||||
|
<Visible>false</Visible>
|
||||||
|
</EmbeddedResource>
|
||||||
|
<EmbeddedResource Include="../Resources/Tracker/scripts/**">
|
||||||
|
<LogicalName>Tracker\scripts\%(RecursiveDir)%(Filename)%(Extension)</LogicalName>
|
||||||
|
<Link>Resources/Tracker/scripts/%(RecursiveDir)%(Filename)%(Extension)</Link>
|
||||||
|
<Visible>false</Visible>
|
||||||
|
</EmbeddedResource>
|
||||||
|
<EmbeddedResource Include="../Resources/Tracker/styles/**">
|
||||||
|
<LogicalName>Tracker\styles\%(RecursiveDir)%(Filename)%(Extension)</LogicalName>
|
||||||
|
<Link>Resources/Tracker/styles/%(RecursiveDir)%(Filename)%(Extension)</Link>
|
||||||
|
<Visible>false</Visible>
|
||||||
|
</EmbeddedResource>
|
||||||
|
</ItemGroup>
|
||||||
</Project>
|
</Project>
|
||||||
|
@ -61,14 +61,12 @@ public static class ServerLauncher {
|
|||||||
}
|
}
|
||||||
}
|
}
|
||||||
|
|
||||||
private static void StartServerFromManagementThread(int port, string token, IDatabaseFile db) {
|
private static void StartServerFromManagementThread(ushort port, string token, IDatabaseFile db) {
|
||||||
Log.Info("Starting server on port " + port + "...");
|
Log.Info("Starting server on port " + port + "...");
|
||||||
|
|
||||||
void AddServices(IServiceCollection services) {
|
void AddServices(IServiceCollection services) {
|
||||||
services.AddSingleton(typeof(IDatabaseFile), db);
|
services.AddSingleton(typeof(IDatabaseFile), db);
|
||||||
services.AddSingleton(typeof(ServerParameters), new ServerParameters {
|
services.AddSingleton(typeof(ServerParameters), new ServerParameters(port, token));
|
||||||
Token = token
|
|
||||||
});
|
|
||||||
}
|
}
|
||||||
|
|
||||||
void SetKestrelOptions(KestrelServerOptions options) {
|
void SetKestrelOptions(KestrelServerOptions options) {
|
||||||
@ -103,7 +101,7 @@ public static class ServerLauncher {
|
|||||||
}
|
}
|
||||||
}
|
}
|
||||||
|
|
||||||
public static void Relaunch(int port, string token, IDatabaseFile db) {
|
public static void Relaunch(ushort port, string token, IDatabaseFile db) {
|
||||||
EnqueueMessage(new IMessage.StartServer(port, token, db));
|
EnqueueMessage(new IMessage.StartServer(port, token, db));
|
||||||
}
|
}
|
||||||
|
|
||||||
@ -113,11 +111,11 @@ public static class ServerLauncher {
|
|||||||
|
|
||||||
private interface IMessage {
|
private interface IMessage {
|
||||||
public sealed class StartServer : IMessage {
|
public sealed class StartServer : IMessage {
|
||||||
public int Port { get; }
|
public ushort Port { get; }
|
||||||
public string Token { get; }
|
public string Token { get; }
|
||||||
public IDatabaseFile Db { get; }
|
public IDatabaseFile Db { get; }
|
||||||
|
|
||||||
public StartServer(int port, string token, IDatabaseFile db) {
|
public StartServer(ushort port, string token, IDatabaseFile db) {
|
||||||
this.Port = port;
|
this.Port = port;
|
||||||
this.Token = token;
|
this.Token = token;
|
||||||
this.Db = db;
|
this.Db = db;
|
||||||
|
@ -1,5 +1,3 @@
|
|||||||
namespace DHT.Server.Service;
|
namespace DHT.Server.Service;
|
||||||
|
|
||||||
readonly struct ServerParameters {
|
sealed record ServerParameters(ushort Port, string Token);
|
||||||
public string Token { get; init; }
|
|
||||||
}
|
|
||||||
|
@ -24,7 +24,7 @@ sealed class Startup {
|
|||||||
|
|
||||||
services.AddCors(static cors => {
|
services.AddCors(static cors => {
|
||||||
cors.AddDefaultPolicy(static builder => {
|
cors.AddDefaultPolicy(static builder => {
|
||||||
builder.WithOrigins(AllowedOrigins).AllowCredentials().AllowAnyMethod().AllowAnyHeader();
|
builder.WithOrigins(AllowedOrigins).AllowCredentials().AllowAnyMethod().AllowAnyHeader().WithExposedHeaders("X-DHT");
|
||||||
});
|
});
|
||||||
});
|
});
|
||||||
}
|
}
|
||||||
@ -34,17 +34,20 @@ sealed class Startup {
|
|||||||
app.UseRouting();
|
app.UseRouting();
|
||||||
app.UseCors();
|
app.UseCors();
|
||||||
app.UseEndpoints(endpoints => {
|
app.UseEndpoints(endpoints => {
|
||||||
TrackChannelEndpoint trackChannel = new(db, parameters);
|
GetTrackingScriptEndpoint getTrackingScript = new (db, parameters);
|
||||||
endpoints.MapPost("/track-channel", async context => await trackChannel.HandlePost(context));
|
endpoints.MapGet("/get-tracking-script", context => getTrackingScript.HandleGet(context));
|
||||||
|
|
||||||
|
TrackChannelEndpoint trackChannel = new (db, parameters);
|
||||||
|
endpoints.MapPost("/track-channel", context => trackChannel.HandlePost(context));
|
||||||
|
|
||||||
TrackUsersEndpoint trackUsers = new(db, parameters);
|
TrackUsersEndpoint trackUsers = new (db, parameters);
|
||||||
endpoints.MapPost("/track-users", async context => await trackUsers.HandlePost(context));
|
endpoints.MapPost("/track-users", context => trackUsers.HandlePost(context));
|
||||||
|
|
||||||
TrackMessagesEndpoint trackMessages = new(db, parameters);
|
TrackMessagesEndpoint trackMessages = new (db, parameters);
|
||||||
endpoints.MapPost("/track-messages", async context => await trackMessages.HandlePost(context));
|
endpoints.MapPost("/track-messages", context => trackMessages.HandlePost(context));
|
||||||
|
|
||||||
GetAttachmentEndpoint getAttachment = new(db, parameters);
|
GetAttachmentEndpoint getAttachment = new (db, parameters);
|
||||||
endpoints.MapGet("/get-attachment/{url}", async context => await getAttachment.HandleGet(context));
|
endpoints.MapGet("/get-attachment/{url}", context => getAttachment.HandleGet(context));
|
||||||
});
|
});
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
|
1072
lib/NODE-LICENSE
1072
lib/NODE-LICENSE
File diff suppressed because it is too large
Load Diff
BIN
lib/node.exe
BIN
lib/node.exe
Binary file not shown.
22
lib/node_modules/commander/LICENSE
generated
vendored
22
lib/node_modules/commander/LICENSE
generated
vendored
@ -1,22 +0,0 @@
|
|||||||
(The MIT License)
|
|
||||||
|
|
||||||
Copyright (c) 2011 TJ Holowaychuk <tj@vision-media.ca>
|
|
||||||
|
|
||||||
Permission is hereby granted, free of charge, to any person obtaining
|
|
||||||
a copy of this software and associated documentation files (the
|
|
||||||
'Software'), to deal in the Software without restriction, including
|
|
||||||
without limitation the rights to use, copy, modify, merge, publish,
|
|
||||||
distribute, sublicense, and/or sell copies of the Software, and to
|
|
||||||
permit persons to whom the Software is furnished to do so, subject to
|
|
||||||
the following conditions:
|
|
||||||
|
|
||||||
The above copyright notice and this permission notice shall be
|
|
||||||
included in all copies or substantial portions of the Software.
|
|
||||||
|
|
||||||
THE SOFTWARE IS PROVIDED 'AS IS', WITHOUT WARRANTY OF ANY KIND,
|
|
||||||
EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
|
|
||||||
MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT.
|
|
||||||
IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY
|
|
||||||
CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT,
|
|
||||||
TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE
|
|
||||||
SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
|
|
1110
lib/node_modules/commander/index.js
generated
vendored
1110
lib/node_modules/commander/index.js
generated
vendored
File diff suppressed because it is too large
Load Diff
104
lib/node_modules/commander/package.json
generated
vendored
104
lib/node_modules/commander/package.json
generated
vendored
@ -1,104 +0,0 @@
|
|||||||
{
|
|
||||||
"_args": [
|
|
||||||
[
|
|
||||||
{
|
|
||||||
"raw": "commander@~2.9.0",
|
|
||||||
"scope": null,
|
|
||||||
"escapedName": "commander",
|
|
||||||
"name": "commander",
|
|
||||||
"rawSpec": "~2.9.0",
|
|
||||||
"spec": ">=2.9.0 <2.10.0",
|
|
||||||
"type": "range"
|
|
||||||
},
|
|
||||||
"C:\\Users\\Dan\\node_modules\\uglify-es"
|
|
||||||
]
|
|
||||||
],
|
|
||||||
"_from": "commander@>=2.9.0 <2.10.0",
|
|
||||||
"_id": "commander@2.9.0",
|
|
||||||
"_inCache": true,
|
|
||||||
"_location": "/commander",
|
|
||||||
"_nodeVersion": "0.12.7",
|
|
||||||
"_npmUser": {
|
|
||||||
"name": "zhiyelee",
|
|
||||||
"email": "zhiyelee@gmail.com"
|
|
||||||
},
|
|
||||||
"_npmVersion": "2.11.3",
|
|
||||||
"_phantomChildren": {},
|
|
||||||
"_requested": {
|
|
||||||
"raw": "commander@~2.9.0",
|
|
||||||
"scope": null,
|
|
||||||
"escapedName": "commander",
|
|
||||||
"name": "commander",
|
|
||||||
"rawSpec": "~2.9.0",
|
|
||||||
"spec": ">=2.9.0 <2.10.0",
|
|
||||||
"type": "range"
|
|
||||||
},
|
|
||||||
"_requiredBy": [
|
|
||||||
"/uglify-es"
|
|
||||||
],
|
|
||||||
"_resolved": "https://registry.npmjs.org/commander/-/commander-2.9.0.tgz",
|
|
||||||
"_shasum": "9c99094176e12240cb22d6c5146098400fe0f7d4",
|
|
||||||
"_shrinkwrap": null,
|
|
||||||
"_spec": "commander@~2.9.0",
|
|
||||||
"_where": "C:\\Users\\Dan\\node_modules\\uglify-es",
|
|
||||||
"author": {
|
|
||||||
"name": "TJ Holowaychuk",
|
|
||||||
"email": "tj@vision-media.ca"
|
|
||||||
},
|
|
||||||
"bugs": {
|
|
||||||
"url": "https://github.com/tj/commander.js/issues"
|
|
||||||
},
|
|
||||||
"dependencies": {
|
|
||||||
"graceful-readlink": ">= 1.0.0"
|
|
||||||
},
|
|
||||||
"description": "the complete solution for node.js command-line programs",
|
|
||||||
"devDependencies": {
|
|
||||||
"should": ">= 0.0.1",
|
|
||||||
"sinon": ">=1.17.1"
|
|
||||||
},
|
|
||||||
"directories": {},
|
|
||||||
"dist": {
|
|
||||||
"shasum": "9c99094176e12240cb22d6c5146098400fe0f7d4",
|
|
||||||
"tarball": "https://registry.npmjs.org/commander/-/commander-2.9.0.tgz"
|
|
||||||
},
|
|
||||||
"engines": {
|
|
||||||
"node": ">= 0.6.x"
|
|
||||||
},
|
|
||||||
"files": [
|
|
||||||
"index.js"
|
|
||||||
],
|
|
||||||
"gitHead": "b2aad7a8471d434593a85306aa73777a526e9f75",
|
|
||||||
"homepage": "https://github.com/tj/commander.js#readme",
|
|
||||||
"keywords": [
|
|
||||||
"command",
|
|
||||||
"option",
|
|
||||||
"parser"
|
|
||||||
],
|
|
||||||
"license": "MIT",
|
|
||||||
"main": "index",
|
|
||||||
"maintainers": [
|
|
||||||
{
|
|
||||||
"name": "tjholowaychuk",
|
|
||||||
"email": "tj@vision-media.ca"
|
|
||||||
},
|
|
||||||
{
|
|
||||||
"name": "somekittens",
|
|
||||||
"email": "rkoutnik@gmail.com"
|
|
||||||
},
|
|
||||||
{
|
|
||||||
"name": "zhiyelee",
|
|
||||||
"email": "zhiyelee@gmail.com"
|
|
||||||
}
|
|
||||||
],
|
|
||||||
"name": "commander",
|
|
||||||
"optionalDependencies": {},
|
|
||||||
"readme": "ERROR: No README data found!",
|
|
||||||
"repository": {
|
|
||||||
"type": "git",
|
|
||||||
"url": "git+https://github.com/tj/commander.js.git"
|
|
||||||
},
|
|
||||||
"scripts": {
|
|
||||||
"test": "make test"
|
|
||||||
},
|
|
||||||
"version": "2.9.0"
|
|
||||||
}
|
|
22
lib/node_modules/graceful-readlink/LICENSE
generated
vendored
22
lib/node_modules/graceful-readlink/LICENSE
generated
vendored
@ -1,22 +0,0 @@
|
|||||||
The MIT License (MIT)
|
|
||||||
|
|
||||||
Copyright (c) 2015 Zhiye Li
|
|
||||||
|
|
||||||
Permission is hereby granted, free of charge, to any person obtaining a copy
|
|
||||||
of this software and associated documentation files (the "Software"), to deal
|
|
||||||
in the Software without restriction, including without limitation the rights
|
|
||||||
to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
|
|
||||||
copies of the Software, and to permit persons to whom the Software is
|
|
||||||
furnished to do so, subject to the following conditions:
|
|
||||||
|
|
||||||
The above copyright notice and this permission notice shall be included in all
|
|
||||||
copies or substantial portions of the Software.
|
|
||||||
|
|
||||||
THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
|
|
||||||
IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
|
|
||||||
FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
|
|
||||||
AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
|
|
||||||
LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
|
|
||||||
OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
|
|
||||||
SOFTWARE.
|
|
||||||
|
|
12
lib/node_modules/graceful-readlink/index.js
generated
vendored
12
lib/node_modules/graceful-readlink/index.js
generated
vendored
@ -1,12 +0,0 @@
|
|||||||
var fs = require('fs')
|
|
||||||
, lstat = fs.lstatSync;
|
|
||||||
|
|
||||||
exports.readlinkSync = function (p) {
|
|
||||||
if (lstat(p).isSymbolicLink()) {
|
|
||||||
return fs.readlinkSync(p);
|
|
||||||
} else {
|
|
||||||
return p;
|
|
||||||
}
|
|
||||||
};
|
|
||||||
|
|
||||||
|
|
83
lib/node_modules/graceful-readlink/package.json
generated
vendored
83
lib/node_modules/graceful-readlink/package.json
generated
vendored
@ -1,83 +0,0 @@
|
|||||||
{
|
|
||||||
"_args": [
|
|
||||||
[
|
|
||||||
{
|
|
||||||
"raw": "graceful-readlink@>= 1.0.0",
|
|
||||||
"scope": null,
|
|
||||||
"escapedName": "graceful-readlink",
|
|
||||||
"name": "graceful-readlink",
|
|
||||||
"rawSpec": ">= 1.0.0",
|
|
||||||
"spec": ">=1.0.0",
|
|
||||||
"type": "range"
|
|
||||||
},
|
|
||||||
"C:\\Users\\Dan\\node_modules\\commander"
|
|
||||||
]
|
|
||||||
],
|
|
||||||
"_from": "graceful-readlink@>=1.0.0",
|
|
||||||
"_id": "graceful-readlink@1.0.1",
|
|
||||||
"_inCache": true,
|
|
||||||
"_location": "/graceful-readlink",
|
|
||||||
"_nodeVersion": "0.11.14",
|
|
||||||
"_npmUser": {
|
|
||||||
"name": "zhiyelee",
|
|
||||||
"email": "zhiyelee@gmail.com"
|
|
||||||
},
|
|
||||||
"_npmVersion": "2.1.17",
|
|
||||||
"_phantomChildren": {},
|
|
||||||
"_requested": {
|
|
||||||
"raw": "graceful-readlink@>= 1.0.0",
|
|
||||||
"scope": null,
|
|
||||||
"escapedName": "graceful-readlink",
|
|
||||||
"name": "graceful-readlink",
|
|
||||||
"rawSpec": ">= 1.0.0",
|
|
||||||
"spec": ">=1.0.0",
|
|
||||||
"type": "range"
|
|
||||||
},
|
|
||||||
"_requiredBy": [
|
|
||||||
"/commander"
|
|
||||||
],
|
|
||||||
"_resolved": "https://registry.npmjs.org/graceful-readlink/-/graceful-readlink-1.0.1.tgz",
|
|
||||||
"_shasum": "4cafad76bc62f02fa039b2f94e9a3dd3a391a725",
|
|
||||||
"_shrinkwrap": null,
|
|
||||||
"_spec": "graceful-readlink@>= 1.0.0",
|
|
||||||
"_where": "C:\\Users\\Dan\\node_modules\\commander",
|
|
||||||
"author": {
|
|
||||||
"name": "zhiyelee"
|
|
||||||
},
|
|
||||||
"bugs": {
|
|
||||||
"url": "https://github.com/zhiyelee/graceful-readlink/issues"
|
|
||||||
},
|
|
||||||
"dependencies": {},
|
|
||||||
"description": "graceful fs.readlink",
|
|
||||||
"devDependencies": {},
|
|
||||||
"directories": {},
|
|
||||||
"dist": {
|
|
||||||
"shasum": "4cafad76bc62f02fa039b2f94e9a3dd3a391a725",
|
|
||||||
"tarball": "https://registry.npmjs.org/graceful-readlink/-/graceful-readlink-1.0.1.tgz"
|
|
||||||
},
|
|
||||||
"gitHead": "f6655275bebef706fb63fd01b5f062a7052419a5",
|
|
||||||
"homepage": "https://github.com/zhiyelee/graceful-readlink",
|
|
||||||
"keywords": [
|
|
||||||
"fs.readlink",
|
|
||||||
"readlink"
|
|
||||||
],
|
|
||||||
"license": "MIT",
|
|
||||||
"main": "index.js",
|
|
||||||
"maintainers": [
|
|
||||||
{
|
|
||||||
"name": "zhiyelee",
|
|
||||||
"email": "zhiyelee@gmail.com"
|
|
||||||
}
|
|
||||||
],
|
|
||||||
"name": "graceful-readlink",
|
|
||||||
"optionalDependencies": {},
|
|
||||||
"readme": "ERROR: No README data found!",
|
|
||||||
"repository": {
|
|
||||||
"type": "git",
|
|
||||||
"url": "git://github.com/zhiyelee/graceful-readlink.git"
|
|
||||||
},
|
|
||||||
"scripts": {
|
|
||||||
"test": "echo \"Error: no test specified\" && exit 1"
|
|
||||||
},
|
|
||||||
"version": "1.0.1"
|
|
||||||
}
|
|
28
lib/node_modules/source-map/LICENSE
generated
vendored
28
lib/node_modules/source-map/LICENSE
generated
vendored
@ -1,28 +0,0 @@
|
|||||||
|
|
||||||
Copyright (c) 2009-2011, Mozilla Foundation and contributors
|
|
||||||
All rights reserved.
|
|
||||||
|
|
||||||
Redistribution and use in source and binary forms, with or without
|
|
||||||
modification, are permitted provided that the following conditions are met:
|
|
||||||
|
|
||||||
* Redistributions of source code must retain the above copyright notice, this
|
|
||||||
list of conditions and the following disclaimer.
|
|
||||||
|
|
||||||
* Redistributions in binary form must reproduce the above copyright notice,
|
|
||||||
this list of conditions and the following disclaimer in the documentation
|
|
||||||
and/or other materials provided with the distribution.
|
|
||||||
|
|
||||||
* Neither the names of the Mozilla Foundation nor the names of project
|
|
||||||
contributors may be used to endorse or promote products derived from this
|
|
||||||
software without specific prior written permission.
|
|
||||||
|
|
||||||
THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND
|
|
||||||
ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED
|
|
||||||
WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
|
|
||||||
DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE
|
|
||||||
FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
|
|
||||||
DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR
|
|
||||||
SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER
|
|
||||||
CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,
|
|
||||||
OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
|
|
||||||
OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
|
|
3055
lib/node_modules/source-map/dist/source-map.js
generated
vendored
3055
lib/node_modules/source-map/dist/source-map.js
generated
vendored
File diff suppressed because it is too large
Load Diff
2
lib/node_modules/source-map/dist/source-map.min.js
generated
vendored
2
lib/node_modules/source-map/dist/source-map.min.js
generated
vendored
File diff suppressed because one or more lines are too long
104
lib/node_modules/source-map/lib/array-set.js
generated
vendored
104
lib/node_modules/source-map/lib/array-set.js
generated
vendored
@ -1,104 +0,0 @@
|
|||||||
/* -*- Mode: js; js-indent-level: 2; -*- */
|
|
||||||
/*
|
|
||||||
* Copyright 2011 Mozilla Foundation and contributors
|
|
||||||
* Licensed under the New BSD license. See LICENSE or:
|
|
||||||
* http://opensource.org/licenses/BSD-3-Clause
|
|
||||||
*/
|
|
||||||
|
|
||||||
var util = require('./util');
|
|
||||||
var has = Object.prototype.hasOwnProperty;
|
|
||||||
|
|
||||||
/**
|
|
||||||
* A data structure which is a combination of an array and a set. Adding a new
|
|
||||||
* member is O(1), testing for membership is O(1), and finding the index of an
|
|
||||||
* element is O(1). Removing elements from the set is not supported. Only
|
|
||||||
* strings are supported for membership.
|
|
||||||
*/
|
|
||||||
function ArraySet() {
|
|
||||||
this._array = [];
|
|
||||||
this._set = Object.create(null);
|
|
||||||
}
|
|
||||||
|
|
||||||
/**
|
|
||||||
* Static method for creating ArraySet instances from an existing array.
|
|
||||||
*/
|
|
||||||
ArraySet.fromArray = function ArraySet_fromArray(aArray, aAllowDuplicates) {
|
|
||||||
var set = new ArraySet();
|
|
||||||
for (var i = 0, len = aArray.length; i < len; i++) {
|
|
||||||
set.add(aArray[i], aAllowDuplicates);
|
|
||||||
}
|
|
||||||
return set;
|
|
||||||
};
|
|
||||||
|
|
||||||
/**
|
|
||||||
* Return how many unique items are in this ArraySet. If duplicates have been
|
|
||||||
* added, than those do not count towards the size.
|
|
||||||
*
|
|
||||||
* @returns Number
|
|
||||||
*/
|
|
||||||
ArraySet.prototype.size = function ArraySet_size() {
|
|
||||||
return Object.getOwnPropertyNames(this._set).length;
|
|
||||||
};
|
|
||||||
|
|
||||||
/**
|
|
||||||
* Add the given string to this set.
|
|
||||||
*
|
|
||||||
* @param String aStr
|
|
||||||
*/
|
|
||||||
ArraySet.prototype.add = function ArraySet_add(aStr, aAllowDuplicates) {
|
|
||||||
var sStr = util.toSetString(aStr);
|
|
||||||
var isDuplicate = has.call(this._set, sStr);
|
|
||||||
var idx = this._array.length;
|
|
||||||
if (!isDuplicate || aAllowDuplicates) {
|
|
||||||
this._array.push(aStr);
|
|
||||||
}
|
|
||||||
if (!isDuplicate) {
|
|
||||||
this._set[sStr] = idx;
|
|
||||||
}
|
|
||||||
};
|
|
||||||
|
|
||||||
/**
|
|
||||||
* Is the given string a member of this set?
|
|
||||||
*
|
|
||||||
* @param String aStr
|
|
||||||
*/
|
|
||||||
ArraySet.prototype.has = function ArraySet_has(aStr) {
|
|
||||||
var sStr = util.toSetString(aStr);
|
|
||||||
return has.call(this._set, sStr);
|
|
||||||
};
|
|
||||||
|
|
||||||
/**
|
|
||||||
* What is the index of the given string in the array?
|
|
||||||
*
|
|
||||||
* @param String aStr
|
|
||||||
*/
|
|
||||||
ArraySet.prototype.indexOf = function ArraySet_indexOf(aStr) {
|
|
||||||
var sStr = util.toSetString(aStr);
|
|
||||||
if (has.call(this._set, sStr)) {
|
|
||||||
return this._set[sStr];
|
|
||||||
}
|
|
||||||
throw new Error('"' + aStr + '" is not in the set.');
|
|
||||||
};
|
|
||||||
|
|
||||||
/**
|
|
||||||
* What is the element at the given index?
|
|
||||||
*
|
|
||||||
* @param Number aIdx
|
|
||||||
*/
|
|
||||||
ArraySet.prototype.at = function ArraySet_at(aIdx) {
|
|
||||||
if (aIdx >= 0 && aIdx < this._array.length) {
|
|
||||||
return this._array[aIdx];
|
|
||||||
}
|
|
||||||
throw new Error('No element indexed by ' + aIdx);
|
|
||||||
};
|
|
||||||
|
|
||||||
/**
|
|
||||||
* Returns the array representation of this set (which has the proper indices
|
|
||||||
* indicated by indexOf). Note that this is a copy of the internal array used
|
|
||||||
* for storing the members so that no one can mess with internal state.
|
|
||||||
*/
|
|
||||||
ArraySet.prototype.toArray = function ArraySet_toArray() {
|
|
||||||
return this._array.slice();
|
|
||||||
};
|
|
||||||
|
|
||||||
exports.ArraySet = ArraySet;
|
|
140
lib/node_modules/source-map/lib/base64-vlq.js
generated
vendored
140
lib/node_modules/source-map/lib/base64-vlq.js
generated
vendored
@ -1,140 +0,0 @@
|
|||||||
/* -*- Mode: js; js-indent-level: 2; -*- */
|
|
||||||
/*
|
|
||||||
* Copyright 2011 Mozilla Foundation and contributors
|
|
||||||
* Licensed under the New BSD license. See LICENSE or:
|
|
||||||
* http://opensource.org/licenses/BSD-3-Clause
|
|
||||||
*
|
|
||||||
* Based on the Base 64 VLQ implementation in Closure Compiler:
|
|
||||||
* https://code.google.com/p/closure-compiler/source/browse/trunk/src/com/google/debugging/sourcemap/Base64VLQ.java
|
|
||||||
*
|
|
||||||
* Copyright 2011 The Closure Compiler Authors. All rights reserved.
|
|
||||||
* Redistribution and use in source and binary forms, with or without
|
|
||||||
* modification, are permitted provided that the following conditions are
|
|
||||||
* met:
|
|
||||||
*
|
|
||||||
* * Redistributions of source code must retain the above copyright
|
|
||||||
* notice, this list of conditions and the following disclaimer.
|
|
||||||
* * Redistributions in binary form must reproduce the above
|
|
||||||
* copyright notice, this list of conditions and the following
|
|
||||||
* disclaimer in the documentation and/or other materials provided
|
|
||||||
* with the distribution.
|
|
||||||
* * Neither the name of Google Inc. nor the names of its
|
|
||||||
* contributors may be used to endorse or promote products derived
|
|
||||||
* from this software without specific prior written permission.
|
|
||||||
*
|
|
||||||
* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
|
|
||||||
* "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
|
|
||||||
* LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
|
|
||||||
* A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
|
|
||||||
* OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
|
|
||||||
* SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
|
|
||||||
* LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
|
|
||||||
* DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
|
|
||||||
* THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
|
|
||||||
* (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
|
|
||||||
* OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
|
|
||||||
*/
|
|
||||||
|
|
||||||
var base64 = require('./base64');
|
|
||||||
|
|
||||||
// A single base 64 digit can contain 6 bits of data. For the base 64 variable
|
|
||||||
// length quantities we use in the source map spec, the first bit is the sign,
|
|
||||||
// the next four bits are the actual value, and the 6th bit is the
|
|
||||||
// continuation bit. The continuation bit tells us whether there are more
|
|
||||||
// digits in this value following this digit.
|
|
||||||
//
|
|
||||||
// Continuation
|
|
||||||
// | Sign
|
|
||||||
// | |
|
|
||||||
// V V
|
|
||||||
// 101011
|
|
||||||
|
|
||||||
var VLQ_BASE_SHIFT = 5;
|
|
||||||
|
|
||||||
// binary: 100000
|
|
||||||
var VLQ_BASE = 1 << VLQ_BASE_SHIFT;
|
|
||||||
|
|
||||||
// binary: 011111
|
|
||||||
var VLQ_BASE_MASK = VLQ_BASE - 1;
|
|
||||||
|
|
||||||
// binary: 100000
|
|
||||||
var VLQ_CONTINUATION_BIT = VLQ_BASE;
|
|
||||||
|
|
||||||
/**
|
|
||||||
* Converts from a two-complement value to a value where the sign bit is
|
|
||||||
* placed in the least significant bit. For example, as decimals:
|
|
||||||
* 1 becomes 2 (10 binary), -1 becomes 3 (11 binary)
|
|
||||||
* 2 becomes 4 (100 binary), -2 becomes 5 (101 binary)
|
|
||||||
*/
|
|
||||||
function toVLQSigned(aValue) {
|
|
||||||
return aValue < 0
|
|
||||||
? ((-aValue) << 1) + 1
|
|
||||||
: (aValue << 1) + 0;
|
|
||||||
}
|
|
||||||
|
|
||||||
/**
|
|
||||||
* Converts to a two-complement value from a value where the sign bit is
|
|
||||||
* placed in the least significant bit. For example, as decimals:
|
|
||||||
* 2 (10 binary) becomes 1, 3 (11 binary) becomes -1
|
|
||||||
* 4 (100 binary) becomes 2, 5 (101 binary) becomes -2
|
|
||||||
*/
|
|
||||||
function fromVLQSigned(aValue) {
|
|
||||||
var isNegative = (aValue & 1) === 1;
|
|
||||||
var shifted = aValue >> 1;
|
|
||||||
return isNegative
|
|
||||||
? -shifted
|
|
||||||
: shifted;
|
|
||||||
}
|
|
||||||
|
|
||||||
/**
|
|
||||||
* Returns the base 64 VLQ encoded value.
|
|
||||||
*/
|
|
||||||
exports.encode = function base64VLQ_encode(aValue) {
|
|
||||||
var encoded = "";
|
|
||||||
var digit;
|
|
||||||
|
|
||||||
var vlq = toVLQSigned(aValue);
|
|
||||||
|
|
||||||
do {
|
|
||||||
digit = vlq & VLQ_BASE_MASK;
|
|
||||||
vlq >>>= VLQ_BASE_SHIFT;
|
|
||||||
if (vlq > 0) {
|
|
||||||
// There are still more digits in this value, so we must make sure the
|
|
||||||
// continuation bit is marked.
|
|
||||||
digit |= VLQ_CONTINUATION_BIT;
|
|
||||||
}
|
|
||||||
encoded += base64.encode(digit);
|
|
||||||
} while (vlq > 0);
|
|
||||||
|
|
||||||
return encoded;
|
|
||||||
};
|
|
||||||
|
|
||||||
/**
|
|
||||||
* Decodes the next base 64 VLQ value from the given string and returns the
|
|
||||||
* value and the rest of the string via the out parameter.
|
|
||||||
*/
|
|
||||||
exports.decode = function base64VLQ_decode(aStr, aIndex, aOutParam) {
|
|
||||||
var strLen = aStr.length;
|
|
||||||
var result = 0;
|
|
||||||
var shift = 0;
|
|
||||||
var continuation, digit;
|
|
||||||
|
|
||||||
do {
|
|
||||||
if (aIndex >= strLen) {
|
|
||||||
throw new Error("Expected more digits in base 64 VLQ value.");
|
|
||||||
}
|
|
||||||
|
|
||||||
digit = base64.decode(aStr.charCodeAt(aIndex++));
|
|
||||||
if (digit === -1) {
|
|
||||||
throw new Error("Invalid base64 digit: " + aStr.charAt(aIndex - 1));
|
|
||||||
}
|
|
||||||
|
|
||||||
continuation = !!(digit & VLQ_CONTINUATION_BIT);
|
|
||||||
digit &= VLQ_BASE_MASK;
|
|
||||||
result = result + (digit << shift);
|
|
||||||
shift += VLQ_BASE_SHIFT;
|
|
||||||
} while (continuation);
|
|
||||||
|
|
||||||
aOutParam.value = fromVLQSigned(result);
|
|
||||||
aOutParam.rest = aIndex;
|
|
||||||
};
|
|
67
lib/node_modules/source-map/lib/base64.js
generated
vendored
67
lib/node_modules/source-map/lib/base64.js
generated
vendored
@ -1,67 +0,0 @@
|
|||||||
/* -*- Mode: js; js-indent-level: 2; -*- */
|
|
||||||
/*
|
|
||||||
* Copyright 2011 Mozilla Foundation and contributors
|
|
||||||
* Licensed under the New BSD license. See LICENSE or:
|
|
||||||
* http://opensource.org/licenses/BSD-3-Clause
|
|
||||||
*/
|
|
||||||
|
|
||||||
var intToCharMap = 'ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/'.split('');
|
|
||||||
|
|
||||||
/**
|
|
||||||
* Encode an integer in the range of 0 to 63 to a single base 64 digit.
|
|
||||||
*/
|
|
||||||
exports.encode = function (number) {
|
|
||||||
if (0 <= number && number < intToCharMap.length) {
|
|
||||||
return intToCharMap[number];
|
|
||||||
}
|
|
||||||
throw new TypeError("Must be between 0 and 63: " + number);
|
|
||||||
};
|
|
||||||
|
|
||||||
/**
|
|
||||||
* Decode a single base 64 character code digit to an integer. Returns -1 on
|
|
||||||
* failure.
|
|
||||||
*/
|
|
||||||
exports.decode = function (charCode) {
|
|
||||||
var bigA = 65; // 'A'
|
|
||||||
var bigZ = 90; // 'Z'
|
|
||||||
|
|
||||||
var littleA = 97; // 'a'
|
|
||||||
var littleZ = 122; // 'z'
|
|
||||||
|
|
||||||
var zero = 48; // '0'
|
|
||||||
var nine = 57; // '9'
|
|
||||||
|
|
||||||
var plus = 43; // '+'
|
|
||||||
var slash = 47; // '/'
|
|
||||||
|
|
||||||
var littleOffset = 26;
|
|
||||||
var numberOffset = 52;
|
|
||||||
|
|
||||||
// 0 - 25: ABCDEFGHIJKLMNOPQRSTUVWXYZ
|
|
||||||
if (bigA <= charCode && charCode <= bigZ) {
|
|
||||||
return (charCode - bigA);
|
|
||||||
}
|
|
||||||
|
|
||||||
// 26 - 51: abcdefghijklmnopqrstuvwxyz
|
|
||||||
if (littleA <= charCode && charCode <= littleZ) {
|
|
||||||
return (charCode - littleA + littleOffset);
|
|
||||||
}
|
|
||||||
|
|
||||||
// 52 - 61: 0123456789
|
|
||||||
if (zero <= charCode && charCode <= nine) {
|
|
||||||
return (charCode - zero + numberOffset);
|
|
||||||
}
|
|
||||||
|
|
||||||
// 62: +
|
|
||||||
if (charCode == plus) {
|
|
||||||
return 62;
|
|
||||||
}
|
|
||||||
|
|
||||||
// 63: /
|
|
||||||
if (charCode == slash) {
|
|
||||||
return 63;
|
|
||||||
}
|
|
||||||
|
|
||||||
// Invalid base64 digit.
|
|
||||||
return -1;
|
|
||||||
};
|
|
111
lib/node_modules/source-map/lib/binary-search.js
generated
vendored
111
lib/node_modules/source-map/lib/binary-search.js
generated
vendored
@ -1,111 +0,0 @@
|
|||||||
/* -*- Mode: js; js-indent-level: 2; -*- */
|
|
||||||
/*
|
|
||||||
* Copyright 2011 Mozilla Foundation and contributors
|
|
||||||
* Licensed under the New BSD license. See LICENSE or:
|
|
||||||
* http://opensource.org/licenses/BSD-3-Clause
|
|
||||||
*/
|
|
||||||
|
|
||||||
exports.GREATEST_LOWER_BOUND = 1;
|
|
||||||
exports.LEAST_UPPER_BOUND = 2;
|
|
||||||
|
|
||||||
/**
|
|
||||||
* Recursive implementation of binary search.
|
|
||||||
*
|
|
||||||
* @param aLow Indices here and lower do not contain the needle.
|
|
||||||
* @param aHigh Indices here and higher do not contain the needle.
|
|
||||||
* @param aNeedle The element being searched for.
|
|
||||||
* @param aHaystack The non-empty array being searched.
|
|
||||||
* @param aCompare Function which takes two elements and returns -1, 0, or 1.
|
|
||||||
* @param aBias Either 'binarySearch.GREATEST_LOWER_BOUND' or
|
|
||||||
* 'binarySearch.LEAST_UPPER_BOUND'. Specifies whether to return the
|
|
||||||
* closest element that is smaller than or greater than the one we are
|
|
||||||
* searching for, respectively, if the exact element cannot be found.
|
|
||||||
*/
|
|
||||||
function recursiveSearch(aLow, aHigh, aNeedle, aHaystack, aCompare, aBias) {
|
|
||||||
// This function terminates when one of the following is true:
|
|
||||||
//
|
|
||||||
// 1. We find the exact element we are looking for.
|
|
||||||
//
|
|
||||||
// 2. We did not find the exact element, but we can return the index of
|
|
||||||
// the next-closest element.
|
|
||||||
//
|
|
||||||
// 3. We did not find the exact element, and there is no next-closest
|
|
||||||
// element than the one we are searching for, so we return -1.
|
|
||||||
var mid = Math.floor((aHigh - aLow) / 2) + aLow;
|
|
||||||
var cmp = aCompare(aNeedle, aHaystack[mid], true);
|
|
||||||
if (cmp === 0) {
|
|
||||||
// Found the element we are looking for.
|
|
||||||
return mid;
|
|
||||||
}
|
|
||||||
else if (cmp > 0) {
|
|
||||||
// Our needle is greater than aHaystack[mid].
|
|
||||||
if (aHigh - mid > 1) {
|
|
||||||
// The element is in the upper half.
|
|
||||||
return recursiveSearch(mid, aHigh, aNeedle, aHaystack, aCompare, aBias);
|
|
||||||
}
|
|
||||||
|
|
||||||
// The exact needle element was not found in this haystack. Determine if
|
|
||||||
// we are in termination case (3) or (2) and return the appropriate thing.
|
|
||||||
if (aBias == exports.LEAST_UPPER_BOUND) {
|
|
||||||
return aHigh < aHaystack.length ? aHigh : -1;
|
|
||||||
} else {
|
|
||||||
return mid;
|
|
||||||
}
|
|
||||||
}
|
|
||||||
else {
|
|
||||||
// Our needle is less than aHaystack[mid].
|
|
||||||
if (mid - aLow > 1) {
|
|
||||||
// The element is in the lower half.
|
|
||||||
return recursiveSearch(aLow, mid, aNeedle, aHaystack, aCompare, aBias);
|
|
||||||
}
|
|
||||||
|
|
||||||
// we are in termination case (3) or (2) and return the appropriate thing.
|
|
||||||
if (aBias == exports.LEAST_UPPER_BOUND) {
|
|
||||||
return mid;
|
|
||||||
} else {
|
|
||||||
return aLow < 0 ? -1 : aLow;
|
|
||||||
}
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
/**
|
|
||||||
* This is an implementation of binary search which will always try and return
|
|
||||||
* the index of the closest element if there is no exact hit. This is because
|
|
||||||
* mappings between original and generated line/col pairs are single points,
|
|
||||||
* and there is an implicit region between each of them, so a miss just means
|
|
||||||
* that you aren't on the very start of a region.
|
|
||||||
*
|
|
||||||
* @param aNeedle The element you are looking for.
|
|
||||||
* @param aHaystack The array that is being searched.
|
|
||||||
* @param aCompare A function which takes the needle and an element in the
|
|
||||||
* array and returns -1, 0, or 1 depending on whether the needle is less
|
|
||||||
* than, equal to, or greater than the element, respectively.
|
|
||||||
* @param aBias Either 'binarySearch.GREATEST_LOWER_BOUND' or
|
|
||||||
* 'binarySearch.LEAST_UPPER_BOUND'. Specifies whether to return the
|
|
||||||
* closest element that is smaller than or greater than the one we are
|
|
||||||
* searching for, respectively, if the exact element cannot be found.
|
|
||||||
* Defaults to 'binarySearch.GREATEST_LOWER_BOUND'.
|
|
||||||
*/
|
|
||||||
exports.search = function search(aNeedle, aHaystack, aCompare, aBias) {
|
|
||||||
if (aHaystack.length === 0) {
|
|
||||||
return -1;
|
|
||||||
}
|
|
||||||
|
|
||||||
var index = recursiveSearch(-1, aHaystack.length, aNeedle, aHaystack,
|
|
||||||
aCompare, aBias || exports.GREATEST_LOWER_BOUND);
|
|
||||||
if (index < 0) {
|
|
||||||
return -1;
|
|
||||||
}
|
|
||||||
|
|
||||||
// We have found either the exact element, or the next-closest element than
|
|
||||||
// the one we are searching for. However, there may be more than one such
|
|
||||||
// element. Make sure we always return the smallest of these.
|
|
||||||
while (index - 1 >= 0) {
|
|
||||||
if (aCompare(aHaystack[index], aHaystack[index - 1], true) !== 0) {
|
|
||||||
break;
|
|
||||||
}
|
|
||||||
--index;
|
|
||||||
}
|
|
||||||
|
|
||||||
return index;
|
|
||||||
};
|
|
79
lib/node_modules/source-map/lib/mapping-list.js
generated
vendored
79
lib/node_modules/source-map/lib/mapping-list.js
generated
vendored
@ -1,79 +0,0 @@
|
|||||||
/* -*- Mode: js; js-indent-level: 2; -*- */
|
|
||||||
/*
|
|
||||||
* Copyright 2014 Mozilla Foundation and contributors
|
|
||||||
* Licensed under the New BSD license. See LICENSE or:
|
|
||||||
* http://opensource.org/licenses/BSD-3-Clause
|
|
||||||
*/
|
|
||||||
|
|
||||||
var util = require('./util');
|
|
||||||
|
|
||||||
/**
|
|
||||||
* Determine whether mappingB is after mappingA with respect to generated
|
|
||||||
* position.
|
|
||||||
*/
|
|
||||||
function generatedPositionAfter(mappingA, mappingB) {
|
|
||||||
// Optimized for most common case
|
|
||||||
var lineA = mappingA.generatedLine;
|
|
||||||
var lineB = mappingB.generatedLine;
|
|
||||||
var columnA = mappingA.generatedColumn;
|
|
||||||
var columnB = mappingB.generatedColumn;
|
|
||||||
return lineB > lineA || lineB == lineA && columnB >= columnA ||
|
|
||||||
util.compareByGeneratedPositionsInflated(mappingA, mappingB) <= 0;
|
|
||||||
}
|
|
||||||
|
|
||||||
/**
|
|
||||||
* A data structure to provide a sorted view of accumulated mappings in a
|
|
||||||
* performance conscious manner. It trades a neglibable overhead in general
|
|
||||||
* case for a large speedup in case of mappings being added in order.
|
|
||||||
*/
|
|
||||||
function MappingList() {
|
|
||||||
this._array = [];
|
|
||||||
this._sorted = true;
|
|
||||||
// Serves as infimum
|
|
||||||
this._last = {generatedLine: -1, generatedColumn: 0};
|
|
||||||
}
|
|
||||||
|
|
||||||
/**
|
|
||||||
* Iterate through internal items. This method takes the same arguments that
|
|
||||||
* `Array.prototype.forEach` takes.
|
|
||||||
*
|
|
||||||
* NOTE: The order of the mappings is NOT guaranteed.
|
|
||||||
*/
|
|
||||||
MappingList.prototype.unsortedForEach =
|
|
||||||
function MappingList_forEach(aCallback, aThisArg) {
|
|
||||||
this._array.forEach(aCallback, aThisArg);
|
|
||||||
};
|
|
||||||
|
|
||||||
/**
|
|
||||||
* Add the given source mapping.
|
|
||||||
*
|
|
||||||
* @param Object aMapping
|
|
||||||
*/
|
|
||||||
MappingList.prototype.add = function MappingList_add(aMapping) {
|
|
||||||
if (generatedPositionAfter(this._last, aMapping)) {
|
|
||||||
this._last = aMapping;
|
|
||||||
this._array.push(aMapping);
|
|
||||||
} else {
|
|
||||||
this._sorted = false;
|
|
||||||
this._array.push(aMapping);
|
|
||||||
}
|
|
||||||
};
|
|
||||||
|
|
||||||
/**
|
|
||||||
* Returns the flat, sorted array of mappings. The mappings are sorted by
|
|
||||||
* generated position.
|
|
||||||
*
|
|
||||||
* WARNING: This method returns internal data without copying, for
|
|
||||||
* performance. The return value must NOT be mutated, and should be treated as
|
|
||||||
* an immutable borrow. If you want to take ownership, you must make your own
|
|
||||||
* copy.
|
|
||||||
*/
|
|
||||||
MappingList.prototype.toArray = function MappingList_toArray() {
|
|
||||||
if (!this._sorted) {
|
|
||||||
this._array.sort(util.compareByGeneratedPositionsInflated);
|
|
||||||
this._sorted = true;
|
|
||||||
}
|
|
||||||
return this._array;
|
|
||||||
};
|
|
||||||
|
|
||||||
exports.MappingList = MappingList;
|
|
114
lib/node_modules/source-map/lib/quick-sort.js
generated
vendored
114
lib/node_modules/source-map/lib/quick-sort.js
generated
vendored
@ -1,114 +0,0 @@
|
|||||||
/* -*- Mode: js; js-indent-level: 2; -*- */
|
|
||||||
/*
|
|
||||||
* Copyright 2011 Mozilla Foundation and contributors
|
|
||||||
* Licensed under the New BSD license. See LICENSE or:
|
|
||||||
* http://opensource.org/licenses/BSD-3-Clause
|
|
||||||
*/
|
|
||||||
|
|
||||||
// It turns out that some (most?) JavaScript engines don't self-host
|
|
||||||
// `Array.prototype.sort`. This makes sense because C++ will likely remain
|
|
||||||
// faster than JS when doing raw CPU-intensive sorting. However, when using a
|
|
||||||
// custom comparator function, calling back and forth between the VM's C++ and
|
|
||||||
// JIT'd JS is rather slow *and* loses JIT type information, resulting in
|
|
||||||
// worse generated code for the comparator function than would be optimal. In
|
|
||||||
// fact, when sorting with a comparator, these costs outweigh the benefits of
|
|
||||||
// sorting in C++. By using our own JS-implemented Quick Sort (below), we get
|
|
||||||
// a ~3500ms mean speed-up in `bench/bench.html`.
|
|
||||||
|
|
||||||
/**
|
|
||||||
* Swap the elements indexed by `x` and `y` in the array `ary`.
|
|
||||||
*
|
|
||||||
* @param {Array} ary
|
|
||||||
* The array.
|
|
||||||
* @param {Number} x
|
|
||||||
* The index of the first item.
|
|
||||||
* @param {Number} y
|
|
||||||
* The index of the second item.
|
|
||||||
*/
|
|
||||||
function swap(ary, x, y) {
|
|
||||||
var temp = ary[x];
|
|
||||||
ary[x] = ary[y];
|
|
||||||
ary[y] = temp;
|
|
||||||
}
|
|
||||||
|
|
||||||
/**
|
|
||||||
* Returns a random integer within the range `low .. high` inclusive.
|
|
||||||
*
|
|
||||||
* @param {Number} low
|
|
||||||
* The lower bound on the range.
|
|
||||||
* @param {Number} high
|
|
||||||
* The upper bound on the range.
|
|
||||||
*/
|
|
||||||
function randomIntInRange(low, high) {
|
|
||||||
return Math.round(low + (Math.random() * (high - low)));
|
|
||||||
}
|
|
||||||
|
|
||||||
/**
|
|
||||||
* The Quick Sort algorithm.
|
|
||||||
*
|
|
||||||
* @param {Array} ary
|
|
||||||
* An array to sort.
|
|
||||||
* @param {function} comparator
|
|
||||||
* Function to use to compare two items.
|
|
||||||
* @param {Number} p
|
|
||||||
* Start index of the array
|
|
||||||
* @param {Number} r
|
|
||||||
* End index of the array
|
|
||||||
*/
|
|
||||||
function doQuickSort(ary, comparator, p, r) {
|
|
||||||
// If our lower bound is less than our upper bound, we (1) partition the
|
|
||||||
// array into two pieces and (2) recurse on each half. If it is not, this is
|
|
||||||
// the empty array and our base case.
|
|
||||||
|
|
||||||
if (p < r) {
|
|
||||||
// (1) Partitioning.
|
|
||||||
//
|
|
||||||
// The partitioning chooses a pivot between `p` and `r` and moves all
|
|
||||||
// elements that are less than or equal to the pivot to the before it, and
|
|
||||||
// all the elements that are greater than it after it. The effect is that
|
|
||||||
// once partition is done, the pivot is in the exact place it will be when
|
|
||||||
// the array is put in sorted order, and it will not need to be moved
|
|
||||||
// again. This runs in O(n) time.
|
|
||||||
|
|
||||||
// Always choose a random pivot so that an input array which is reverse
|
|
||||||
// sorted does not cause O(n^2) running time.
|
|
||||||
var pivotIndex = randomIntInRange(p, r);
|
|
||||||
var i = p - 1;
|
|
||||||
|
|
||||||
swap(ary, pivotIndex, r);
|
|
||||||
var pivot = ary[r];
|
|
||||||
|
|
||||||
// Immediately after `j` is incremented in this loop, the following hold
|
|
||||||
// true:
|
|
||||||
//
|
|
||||||
// * Every element in `ary[p .. i]` is less than or equal to the pivot.
|
|
||||||
//
|
|
||||||
// * Every element in `ary[i+1 .. j-1]` is greater than the pivot.
|
|
||||||
for (var j = p; j < r; j++) {
|
|
||||||
if (comparator(ary[j], pivot) <= 0) {
|
|
||||||
i += 1;
|
|
||||||
swap(ary, i, j);
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
swap(ary, i + 1, j);
|
|
||||||
var q = i + 1;
|
|
||||||
|
|
||||||
// (2) Recurse on each half.
|
|
||||||
|
|
||||||
doQuickSort(ary, comparator, p, q - 1);
|
|
||||||
doQuickSort(ary, comparator, q + 1, r);
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
/**
|
|
||||||
* Sort the given array in-place with the given comparator function.
|
|
||||||
*
|
|
||||||
* @param {Array} ary
|
|
||||||
* An array to sort.
|
|
||||||
* @param {function} comparator
|
|
||||||
* Function to use to compare two items.
|
|
||||||
*/
|
|
||||||
exports.quickSort = function (ary, comparator) {
|
|
||||||
doQuickSort(ary, comparator, 0, ary.length - 1);
|
|
||||||
};
|
|
1082
lib/node_modules/source-map/lib/source-map-consumer.js
generated
vendored
1082
lib/node_modules/source-map/lib/source-map-consumer.js
generated
vendored
File diff suppressed because it is too large
Load Diff
404
lib/node_modules/source-map/lib/source-map-generator.js
generated
vendored
404
lib/node_modules/source-map/lib/source-map-generator.js
generated
vendored
@ -1,404 +0,0 @@
|
|||||||
/* -*- Mode: js; js-indent-level: 2; -*- */
|
|
||||||
/*
|
|
||||||
* Copyright 2011 Mozilla Foundation and contributors
|
|
||||||
* Licensed under the New BSD license. See LICENSE or:
|
|
||||||
* http://opensource.org/licenses/BSD-3-Clause
|
|
||||||
*/
|
|
||||||
|
|
||||||
var base64VLQ = require('./base64-vlq');
|
|
||||||
var util = require('./util');
|
|
||||||
var ArraySet = require('./array-set').ArraySet;
|
|
||||||
var MappingList = require('./mapping-list').MappingList;
|
|
||||||
|
|
||||||
/**
|
|
||||||
* An instance of the SourceMapGenerator represents a source map which is
|
|
||||||
* being built incrementally. You may pass an object with the following
|
|
||||||
* properties:
|
|
||||||
*
|
|
||||||
* - file: The filename of the generated source.
|
|
||||||
* - sourceRoot: A root for all relative URLs in this source map.
|
|
||||||
*/
|
|
||||||
function SourceMapGenerator(aArgs) {
|
|
||||||
if (!aArgs) {
|
|
||||||
aArgs = {};
|
|
||||||
}
|
|
||||||
this._file = util.getArg(aArgs, 'file', null);
|
|
||||||
this._sourceRoot = util.getArg(aArgs, 'sourceRoot', null);
|
|
||||||
this._skipValidation = util.getArg(aArgs, 'skipValidation', false);
|
|
||||||
this._sources = new ArraySet();
|
|
||||||
this._names = new ArraySet();
|
|
||||||
this._mappings = new MappingList();
|
|
||||||
this._sourcesContents = null;
|
|
||||||
}
|
|
||||||
|
|
||||||
SourceMapGenerator.prototype._version = 3;
|
|
||||||
|
|
||||||
/**
|
|
||||||
* Creates a new SourceMapGenerator based on a SourceMapConsumer
|
|
||||||
*
|
|
||||||
* @param aSourceMapConsumer The SourceMap.
|
|
||||||
*/
|
|
||||||
SourceMapGenerator.fromSourceMap =
|
|
||||||
function SourceMapGenerator_fromSourceMap(aSourceMapConsumer) {
|
|
||||||
var sourceRoot = aSourceMapConsumer.sourceRoot;
|
|
||||||
var generator = new SourceMapGenerator({
|
|
||||||
file: aSourceMapConsumer.file,
|
|
||||||
sourceRoot: sourceRoot
|
|
||||||
});
|
|
||||||
aSourceMapConsumer.eachMapping(function (mapping) {
|
|
||||||
var newMapping = {
|
|
||||||
generated: {
|
|
||||||
line: mapping.generatedLine,
|
|
||||||
column: mapping.generatedColumn
|
|
||||||
}
|
|
||||||
};
|
|
||||||
|
|
||||||
if (mapping.source != null) {
|
|
||||||
newMapping.source = mapping.source;
|
|
||||||
if (sourceRoot != null) {
|
|
||||||
newMapping.source = util.relative(sourceRoot, newMapping.source);
|
|
||||||
}
|
|
||||||
|
|
||||||
newMapping.original = {
|
|
||||||
line: mapping.originalLine,
|
|
||||||
column: mapping.originalColumn
|
|
||||||
};
|
|
||||||
|
|
||||||
if (mapping.name != null) {
|
|
||||||
newMapping.name = mapping.name;
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
generator.addMapping(newMapping);
|
|
||||||
});
|
|
||||||
aSourceMapConsumer.sources.forEach(function (sourceFile) {
|
|
||||||
var content = aSourceMapConsumer.sourceContentFor(sourceFile);
|
|
||||||
if (content != null) {
|
|
||||||
generator.setSourceContent(sourceFile, content);
|
|
||||||
}
|
|
||||||
});
|
|
||||||
return generator;
|
|
||||||
};
|
|
||||||
|
|
||||||
/**
|
|
||||||
* Add a single mapping from original source line and column to the generated
|
|
||||||
* source's line and column for this source map being created. The mapping
|
|
||||||
* object should have the following properties:
|
|
||||||
*
|
|
||||||
* - generated: An object with the generated line and column positions.
|
|
||||||
* - original: An object with the original line and column positions.
|
|
||||||
* - source: The original source file (relative to the sourceRoot).
|
|
||||||
* - name: An optional original token name for this mapping.
|
|
||||||
*/
|
|
||||||
SourceMapGenerator.prototype.addMapping =
|
|
||||||
function SourceMapGenerator_addMapping(aArgs) {
|
|
||||||
var generated = util.getArg(aArgs, 'generated');
|
|
||||||
var original = util.getArg(aArgs, 'original', null);
|
|
||||||
var source = util.getArg(aArgs, 'source', null);
|
|
||||||
var name = util.getArg(aArgs, 'name', null);
|
|
||||||
|
|
||||||
if (!this._skipValidation) {
|
|
||||||
this._validateMapping(generated, original, source, name);
|
|
||||||
}
|
|
||||||
|
|
||||||
if (source != null) {
|
|
||||||
source = String(source);
|
|
||||||
if (!this._sources.has(source)) {
|
|
||||||
this._sources.add(source);
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
if (name != null) {
|
|
||||||
name = String(name);
|
|
||||||
if (!this._names.has(name)) {
|
|
||||||
this._names.add(name);
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
this._mappings.add({
|
|
||||||
generatedLine: generated.line,
|
|
||||||
generatedColumn: generated.column,
|
|
||||||
originalLine: original != null && original.line,
|
|
||||||
originalColumn: original != null && original.column,
|
|
||||||
source: source,
|
|
||||||
name: name
|
|
||||||
});
|
|
||||||
};
|
|
||||||
|
|
||||||
/**
|
|
||||||
* Set the source content for a source file.
|
|
||||||
*/
|
|
||||||
SourceMapGenerator.prototype.setSourceContent =
|
|
||||||
function SourceMapGenerator_setSourceContent(aSourceFile, aSourceContent) {
|
|
||||||
var source = aSourceFile;
|
|
||||||
if (this._sourceRoot != null) {
|
|
||||||
source = util.relative(this._sourceRoot, source);
|
|
||||||
}
|
|
||||||
|
|
||||||
if (aSourceContent != null) {
|
|
||||||
// Add the source content to the _sourcesContents map.
|
|
||||||
// Create a new _sourcesContents map if the property is null.
|
|
||||||
if (!this._sourcesContents) {
|
|
||||||
this._sourcesContents = Object.create(null);
|
|
||||||
}
|
|
||||||
this._sourcesContents[util.toSetString(source)] = aSourceContent;
|
|
||||||
} else if (this._sourcesContents) {
|
|
||||||
// Remove the source file from the _sourcesContents map.
|
|
||||||
// If the _sourcesContents map is empty, set the property to null.
|
|
||||||
delete this._sourcesContents[util.toSetString(source)];
|
|
||||||
if (Object.keys(this._sourcesContents).length === 0) {
|
|
||||||
this._sourcesContents = null;
|
|
||||||
}
|
|
||||||
}
|
|
||||||
};
|
|
||||||
|
|
||||||
/**
|
|
||||||
* Applies the mappings of a sub-source-map for a specific source file to the
|
|
||||||
* source map being generated. Each mapping to the supplied source file is
|
|
||||||
* rewritten using the supplied source map. Note: The resolution for the
|
|
||||||
* resulting mappings is the minimium of this map and the supplied map.
|
|
||||||
*
|
|
||||||
* @param aSourceMapConsumer The source map to be applied.
|
|
||||||
* @param aSourceFile Optional. The filename of the source file.
|
|
||||||
* If omitted, SourceMapConsumer's file property will be used.
|
|
||||||
* @param aSourceMapPath Optional. The dirname of the path to the source map
|
|
||||||
* to be applied. If relative, it is relative to the SourceMapConsumer.
|
|
||||||
* This parameter is needed when the two source maps aren't in the same
|
|
||||||
* directory, and the source map to be applied contains relative source
|
|
||||||
* paths. If so, those relative source paths need to be rewritten
|
|
||||||
* relative to the SourceMapGenerator.
|
|
||||||
*/
|
|
||||||
SourceMapGenerator.prototype.applySourceMap =
|
|
||||||
function SourceMapGenerator_applySourceMap(aSourceMapConsumer, aSourceFile, aSourceMapPath) {
|
|
||||||
var sourceFile = aSourceFile;
|
|
||||||
// If aSourceFile is omitted, we will use the file property of the SourceMap
|
|
||||||
if (aSourceFile == null) {
|
|
||||||
if (aSourceMapConsumer.file == null) {
|
|
||||||
throw new Error(
|
|
||||||
'SourceMapGenerator.prototype.applySourceMap requires either an explicit source file, ' +
|
|
||||||
'or the source map\'s "file" property. Both were omitted.'
|
|
||||||
);
|
|
||||||
}
|
|
||||||
sourceFile = aSourceMapConsumer.file;
|
|
||||||
}
|
|
||||||
var sourceRoot = this._sourceRoot;
|
|
||||||
// Make "sourceFile" relative if an absolute Url is passed.
|
|
||||||
if (sourceRoot != null) {
|
|
||||||
sourceFile = util.relative(sourceRoot, sourceFile);
|
|
||||||
}
|
|
||||||
// Applying the SourceMap can add and remove items from the sources and
|
|
||||||
// the names array.
|
|
||||||
var newSources = new ArraySet();
|
|
||||||
var newNames = new ArraySet();
|
|
||||||
|
|
||||||
// Find mappings for the "sourceFile"
|
|
||||||
this._mappings.unsortedForEach(function (mapping) {
|
|
||||||
if (mapping.source === sourceFile && mapping.originalLine != null) {
|
|
||||||
// Check if it can be mapped by the source map, then update the mapping.
|
|
||||||
var original = aSourceMapConsumer.originalPositionFor({
|
|
||||||
line: mapping.originalLine,
|
|
||||||
column: mapping.originalColumn
|
|
||||||
});
|
|
||||||
if (original.source != null) {
|
|
||||||
// Copy mapping
|
|
||||||
mapping.source = original.source;
|
|
||||||
if (aSourceMapPath != null) {
|
|
||||||
mapping.source = util.join(aSourceMapPath, mapping.source)
|
|
||||||
}
|
|
||||||
if (sourceRoot != null) {
|
|
||||||
mapping.source = util.relative(sourceRoot, mapping.source);
|
|
||||||
}
|
|
||||||
mapping.originalLine = original.line;
|
|
||||||
mapping.originalColumn = original.column;
|
|
||||||
if (original.name != null) {
|
|
||||||
mapping.name = original.name;
|
|
||||||
}
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
var source = mapping.source;
|
|
||||||
if (source != null && !newSources.has(source)) {
|
|
||||||
newSources.add(source);
|
|
||||||
}
|
|
||||||
|
|
||||||
var name = mapping.name;
|
|
||||||
if (name != null && !newNames.has(name)) {
|
|
||||||
newNames.add(name);
|
|
||||||
}
|
|
||||||
|
|
||||||
}, this);
|
|
||||||
this._sources = newSources;
|
|
||||||
this._names = newNames;
|
|
||||||
|
|
||||||
// Copy sourcesContents of applied map.
|
|
||||||
aSourceMapConsumer.sources.forEach(function (sourceFile) {
|
|
||||||
var content = aSourceMapConsumer.sourceContentFor(sourceFile);
|
|
||||||
if (content != null) {
|
|
||||||
if (aSourceMapPath != null) {
|
|
||||||
sourceFile = util.join(aSourceMapPath, sourceFile);
|
|
||||||
}
|
|
||||||
if (sourceRoot != null) {
|
|
||||||
sourceFile = util.relative(sourceRoot, sourceFile);
|
|
||||||
}
|
|
||||||
this.setSourceContent(sourceFile, content);
|
|
||||||
}
|
|
||||||
}, this);
|
|
||||||
};
|
|
||||||
|
|
||||||
/**
|
|
||||||
* A mapping can have one of the three levels of data:
|
|
||||||
*
|
|
||||||
* 1. Just the generated position.
|
|
||||||
* 2. The Generated position, original position, and original source.
|
|
||||||
* 3. Generated and original position, original source, as well as a name
|
|
||||||
* token.
|
|
||||||
*
|
|
||||||
* To maintain consistency, we validate that any new mapping being added falls
|
|
||||||
* in to one of these categories.
|
|
||||||
*/
|
|
||||||
SourceMapGenerator.prototype._validateMapping =
|
|
||||||
function SourceMapGenerator_validateMapping(aGenerated, aOriginal, aSource,
|
|
||||||
aName) {
|
|
||||||
if (aGenerated && 'line' in aGenerated && 'column' in aGenerated
|
|
||||||
&& aGenerated.line > 0 && aGenerated.column >= 0
|
|
||||||
&& !aOriginal && !aSource && !aName) {
|
|
||||||
// Case 1.
|
|
||||||
return;
|
|
||||||
}
|
|
||||||
else if (aGenerated && 'line' in aGenerated && 'column' in aGenerated
|
|
||||||
&& aOriginal && 'line' in aOriginal && 'column' in aOriginal
|
|
||||||
&& aGenerated.line > 0 && aGenerated.column >= 0
|
|
||||||
&& aOriginal.line > 0 && aOriginal.column >= 0
|
|
||||||
&& aSource) {
|
|
||||||
// Cases 2 and 3.
|
|
||||||
return;
|
|
||||||
}
|
|
||||||
else {
|
|
||||||
throw new Error('Invalid mapping: ' + JSON.stringify({
|
|
||||||
generated: aGenerated,
|
|
||||||
source: aSource,
|
|
||||||
original: aOriginal,
|
|
||||||
name: aName
|
|
||||||
}));
|
|
||||||
}
|
|
||||||
};
|
|
||||||
|
|
||||||
/**
|
|
||||||
* Serialize the accumulated mappings in to the stream of base 64 VLQs
|
|
||||||
* specified by the source map format.
|
|
||||||
*/
|
|
||||||
SourceMapGenerator.prototype._serializeMappings =
|
|
||||||
function SourceMapGenerator_serializeMappings() {
|
|
||||||
var previousGeneratedColumn = 0;
|
|
||||||
var previousGeneratedLine = 1;
|
|
||||||
var previousOriginalColumn = 0;
|
|
||||||
var previousOriginalLine = 0;
|
|
||||||
var previousName = 0;
|
|
||||||
var previousSource = 0;
|
|
||||||
var result = '';
|
|
||||||
var next;
|
|
||||||
var mapping;
|
|
||||||
var nameIdx;
|
|
||||||
var sourceIdx;
|
|
||||||
|
|
||||||
var mappings = this._mappings.toArray();
|
|
||||||
for (var i = 0, len = mappings.length; i < len; i++) {
|
|
||||||
mapping = mappings[i];
|
|
||||||
next = ''
|
|
||||||
|
|
||||||
if (mapping.generatedLine !== previousGeneratedLine) {
|
|
||||||
previousGeneratedColumn = 0;
|
|
||||||
while (mapping.generatedLine !== previousGeneratedLine) {
|
|
||||||
next += ';';
|
|
||||||
previousGeneratedLine++;
|
|
||||||
}
|
|
||||||
}
|
|
||||||
else {
|
|
||||||
if (i > 0) {
|
|
||||||
if (!util.compareByGeneratedPositionsInflated(mapping, mappings[i - 1])) {
|
|
||||||
continue;
|
|
||||||
}
|
|
||||||
next += ',';
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
next += base64VLQ.encode(mapping.generatedColumn
|
|
||||||
- previousGeneratedColumn);
|
|
||||||
previousGeneratedColumn = mapping.generatedColumn;
|
|
||||||
|
|
||||||
if (mapping.source != null) {
|
|
||||||
sourceIdx = this._sources.indexOf(mapping.source);
|
|
||||||
next += base64VLQ.encode(sourceIdx - previousSource);
|
|
||||||
previousSource = sourceIdx;
|
|
||||||
|
|
||||||
// lines are stored 0-based in SourceMap spec version 3
|
|
||||||
next += base64VLQ.encode(mapping.originalLine - 1
|
|
||||||
- previousOriginalLine);
|
|
||||||
previousOriginalLine = mapping.originalLine - 1;
|
|
||||||
|
|
||||||
next += base64VLQ.encode(mapping.originalColumn
|
|
||||||
- previousOriginalColumn);
|
|
||||||
previousOriginalColumn = mapping.originalColumn;
|
|
||||||
|
|
||||||
if (mapping.name != null) {
|
|
||||||
nameIdx = this._names.indexOf(mapping.name);
|
|
||||||
next += base64VLQ.encode(nameIdx - previousName);
|
|
||||||
previousName = nameIdx;
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
result += next;
|
|
||||||
}
|
|
||||||
|
|
||||||
return result;
|
|
||||||
};
|
|
||||||
|
|
||||||
SourceMapGenerator.prototype._generateSourcesContent =
|
|
||||||
function SourceMapGenerator_generateSourcesContent(aSources, aSourceRoot) {
|
|
||||||
return aSources.map(function (source) {
|
|
||||||
if (!this._sourcesContents) {
|
|
||||||
return null;
|
|
||||||
}
|
|
||||||
if (aSourceRoot != null) {
|
|
||||||
source = util.relative(aSourceRoot, source);
|
|
||||||
}
|
|
||||||
var key = util.toSetString(source);
|
|
||||||
return Object.prototype.hasOwnProperty.call(this._sourcesContents, key)
|
|
||||||
? this._sourcesContents[key]
|
|
||||||
: null;
|
|
||||||
}, this);
|
|
||||||
};
|
|
||||||
|
|
||||||
/**
|
|
||||||
* Externalize the source map.
|
|
||||||
*/
|
|
||||||
SourceMapGenerator.prototype.toJSON =
|
|
||||||
function SourceMapGenerator_toJSON() {
|
|
||||||
var map = {
|
|
||||||
version: this._version,
|
|
||||||
sources: this._sources.toArray(),
|
|
||||||
names: this._names.toArray(),
|
|
||||||
mappings: this._serializeMappings()
|
|
||||||
};
|
|
||||||
if (this._file != null) {
|
|
||||||
map.file = this._file;
|
|
||||||
}
|
|
||||||
if (this._sourceRoot != null) {
|
|
||||||
map.sourceRoot = this._sourceRoot;
|
|
||||||
}
|
|
||||||
if (this._sourcesContents) {
|
|
||||||
map.sourcesContent = this._generateSourcesContent(map.sources, map.sourceRoot);
|
|
||||||
}
|
|
||||||
|
|
||||||
return map;
|
|
||||||
};
|
|
||||||
|
|
||||||
/**
|
|
||||||
* Render the source map being generated to a string.
|
|
||||||
*/
|
|
||||||
SourceMapGenerator.prototype.toString =
|
|
||||||
function SourceMapGenerator_toString() {
|
|
||||||
return JSON.stringify(this.toJSON());
|
|
||||||
};
|
|
||||||
|
|
||||||
exports.SourceMapGenerator = SourceMapGenerator;
|
|
407
lib/node_modules/source-map/lib/source-node.js
generated
vendored
407
lib/node_modules/source-map/lib/source-node.js
generated
vendored
@ -1,407 +0,0 @@
|
|||||||
/* -*- Mode: js; js-indent-level: 2; -*- */
|
|
||||||
/*
|
|
||||||
* Copyright 2011 Mozilla Foundation and contributors
|
|
||||||
* Licensed under the New BSD license. See LICENSE or:
|
|
||||||
* http://opensource.org/licenses/BSD-3-Clause
|
|
||||||
*/
|
|
||||||
|
|
||||||
var SourceMapGenerator = require('./source-map-generator').SourceMapGenerator;
|
|
||||||
var util = require('./util');
|
|
||||||
|
|
||||||
// Matches a Windows-style `\r\n` newline or a `\n` newline used by all other
|
|
||||||
// operating systems these days (capturing the result).
|
|
||||||
var REGEX_NEWLINE = /(\r?\n)/;
|
|
||||||
|
|
||||||
// Newline character code for charCodeAt() comparisons
|
|
||||||
var NEWLINE_CODE = 10;
|
|
||||||
|
|
||||||
// Private symbol for identifying `SourceNode`s when multiple versions of
|
|
||||||
// the source-map library are loaded. This MUST NOT CHANGE across
|
|
||||||
// versions!
|
|
||||||
var isSourceNode = "$$$isSourceNode$$$";
|
|
||||||
|
|
||||||
/**
|
|
||||||
* SourceNodes provide a way to abstract over interpolating/concatenating
|
|
||||||
* snippets of generated JavaScript source code while maintaining the line and
|
|
||||||
* column information associated with the original source code.
|
|
||||||
*
|
|
||||||
* @param aLine The original line number.
|
|
||||||
* @param aColumn The original column number.
|
|
||||||
* @param aSource The original source's filename.
|
|
||||||
* @param aChunks Optional. An array of strings which are snippets of
|
|
||||||
* generated JS, or other SourceNodes.
|
|
||||||
* @param aName The original identifier.
|
|
||||||
*/
|
|
||||||
function SourceNode(aLine, aColumn, aSource, aChunks, aName) {
|
|
||||||
this.children = [];
|
|
||||||
this.sourceContents = {};
|
|
||||||
this.line = aLine == null ? null : aLine;
|
|
||||||
this.column = aColumn == null ? null : aColumn;
|
|
||||||
this.source = aSource == null ? null : aSource;
|
|
||||||
this.name = aName == null ? null : aName;
|
|
||||||
this[isSourceNode] = true;
|
|
||||||
if (aChunks != null) this.add(aChunks);
|
|
||||||
}
|
|
||||||
|
|
||||||
/**
|
|
||||||
* Creates a SourceNode from generated code and a SourceMapConsumer.
|
|
||||||
*
|
|
||||||
* @param aGeneratedCode The generated code
|
|
||||||
* @param aSourceMapConsumer The SourceMap for the generated code
|
|
||||||
* @param aRelativePath Optional. The path that relative sources in the
|
|
||||||
* SourceMapConsumer should be relative to.
|
|
||||||
*/
|
|
||||||
SourceNode.fromStringWithSourceMap =
|
|
||||||
function SourceNode_fromStringWithSourceMap(aGeneratedCode, aSourceMapConsumer, aRelativePath) {
|
|
||||||
// The SourceNode we want to fill with the generated code
|
|
||||||
// and the SourceMap
|
|
||||||
var node = new SourceNode();
|
|
||||||
|
|
||||||
// All even indices of this array are one line of the generated code,
|
|
||||||
// while all odd indices are the newlines between two adjacent lines
|
|
||||||
// (since `REGEX_NEWLINE` captures its match).
|
|
||||||
// Processed fragments are removed from this array, by calling `shiftNextLine`.
|
|
||||||
var remainingLines = aGeneratedCode.split(REGEX_NEWLINE);
|
|
||||||
var shiftNextLine = function() {
|
|
||||||
var lineContents = remainingLines.shift();
|
|
||||||
// The last line of a file might not have a newline.
|
|
||||||
var newLine = remainingLines.shift() || "";
|
|
||||||
return lineContents + newLine;
|
|
||||||
};
|
|
||||||
|
|
||||||
// We need to remember the position of "remainingLines"
|
|
||||||
var lastGeneratedLine = 1, lastGeneratedColumn = 0;
|
|
||||||
|
|
||||||
// The generate SourceNodes we need a code range.
|
|
||||||
// To extract it current and last mapping is used.
|
|
||||||
// Here we store the last mapping.
|
|
||||||
var lastMapping = null;
|
|
||||||
|
|
||||||
aSourceMapConsumer.eachMapping(function (mapping) {
|
|
||||||
if (lastMapping !== null) {
|
|
||||||
// We add the code from "lastMapping" to "mapping":
|
|
||||||
// First check if there is a new line in between.
|
|
||||||
if (lastGeneratedLine < mapping.generatedLine) {
|
|
||||||
// Associate first line with "lastMapping"
|
|
||||||
addMappingWithCode(lastMapping, shiftNextLine());
|
|
||||||
lastGeneratedLine++;
|
|
||||||
lastGeneratedColumn = 0;
|
|
||||||
// The remaining code is added without mapping
|
|
||||||
} else {
|
|
||||||
// There is no new line in between.
|
|
||||||
// Associate the code between "lastGeneratedColumn" and
|
|
||||||
// "mapping.generatedColumn" with "lastMapping"
|
|
||||||
var nextLine = remainingLines[0];
|
|
||||||
var code = nextLine.substr(0, mapping.generatedColumn -
|
|
||||||
lastGeneratedColumn);
|
|
||||||
remainingLines[0] = nextLine.substr(mapping.generatedColumn -
|
|
||||||
lastGeneratedColumn);
|
|
||||||
lastGeneratedColumn = mapping.generatedColumn;
|
|
||||||
addMappingWithCode(lastMapping, code);
|
|
||||||
// No more remaining code, continue
|
|
||||||
lastMapping = mapping;
|
|
||||||
return;
|
|
||||||
}
|
|
||||||
}
|
|
||||||
// We add the generated code until the first mapping
|
|
||||||
// to the SourceNode without any mapping.
|
|
||||||
// Each line is added as separate string.
|
|
||||||
while (lastGeneratedLine < mapping.generatedLine) {
|
|
||||||
node.add(shiftNextLine());
|
|
||||||
lastGeneratedLine++;
|
|
||||||
}
|
|
||||||
if (lastGeneratedColumn < mapping.generatedColumn) {
|
|
||||||
var nextLine = remainingLines[0];
|
|
||||||
node.add(nextLine.substr(0, mapping.generatedColumn));
|
|
||||||
remainingLines[0] = nextLine.substr(mapping.generatedColumn);
|
|
||||||
lastGeneratedColumn = mapping.generatedColumn;
|
|
||||||
}
|
|
||||||
lastMapping = mapping;
|
|
||||||
}, this);
|
|
||||||
// We have processed all mappings.
|
|
||||||
if (remainingLines.length > 0) {
|
|
||||||
if (lastMapping) {
|
|
||||||
// Associate the remaining code in the current line with "lastMapping"
|
|
||||||
addMappingWithCode(lastMapping, shiftNextLine());
|
|
||||||
}
|
|
||||||
// and add the remaining lines without any mapping
|
|
||||||
node.add(remainingLines.join(""));
|
|
||||||
}
|
|
||||||
|
|
||||||
// Copy sourcesContent into SourceNode
|
|
||||||
aSourceMapConsumer.sources.forEach(function (sourceFile) {
|
|
||||||
var content = aSourceMapConsumer.sourceContentFor(sourceFile);
|
|
||||||
if (content != null) {
|
|
||||||
if (aRelativePath != null) {
|
|
||||||
sourceFile = util.join(aRelativePath, sourceFile);
|
|
||||||
}
|
|
||||||
node.setSourceContent(sourceFile, content);
|
|
||||||
}
|
|
||||||
});
|
|
||||||
|
|
||||||
return node;
|
|
||||||
|
|
||||||
function addMappingWithCode(mapping, code) {
|
|
||||||
if (mapping === null || mapping.source === undefined) {
|
|
||||||
node.add(code);
|
|
||||||
} else {
|
|
||||||
var source = aRelativePath
|
|
||||||
? util.join(aRelativePath, mapping.source)
|
|
||||||
: mapping.source;
|
|
||||||
node.add(new SourceNode(mapping.originalLine,
|
|
||||||
mapping.originalColumn,
|
|
||||||
source,
|
|
||||||
code,
|
|
||||||
mapping.name));
|
|
||||||
}
|
|
||||||
}
|
|
||||||
};
|
|
||||||
|
|
||||||
/**
|
|
||||||
* Add a chunk of generated JS to this source node.
|
|
||||||
*
|
|
||||||
* @param aChunk A string snippet of generated JS code, another instance of
|
|
||||||
* SourceNode, or an array where each member is one of those things.
|
|
||||||
*/
|
|
||||||
SourceNode.prototype.add = function SourceNode_add(aChunk) {
|
|
||||||
if (Array.isArray(aChunk)) {
|
|
||||||
aChunk.forEach(function (chunk) {
|
|
||||||
this.add(chunk);
|
|
||||||
}, this);
|
|
||||||
}
|
|
||||||
else if (aChunk[isSourceNode] || typeof aChunk === "string") {
|
|
||||||
if (aChunk) {
|
|
||||||
this.children.push(aChunk);
|
|
||||||
}
|
|
||||||
}
|
|
||||||
else {
|
|
||||||
throw new TypeError(
|
|
||||||
"Expected a SourceNode, string, or an array of SourceNodes and strings. Got " + aChunk
|
|
||||||
);
|
|
||||||
}
|
|
||||||
return this;
|
|
||||||
};
|
|
||||||
|
|
||||||
/**
|
|
||||||
* Add a chunk of generated JS to the beginning of this source node.
|
|
||||||
*
|
|
||||||
* @param aChunk A string snippet of generated JS code, another instance of
|
|
||||||
* SourceNode, or an array where each member is one of those things.
|
|
||||||
*/
|
|
||||||
SourceNode.prototype.prepend = function SourceNode_prepend(aChunk) {
|
|
||||||
if (Array.isArray(aChunk)) {
|
|
||||||
for (var i = aChunk.length-1; i >= 0; i--) {
|
|
||||||
this.prepend(aChunk[i]);
|
|
||||||
}
|
|
||||||
}
|
|
||||||
else if (aChunk[isSourceNode] || typeof aChunk === "string") {
|
|
||||||
this.children.unshift(aChunk);
|
|
||||||
}
|
|
||||||
else {
|
|
||||||
throw new TypeError(
|
|
||||||
"Expected a SourceNode, string, or an array of SourceNodes and strings. Got " + aChunk
|
|
||||||
);
|
|
||||||
}
|
|
||||||
return this;
|
|
||||||
};
|
|
||||||
|
|
||||||
/**
|
|
||||||
* Walk over the tree of JS snippets in this node and its children. The
|
|
||||||
* walking function is called once for each snippet of JS and is passed that
|
|
||||||
* snippet and the its original associated source's line/column location.
|
|
||||||
*
|
|
||||||
* @param aFn The traversal function.
|
|
||||||
*/
|
|
||||||
SourceNode.prototype.walk = function SourceNode_walk(aFn) {
|
|
||||||
var chunk;
|
|
||||||
for (var i = 0, len = this.children.length; i < len; i++) {
|
|
||||||
chunk = this.children[i];
|
|
||||||
if (chunk[isSourceNode]) {
|
|
||||||
chunk.walk(aFn);
|
|
||||||
}
|
|
||||||
else {
|
|
||||||
if (chunk !== '') {
|
|
||||||
aFn(chunk, { source: this.source,
|
|
||||||
line: this.line,
|
|
||||||
column: this.column,
|
|
||||||
name: this.name });
|
|
||||||
}
|
|
||||||
}
|
|
||||||
}
|
|
||||||
};
|
|
||||||
|
|
||||||
/**
|
|
||||||
* Like `String.prototype.join` except for SourceNodes. Inserts `aStr` between
|
|
||||||
* each of `this.children`.
|
|
||||||
*
|
|
||||||
* @param aSep The separator.
|
|
||||||
*/
|
|
||||||
SourceNode.prototype.join = function SourceNode_join(aSep) {
|
|
||||||
var newChildren;
|
|
||||||
var i;
|
|
||||||
var len = this.children.length;
|
|
||||||
if (len > 0) {
|
|
||||||
newChildren = [];
|
|
||||||
for (i = 0; i < len-1; i++) {
|
|
||||||
newChildren.push(this.children[i]);
|
|
||||||
newChildren.push(aSep);
|
|
||||||
}
|
|
||||||
newChildren.push(this.children[i]);
|
|
||||||
this.children = newChildren;
|
|
||||||
}
|
|
||||||
return this;
|
|
||||||
};
|
|
||||||
|
|
||||||
/**
|
|
||||||
* Call String.prototype.replace on the very right-most source snippet. Useful
|
|
||||||
* for trimming whitespace from the end of a source node, etc.
|
|
||||||
*
|
|
||||||
* @param aPattern The pattern to replace.
|
|
||||||
* @param aReplacement The thing to replace the pattern with.
|
|
||||||
*/
|
|
||||||
SourceNode.prototype.replaceRight = function SourceNode_replaceRight(aPattern, aReplacement) {
|
|
||||||
var lastChild = this.children[this.children.length - 1];
|
|
||||||
if (lastChild[isSourceNode]) {
|
|
||||||
lastChild.replaceRight(aPattern, aReplacement);
|
|
||||||
}
|
|
||||||
else if (typeof lastChild === 'string') {
|
|
||||||
this.children[this.children.length - 1] = lastChild.replace(aPattern, aReplacement);
|
|
||||||
}
|
|
||||||
else {
|
|
||||||
this.children.push(''.replace(aPattern, aReplacement));
|
|
||||||
}
|
|
||||||
return this;
|
|
||||||
};
|
|
||||||
|
|
||||||
/**
|
|
||||||
* Set the source content for a source file. This will be added to the SourceMapGenerator
|
|
||||||
* in the sourcesContent field.
|
|
||||||
*
|
|
||||||
* @param aSourceFile The filename of the source file
|
|
||||||
* @param aSourceContent The content of the source file
|
|
||||||
*/
|
|
||||||
SourceNode.prototype.setSourceContent =
|
|
||||||
function SourceNode_setSourceContent(aSourceFile, aSourceContent) {
|
|
||||||
this.sourceContents[util.toSetString(aSourceFile)] = aSourceContent;
|
|
||||||
};
|
|
||||||
|
|
||||||
/**
|
|
||||||
* Walk over the tree of SourceNodes. The walking function is called for each
|
|
||||||
* source file content and is passed the filename and source content.
|
|
||||||
*
|
|
||||||
* @param aFn The traversal function.
|
|
||||||
*/
|
|
||||||
SourceNode.prototype.walkSourceContents =
|
|
||||||
function SourceNode_walkSourceContents(aFn) {
|
|
||||||
for (var i = 0, len = this.children.length; i < len; i++) {
|
|
||||||
if (this.children[i][isSourceNode]) {
|
|
||||||
this.children[i].walkSourceContents(aFn);
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
var sources = Object.keys(this.sourceContents);
|
|
||||||
for (var i = 0, len = sources.length; i < len; i++) {
|
|
||||||
aFn(util.fromSetString(sources[i]), this.sourceContents[sources[i]]);
|
|
||||||
}
|
|
||||||
};
|
|
||||||
|
|
||||||
/**
|
|
||||||
* Return the string representation of this source node. Walks over the tree
|
|
||||||
* and concatenates all the various snippets together to one string.
|
|
||||||
*/
|
|
||||||
SourceNode.prototype.toString = function SourceNode_toString() {
|
|
||||||
var str = "";
|
|
||||||
this.walk(function (chunk) {
|
|
||||||
str += chunk;
|
|
||||||
});
|
|
||||||
return str;
|
|
||||||
};
|
|
||||||
|
|
||||||
/**
|
|
||||||
* Returns the string representation of this source node along with a source
|
|
||||||
* map.
|
|
||||||
*/
|
|
||||||
SourceNode.prototype.toStringWithSourceMap = function SourceNode_toStringWithSourceMap(aArgs) {
|
|
||||||
var generated = {
|
|
||||||
code: "",
|
|
||||||
line: 1,
|
|
||||||
column: 0
|
|
||||||
};
|
|
||||||
var map = new SourceMapGenerator(aArgs);
|
|
||||||
var sourceMappingActive = false;
|
|
||||||
var lastOriginalSource = null;
|
|
||||||
var lastOriginalLine = null;
|
|
||||||
var lastOriginalColumn = null;
|
|
||||||
var lastOriginalName = null;
|
|
||||||
this.walk(function (chunk, original) {
|
|
||||||
generated.code += chunk;
|
|
||||||
if (original.source !== null
|
|
||||||
&& original.line !== null
|
|
||||||
&& original.column !== null) {
|
|
||||||
if(lastOriginalSource !== original.source
|
|
||||||
|| lastOriginalLine !== original.line
|
|
||||||
|| lastOriginalColumn !== original.column
|
|
||||||
|| lastOriginalName !== original.name) {
|
|
||||||
map.addMapping({
|
|
||||||
source: original.source,
|
|
||||||
original: {
|
|
||||||
line: original.line,
|
|
||||||
column: original.column
|
|
||||||
},
|
|
||||||
generated: {
|
|
||||||
line: generated.line,
|
|
||||||
column: generated.column
|
|
||||||
},
|
|
||||||
name: original.name
|
|
||||||
});
|
|
||||||
}
|
|
||||||
lastOriginalSource = original.source;
|
|
||||||
lastOriginalLine = original.line;
|
|
||||||
lastOriginalColumn = original.column;
|
|
||||||
lastOriginalName = original.name;
|
|
||||||
sourceMappingActive = true;
|
|
||||||
} else if (sourceMappingActive) {
|
|
||||||
map.addMapping({
|
|
||||||
generated: {
|
|
||||||
line: generated.line,
|
|
||||||
column: generated.column
|
|
||||||
}
|
|
||||||
});
|
|
||||||
lastOriginalSource = null;
|
|
||||||
sourceMappingActive = false;
|
|
||||||
}
|
|
||||||
for (var idx = 0, length = chunk.length; idx < length; idx++) {
|
|
||||||
if (chunk.charCodeAt(idx) === NEWLINE_CODE) {
|
|
||||||
generated.line++;
|
|
||||||
generated.column = 0;
|
|
||||||
// Mappings end at eol
|
|
||||||
if (idx + 1 === length) {
|
|
||||||
lastOriginalSource = null;
|
|
||||||
sourceMappingActive = false;
|
|
||||||
} else if (sourceMappingActive) {
|
|
||||||
map.addMapping({
|
|
||||||
source: original.source,
|
|
||||||
original: {
|
|
||||||
line: original.line,
|
|
||||||
column: original.column
|
|
||||||
},
|
|
||||||
generated: {
|
|
||||||
line: generated.line,
|
|
||||||
column: generated.column
|
|
||||||
},
|
|
||||||
name: original.name
|
|
||||||
});
|
|
||||||
}
|
|
||||||
} else {
|
|
||||||
generated.column++;
|
|
||||||
}
|
|
||||||
}
|
|
||||||
});
|
|
||||||
this.walkSourceContents(function (sourceFile, sourceContent) {
|
|
||||||
map.setSourceContent(sourceFile, sourceContent);
|
|
||||||
});
|
|
||||||
|
|
||||||
return { code: generated.code, map: map };
|
|
||||||
};
|
|
||||||
|
|
||||||
exports.SourceNode = SourceNode;
|
|
417
lib/node_modules/source-map/lib/util.js
generated
vendored
417
lib/node_modules/source-map/lib/util.js
generated
vendored
@ -1,417 +0,0 @@
|
|||||||
/* -*- Mode: js; js-indent-level: 2; -*- */
|
|
||||||
/*
|
|
||||||
* Copyright 2011 Mozilla Foundation and contributors
|
|
||||||
* Licensed under the New BSD license. See LICENSE or:
|
|
||||||
* http://opensource.org/licenses/BSD-3-Clause
|
|
||||||
*/
|
|
||||||
|
|
||||||
/**
|
|
||||||
* This is a helper function for getting values from parameter/options
|
|
||||||
* objects.
|
|
||||||
*
|
|
||||||
* @param args The object we are extracting values from
|
|
||||||
* @param name The name of the property we are getting.
|
|
||||||
* @param defaultValue An optional value to return if the property is missing
|
|
||||||
* from the object. If this is not specified and the property is missing, an
|
|
||||||
* error will be thrown.
|
|
||||||
*/
|
|
||||||
function getArg(aArgs, aName, aDefaultValue) {
|
|
||||||
if (aName in aArgs) {
|
|
||||||
return aArgs[aName];
|
|
||||||
} else if (arguments.length === 3) {
|
|
||||||
return aDefaultValue;
|
|
||||||
} else {
|
|
||||||
throw new Error('"' + aName + '" is a required argument.');
|
|
||||||
}
|
|
||||||
}
|
|
||||||
exports.getArg = getArg;
|
|
||||||
|
|
||||||
var urlRegexp = /^(?:([\w+\-.]+):)?\/\/(?:(\w+:\w+)@)?([\w.]*)(?::(\d+))?(\S*)$/;
|
|
||||||
var dataUrlRegexp = /^data:.+\,.+$/;
|
|
||||||
|
|
||||||
function urlParse(aUrl) {
|
|
||||||
var match = aUrl.match(urlRegexp);
|
|
||||||
if (!match) {
|
|
||||||
return null;
|
|
||||||
}
|
|
||||||
return {
|
|
||||||
scheme: match[1],
|
|
||||||
auth: match[2],
|
|
||||||
host: match[3],
|
|
||||||
port: match[4],
|
|
||||||
path: match[5]
|
|
||||||
};
|
|
||||||
}
|
|
||||||
exports.urlParse = urlParse;
|
|
||||||
|
|
||||||
function urlGenerate(aParsedUrl) {
|
|
||||||
var url = '';
|
|
||||||
if (aParsedUrl.scheme) {
|
|
||||||
url += aParsedUrl.scheme + ':';
|
|
||||||
}
|
|
||||||
url += '//';
|
|
||||||
if (aParsedUrl.auth) {
|
|
||||||
url += aParsedUrl.auth + '@';
|
|
||||||
}
|
|
||||||
if (aParsedUrl.host) {
|
|
||||||
url += aParsedUrl.host;
|
|
||||||
}
|
|
||||||
if (aParsedUrl.port) {
|
|
||||||
url += ":" + aParsedUrl.port
|
|
||||||
}
|
|
||||||
if (aParsedUrl.path) {
|
|
||||||
url += aParsedUrl.path;
|
|
||||||
}
|
|
||||||
return url;
|
|
||||||
}
|
|
||||||
exports.urlGenerate = urlGenerate;
|
|
||||||
|
|
||||||
/**
|
|
||||||
* Normalizes a path, or the path portion of a URL:
|
|
||||||
*
|
|
||||||
* - Replaces consecutive slashes with one slash.
|
|
||||||
* - Removes unnecessary '.' parts.
|
|
||||||
* - Removes unnecessary '<dir>/..' parts.
|
|
||||||
*
|
|
||||||
* Based on code in the Node.js 'path' core module.
|
|
||||||
*
|
|
||||||
* @param aPath The path or url to normalize.
|
|
||||||
*/
|
|
||||||
function normalize(aPath) {
|
|
||||||
var path = aPath;
|
|
||||||
var url = urlParse(aPath);
|
|
||||||
if (url) {
|
|
||||||
if (!url.path) {
|
|
||||||
return aPath;
|
|
||||||
}
|
|
||||||
path = url.path;
|
|
||||||
}
|
|
||||||
var isAbsolute = exports.isAbsolute(path);
|
|
||||||
|
|
||||||
var parts = path.split(/\/+/);
|
|
||||||
for (var part, up = 0, i = parts.length - 1; i >= 0; i--) {
|
|
||||||
part = parts[i];
|
|
||||||
if (part === '.') {
|
|
||||||
parts.splice(i, 1);
|
|
||||||
} else if (part === '..') {
|
|
||||||
up++;
|
|
||||||
} else if (up > 0) {
|
|
||||||
if (part === '') {
|
|
||||||
// The first part is blank if the path is absolute. Trying to go
|
|
||||||
// above the root is a no-op. Therefore we can remove all '..' parts
|
|
||||||
// directly after the root.
|
|
||||||
parts.splice(i + 1, up);
|
|
||||||
up = 0;
|
|
||||||
} else {
|
|
||||||
parts.splice(i, 2);
|
|
||||||
up--;
|
|
||||||
}
|
|
||||||
}
|
|
||||||
}
|
|
||||||
path = parts.join('/');
|
|
||||||
|
|
||||||
if (path === '') {
|
|
||||||
path = isAbsolute ? '/' : '.';
|
|
||||||
}
|
|
||||||
|
|
||||||
if (url) {
|
|
||||||
url.path = path;
|
|
||||||
return urlGenerate(url);
|
|
||||||
}
|
|
||||||
return path;
|
|
||||||
}
|
|
||||||
exports.normalize = normalize;
|
|
||||||
|
|
||||||
/**
|
|
||||||
* Joins two paths/URLs.
|
|
||||||
*
|
|
||||||
* @param aRoot The root path or URL.
|
|
||||||
* @param aPath The path or URL to be joined with the root.
|
|
||||||
*
|
|
||||||
* - If aPath is a URL or a data URI, aPath is returned, unless aPath is a
|
|
||||||
* scheme-relative URL: Then the scheme of aRoot, if any, is prepended
|
|
||||||
* first.
|
|
||||||
* - Otherwise aPath is a path. If aRoot is a URL, then its path portion
|
|
||||||
* is updated with the result and aRoot is returned. Otherwise the result
|
|
||||||
* is returned.
|
|
||||||
* - If aPath is absolute, the result is aPath.
|
|
||||||
* - Otherwise the two paths are joined with a slash.
|
|
||||||
* - Joining for example 'http://' and 'www.example.com' is also supported.
|
|
||||||
*/
|
|
||||||
function join(aRoot, aPath) {
|
|
||||||
if (aRoot === "") {
|
|
||||||
aRoot = ".";
|
|
||||||
}
|
|
||||||
if (aPath === "") {
|
|
||||||
aPath = ".";
|
|
||||||
}
|
|
||||||
var aPathUrl = urlParse(aPath);
|
|
||||||
var aRootUrl = urlParse(aRoot);
|
|
||||||
if (aRootUrl) {
|
|
||||||
aRoot = aRootUrl.path || '/';
|
|
||||||
}
|
|
||||||
|
|
||||||
// `join(foo, '//www.example.org')`
|
|
||||||
if (aPathUrl && !aPathUrl.scheme) {
|
|
||||||
if (aRootUrl) {
|
|
||||||
aPathUrl.scheme = aRootUrl.scheme;
|
|
||||||
}
|
|
||||||
return urlGenerate(aPathUrl);
|
|
||||||
}
|
|
||||||
|
|
||||||
if (aPathUrl || aPath.match(dataUrlRegexp)) {
|
|
||||||
return aPath;
|
|
||||||
}
|
|
||||||
|
|
||||||
// `join('http://', 'www.example.com')`
|
|
||||||
if (aRootUrl && !aRootUrl.host && !aRootUrl.path) {
|
|
||||||
aRootUrl.host = aPath;
|
|
||||||
return urlGenerate(aRootUrl);
|
|
||||||
}
|
|
||||||
|
|
||||||
var joined = aPath.charAt(0) === '/'
|
|
||||||
? aPath
|
|
||||||
: normalize(aRoot.replace(/\/+$/, '') + '/' + aPath);
|
|
||||||
|
|
||||||
if (aRootUrl) {
|
|
||||||
aRootUrl.path = joined;
|
|
||||||
return urlGenerate(aRootUrl);
|
|
||||||
}
|
|
||||||
return joined;
|
|
||||||
}
|
|
||||||
exports.join = join;
|
|
||||||
|
|
||||||
exports.isAbsolute = function (aPath) {
|
|
||||||
return aPath.charAt(0) === '/' || !!aPath.match(urlRegexp);
|
|
||||||
};
|
|
||||||
|
|
||||||
/**
|
|
||||||
* Make a path relative to a URL or another path.
|
|
||||||
*
|
|
||||||
* @param aRoot The root path or URL.
|
|
||||||
* @param aPath The path or URL to be made relative to aRoot.
|
|
||||||
*/
|
|
||||||
function relative(aRoot, aPath) {
|
|
||||||
if (aRoot === "") {
|
|
||||||
aRoot = ".";
|
|
||||||
}
|
|
||||||
|
|
||||||
aRoot = aRoot.replace(/\/$/, '');
|
|
||||||
|
|
||||||
// It is possible for the path to be above the root. In this case, simply
|
|
||||||
// checking whether the root is a prefix of the path won't work. Instead, we
|
|
||||||
// need to remove components from the root one by one, until either we find
|
|
||||||
// a prefix that fits, or we run out of components to remove.
|
|
||||||
var level = 0;
|
|
||||||
while (aPath.indexOf(aRoot + '/') !== 0) {
|
|
||||||
var index = aRoot.lastIndexOf("/");
|
|
||||||
if (index < 0) {
|
|
||||||
return aPath;
|
|
||||||
}
|
|
||||||
|
|
||||||
// If the only part of the root that is left is the scheme (i.e. http://,
|
|
||||||
// file:///, etc.), one or more slashes (/), or simply nothing at all, we
|
|
||||||
// have exhausted all components, so the path is not relative to the root.
|
|
||||||
aRoot = aRoot.slice(0, index);
|
|
||||||
if (aRoot.match(/^([^\/]+:\/)?\/*$/)) {
|
|
||||||
return aPath;
|
|
||||||
}
|
|
||||||
|
|
||||||
++level;
|
|
||||||
}
|
|
||||||
|
|
||||||
// Make sure we add a "../" for each component we removed from the root.
|
|
||||||
return Array(level + 1).join("../") + aPath.substr(aRoot.length + 1);
|
|
||||||
}
|
|
||||||
exports.relative = relative;
|
|
||||||
|
|
||||||
var supportsNullProto = (function () {
|
|
||||||
var obj = Object.create(null);
|
|
||||||
return !('__proto__' in obj);
|
|
||||||
}());
|
|
||||||
|
|
||||||
function identity (s) {
|
|
||||||
return s;
|
|
||||||
}
|
|
||||||
|
|
||||||
/**
|
|
||||||
* Because behavior goes wacky when you set `__proto__` on objects, we
|
|
||||||
* have to prefix all the strings in our set with an arbitrary character.
|
|
||||||
*
|
|
||||||
* See https://github.com/mozilla/source-map/pull/31 and
|
|
||||||
* https://github.com/mozilla/source-map/issues/30
|
|
||||||
*
|
|
||||||
* @param String aStr
|
|
||||||
*/
|
|
||||||
function toSetString(aStr) {
|
|
||||||
if (isProtoString(aStr)) {
|
|
||||||
return '$' + aStr;
|
|
||||||
}
|
|
||||||
|
|
||||||
return aStr;
|
|
||||||
}
|
|
||||||
exports.toSetString = supportsNullProto ? identity : toSetString;
|
|
||||||
|
|
||||||
function fromSetString(aStr) {
|
|
||||||
if (isProtoString(aStr)) {
|
|
||||||
return aStr.slice(1);
|
|
||||||
}
|
|
||||||
|
|
||||||
return aStr;
|
|
||||||
}
|
|
||||||
exports.fromSetString = supportsNullProto ? identity : fromSetString;
|
|
||||||
|
|
||||||
function isProtoString(s) {
|
|
||||||
if (!s) {
|
|
||||||
return false;
|
|
||||||
}
|
|
||||||
|
|
||||||
var length = s.length;
|
|
||||||
|
|
||||||
if (length < 9 /* "__proto__".length */) {
|
|
||||||
return false;
|
|
||||||
}
|
|
||||||
|
|
||||||
if (s.charCodeAt(length - 1) !== 95 /* '_' */ ||
|
|
||||||
s.charCodeAt(length - 2) !== 95 /* '_' */ ||
|
|
||||||
s.charCodeAt(length - 3) !== 111 /* 'o' */ ||
|
|
||||||
s.charCodeAt(length - 4) !== 116 /* 't' */ ||
|
|
||||||
s.charCodeAt(length - 5) !== 111 /* 'o' */ ||
|
|
||||||
s.charCodeAt(length - 6) !== 114 /* 'r' */ ||
|
|
||||||
s.charCodeAt(length - 7) !== 112 /* 'p' */ ||
|
|
||||||
s.charCodeAt(length - 8) !== 95 /* '_' */ ||
|
|
||||||
s.charCodeAt(length - 9) !== 95 /* '_' */) {
|
|
||||||
return false;
|
|
||||||
}
|
|
||||||
|
|
||||||
for (var i = length - 10; i >= 0; i--) {
|
|
||||||
if (s.charCodeAt(i) !== 36 /* '$' */) {
|
|
||||||
return false;
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
return true;
|
|
||||||
}
|
|
||||||
|
|
||||||
/**
|
|
||||||
* Comparator between two mappings where the original positions are compared.
|
|
||||||
*
|
|
||||||
* Optionally pass in `true` as `onlyCompareGenerated` to consider two
|
|
||||||
* mappings with the same original source/line/column, but different generated
|
|
||||||
* line and column the same. Useful when searching for a mapping with a
|
|
||||||
* stubbed out mapping.
|
|
||||||
*/
|
|
||||||
function compareByOriginalPositions(mappingA, mappingB, onlyCompareOriginal) {
|
|
||||||
var cmp = mappingA.source - mappingB.source;
|
|
||||||
if (cmp !== 0) {
|
|
||||||
return cmp;
|
|
||||||
}
|
|
||||||
|
|
||||||
cmp = mappingA.originalLine - mappingB.originalLine;
|
|
||||||
if (cmp !== 0) {
|
|
||||||
return cmp;
|
|
||||||
}
|
|
||||||
|
|
||||||
cmp = mappingA.originalColumn - mappingB.originalColumn;
|
|
||||||
if (cmp !== 0 || onlyCompareOriginal) {
|
|
||||||
return cmp;
|
|
||||||
}
|
|
||||||
|
|
||||||
cmp = mappingA.generatedColumn - mappingB.generatedColumn;
|
|
||||||
if (cmp !== 0) {
|
|
||||||
return cmp;
|
|
||||||
}
|
|
||||||
|
|
||||||
cmp = mappingA.generatedLine - mappingB.generatedLine;
|
|
||||||
if (cmp !== 0) {
|
|
||||||
return cmp;
|
|
||||||
}
|
|
||||||
|
|
||||||
return mappingA.name - mappingB.name;
|
|
||||||
}
|
|
||||||
exports.compareByOriginalPositions = compareByOriginalPositions;
|
|
||||||
|
|
||||||
/**
|
|
||||||
* Comparator between two mappings with deflated source and name indices where
|
|
||||||
* the generated positions are compared.
|
|
||||||
*
|
|
||||||
* Optionally pass in `true` as `onlyCompareGenerated` to consider two
|
|
||||||
* mappings with the same generated line and column, but different
|
|
||||||
* source/name/original line and column the same. Useful when searching for a
|
|
||||||
* mapping with a stubbed out mapping.
|
|
||||||
*/
|
|
||||||
function compareByGeneratedPositionsDeflated(mappingA, mappingB, onlyCompareGenerated) {
|
|
||||||
var cmp = mappingA.generatedLine - mappingB.generatedLine;
|
|
||||||
if (cmp !== 0) {
|
|
||||||
return cmp;
|
|
||||||
}
|
|
||||||
|
|
||||||
cmp = mappingA.generatedColumn - mappingB.generatedColumn;
|
|
||||||
if (cmp !== 0 || onlyCompareGenerated) {
|
|
||||||
return cmp;
|
|
||||||
}
|
|
||||||
|
|
||||||
cmp = mappingA.source - mappingB.source;
|
|
||||||
if (cmp !== 0) {
|
|
||||||
return cmp;
|
|
||||||
}
|
|
||||||
|
|
||||||
cmp = mappingA.originalLine - mappingB.originalLine;
|
|
||||||
if (cmp !== 0) {
|
|
||||||
return cmp;
|
|
||||||
}
|
|
||||||
|
|
||||||
cmp = mappingA.originalColumn - mappingB.originalColumn;
|
|
||||||
if (cmp !== 0) {
|
|
||||||
return cmp;
|
|
||||||
}
|
|
||||||
|
|
||||||
return mappingA.name - mappingB.name;
|
|
||||||
}
|
|
||||||
exports.compareByGeneratedPositionsDeflated = compareByGeneratedPositionsDeflated;
|
|
||||||
|
|
||||||
function strcmp(aStr1, aStr2) {
|
|
||||||
if (aStr1 === aStr2) {
|
|
||||||
return 0;
|
|
||||||
}
|
|
||||||
|
|
||||||
if (aStr1 > aStr2) {
|
|
||||||
return 1;
|
|
||||||
}
|
|
||||||
|
|
||||||
return -1;
|
|
||||||
}
|
|
||||||
|
|
||||||
/**
|
|
||||||
* Comparator between two mappings with inflated source and name strings where
|
|
||||||
* the generated positions are compared.
|
|
||||||
*/
|
|
||||||
function compareByGeneratedPositionsInflated(mappingA, mappingB) {
|
|
||||||
var cmp = mappingA.generatedLine - mappingB.generatedLine;
|
|
||||||
if (cmp !== 0) {
|
|
||||||
return cmp;
|
|
||||||
}
|
|
||||||
|
|
||||||
cmp = mappingA.generatedColumn - mappingB.generatedColumn;
|
|
||||||
if (cmp !== 0) {
|
|
||||||
return cmp;
|
|
||||||
}
|
|
||||||
|
|
||||||
cmp = strcmp(mappingA.source, mappingB.source);
|
|
||||||
if (cmp !== 0) {
|
|
||||||
return cmp;
|
|
||||||
}
|
|
||||||
|
|
||||||
cmp = mappingA.originalLine - mappingB.originalLine;
|
|
||||||
if (cmp !== 0) {
|
|
||||||
return cmp;
|
|
||||||
}
|
|
||||||
|
|
||||||
cmp = mappingA.originalColumn - mappingB.originalColumn;
|
|
||||||
if (cmp !== 0) {
|
|
||||||
return cmp;
|
|
||||||
}
|
|
||||||
|
|
||||||
return strcmp(mappingA.name, mappingB.name);
|
|
||||||
}
|
|
||||||
exports.compareByGeneratedPositionsInflated = compareByGeneratedPositionsInflated;
|
|
254
lib/node_modules/source-map/package.json
generated
vendored
254
lib/node_modules/source-map/package.json
generated
vendored
@ -1,254 +0,0 @@
|
|||||||
{
|
|
||||||
"_args": [
|
|
||||||
[
|
|
||||||
{
|
|
||||||
"raw": "source-map@~0.5.1",
|
|
||||||
"scope": null,
|
|
||||||
"escapedName": "source-map",
|
|
||||||
"name": "source-map",
|
|
||||||
"rawSpec": "~0.5.1",
|
|
||||||
"spec": ">=0.5.1 <0.6.0",
|
|
||||||
"type": "range"
|
|
||||||
},
|
|
||||||
"C:\\Users\\Dan\\node_modules\\uglify-es"
|
|
||||||
]
|
|
||||||
],
|
|
||||||
"_from": "source-map@>=0.5.1 <0.6.0",
|
|
||||||
"_id": "source-map@0.5.6",
|
|
||||||
"_inCache": true,
|
|
||||||
"_location": "/source-map",
|
|
||||||
"_nodeVersion": "5.3.0",
|
|
||||||
"_npmOperationalInternal": {
|
|
||||||
"host": "packages-12-west.internal.npmjs.com",
|
|
||||||
"tmp": "tmp/source-map-0.5.6.tgz_1462209962516_0.9263619624543935"
|
|
||||||
},
|
|
||||||
"_npmUser": {
|
|
||||||
"name": "nickfitzgerald",
|
|
||||||
"email": "fitzgen@gmail.com"
|
|
||||||
},
|
|
||||||
"_npmVersion": "3.3.12",
|
|
||||||
"_phantomChildren": {},
|
|
||||||
"_requested": {
|
|
||||||
"raw": "source-map@~0.5.1",
|
|
||||||
"scope": null,
|
|
||||||
"escapedName": "source-map",
|
|
||||||
"name": "source-map",
|
|
||||||
"rawSpec": "~0.5.1",
|
|
||||||
"spec": ">=0.5.1 <0.6.0",
|
|
||||||
"type": "range"
|
|
||||||
},
|
|
||||||
"_requiredBy": [
|
|
||||||
"/uglify-es"
|
|
||||||
],
|
|
||||||
"_resolved": "https://registry.npmjs.org/source-map/-/source-map-0.5.6.tgz",
|
|
||||||
"_shasum": "75ce38f52bf0733c5a7f0c118d81334a2bb5f412",
|
|
||||||
"_shrinkwrap": null,
|
|
||||||
"_spec": "source-map@~0.5.1",
|
|
||||||
"_where": "C:\\Users\\Dan\\node_modules\\uglify-es",
|
|
||||||
"author": {
|
|
||||||
"name": "Nick Fitzgerald",
|
|
||||||
"email": "nfitzgerald@mozilla.com"
|
|
||||||
},
|
|
||||||
"bugs": {
|
|
||||||
"url": "https://github.com/mozilla/source-map/issues"
|
|
||||||
},
|
|
||||||
"contributors": [
|
|
||||||
{
|
|
||||||
"name": "Tobias Koppers",
|
|
||||||
"email": "tobias.koppers@googlemail.com"
|
|
||||||
},
|
|
||||||
{
|
|
||||||
"name": "Duncan Beevers",
|
|
||||||
"email": "duncan@dweebd.com"
|
|
||||||
},
|
|
||||||
{
|
|
||||||
"name": "Stephen Crane",
|
|
||||||
"email": "scrane@mozilla.com"
|
|
||||||
},
|
|
||||||
{
|
|
||||||
"name": "Ryan Seddon",
|
|
||||||
"email": "seddon.ryan@gmail.com"
|
|
||||||
},
|
|
||||||
{
|
|
||||||
"name": "Miles Elam",
|
|
||||||
"email": "miles.elam@deem.com"
|
|
||||||
},
|
|
||||||
{
|
|
||||||
"name": "Mihai Bazon",
|
|
||||||
"email": "mihai.bazon@gmail.com"
|
|
||||||
},
|
|
||||||
{
|
|
||||||
"name": "Michael Ficarra",
|
|
||||||
"email": "github.public.email@michael.ficarra.me"
|
|
||||||
},
|
|
||||||
{
|
|
||||||
"name": "Todd Wolfson",
|
|
||||||
"email": "todd@twolfson.com"
|
|
||||||
},
|
|
||||||
{
|
|
||||||
"name": "Alexander Solovyov",
|
|
||||||
"email": "alexander@solovyov.net"
|
|
||||||
},
|
|
||||||
{
|
|
||||||
"name": "Felix Gnass",
|
|
||||||
"email": "fgnass@gmail.com"
|
|
||||||
},
|
|
||||||
{
|
|
||||||
"name": "Conrad Irwin",
|
|
||||||
"email": "conrad.irwin@gmail.com"
|
|
||||||
},
|
|
||||||
{
|
|
||||||
"name": "usrbincc",
|
|
||||||
"email": "usrbincc@yahoo.com"
|
|
||||||
},
|
|
||||||
{
|
|
||||||
"name": "David Glasser",
|
|
||||||
"email": "glasser@davidglasser.net"
|
|
||||||
},
|
|
||||||
{
|
|
||||||
"name": "Chase Douglas",
|
|
||||||
"email": "chase@newrelic.com"
|
|
||||||
},
|
|
||||||
{
|
|
||||||
"name": "Evan Wallace",
|
|
||||||
"email": "evan.exe@gmail.com"
|
|
||||||
},
|
|
||||||
{
|
|
||||||
"name": "Heather Arthur",
|
|
||||||
"email": "fayearthur@gmail.com"
|
|
||||||
},
|
|
||||||
{
|
|
||||||
"name": "Hugh Kennedy",
|
|
||||||
"email": "hughskennedy@gmail.com"
|
|
||||||
},
|
|
||||||
{
|
|
||||||
"name": "David Glasser",
|
|
||||||
"email": "glasser@davidglasser.net"
|
|
||||||
},
|
|
||||||
{
|
|
||||||
"name": "Simon Lydell",
|
|
||||||
"email": "simon.lydell@gmail.com"
|
|
||||||
},
|
|
||||||
{
|
|
||||||
"name": "Jmeas Smith",
|
|
||||||
"email": "jellyes2@gmail.com"
|
|
||||||
},
|
|
||||||
{
|
|
||||||
"name": "Michael Z Goddard",
|
|
||||||
"email": "mzgoddard@gmail.com"
|
|
||||||
},
|
|
||||||
{
|
|
||||||
"name": "azu",
|
|
||||||
"email": "azu@users.noreply.github.com"
|
|
||||||
},
|
|
||||||
{
|
|
||||||
"name": "John Gozde",
|
|
||||||
"email": "john@gozde.ca"
|
|
||||||
},
|
|
||||||
{
|
|
||||||
"name": "Adam Kirkton",
|
|
||||||
"email": "akirkton@truefitinnovation.com"
|
|
||||||
},
|
|
||||||
{
|
|
||||||
"name": "Chris Montgomery",
|
|
||||||
"email": "christopher.montgomery@dowjones.com"
|
|
||||||
},
|
|
||||||
{
|
|
||||||
"name": "J. Ryan Stinnett",
|
|
||||||
"email": "jryans@gmail.com"
|
|
||||||
},
|
|
||||||
{
|
|
||||||
"name": "Jack Herrington",
|
|
||||||
"email": "jherrington@walmartlabs.com"
|
|
||||||
},
|
|
||||||
{
|
|
||||||
"name": "Chris Truter",
|
|
||||||
"email": "jeffpalentine@gmail.com"
|
|
||||||
},
|
|
||||||
{
|
|
||||||
"name": "Daniel Espeset",
|
|
||||||
"email": "daniel@danielespeset.com"
|
|
||||||
},
|
|
||||||
{
|
|
||||||
"name": "Jamie Wong",
|
|
||||||
"email": "jamie.lf.wong@gmail.com"
|
|
||||||
},
|
|
||||||
{
|
|
||||||
"name": "Eddy Bruël",
|
|
||||||
"email": "ejpbruel@mozilla.com"
|
|
||||||
},
|
|
||||||
{
|
|
||||||
"name": "Hawken Rives",
|
|
||||||
"email": "hawkrives@gmail.com"
|
|
||||||
},
|
|
||||||
{
|
|
||||||
"name": "Gilad Peleg",
|
|
||||||
"email": "giladp007@gmail.com"
|
|
||||||
},
|
|
||||||
{
|
|
||||||
"name": "djchie",
|
|
||||||
"email": "djchie.dev@gmail.com"
|
|
||||||
},
|
|
||||||
{
|
|
||||||
"name": "Gary Ye",
|
|
||||||
"email": "garysye@gmail.com"
|
|
||||||
},
|
|
||||||
{
|
|
||||||
"name": "Nicolas Lalevée",
|
|
||||||
"email": "nicolas.lalevee@hibnet.org"
|
|
||||||
}
|
|
||||||
],
|
|
||||||
"dependencies": {},
|
|
||||||
"description": "Generates and consumes source maps",
|
|
||||||
"devDependencies": {
|
|
||||||
"doctoc": "^0.15.0",
|
|
||||||
"webpack": "^1.12.0"
|
|
||||||
},
|
|
||||||
"directories": {},
|
|
||||||
"dist": {
|
|
||||||
"shasum": "75ce38f52bf0733c5a7f0c118d81334a2bb5f412",
|
|
||||||
"tarball": "https://registry.npmjs.org/source-map/-/source-map-0.5.6.tgz"
|
|
||||||
},
|
|
||||||
"engines": {
|
|
||||||
"node": ">=0.10.0"
|
|
||||||
},
|
|
||||||
"files": [
|
|
||||||
"source-map.js",
|
|
||||||
"lib/",
|
|
||||||
"dist/source-map.debug.js",
|
|
||||||
"dist/source-map.js",
|
|
||||||
"dist/source-map.min.js",
|
|
||||||
"dist/source-map.min.js.map"
|
|
||||||
],
|
|
||||||
"gitHead": "aa0398ced67beebea34f0d36f766505656c344f6",
|
|
||||||
"homepage": "https://github.com/mozilla/source-map",
|
|
||||||
"license": "BSD-3-Clause",
|
|
||||||
"main": "./source-map.js",
|
|
||||||
"maintainers": [
|
|
||||||
{
|
|
||||||
"name": "mozilla-devtools",
|
|
||||||
"email": "mozilla-developer-tools@googlegroups.com"
|
|
||||||
},
|
|
||||||
{
|
|
||||||
"name": "mozilla",
|
|
||||||
"email": "dherman@mozilla.com"
|
|
||||||
},
|
|
||||||
{
|
|
||||||
"name": "nickfitzgerald",
|
|
||||||
"email": "fitzgen@gmail.com"
|
|
||||||
}
|
|
||||||
],
|
|
||||||
"name": "source-map",
|
|
||||||
"optionalDependencies": {},
|
|
||||||
"readme": "ERROR: No README data found!",
|
|
||||||
"repository": {
|
|
||||||
"type": "git",
|
|
||||||
"url": "git+ssh://git@github.com/mozilla/source-map.git"
|
|
||||||
},
|
|
||||||
"scripts": {
|
|
||||||
"build": "webpack --color",
|
|
||||||
"test": "npm run build && node test/run-tests.js",
|
|
||||||
"toc": "doctoc --title '## Table of Contents' README.md && doctoc --title '## Table of Contents' CONTRIBUTING.md"
|
|
||||||
},
|
|
||||||
"version": "0.5.6"
|
|
||||||
}
|
|
8
lib/node_modules/source-map/source-map.js
generated
vendored
8
lib/node_modules/source-map/source-map.js
generated
vendored
@ -1,8 +0,0 @@
|
|||||||
/*
|
|
||||||
* Copyright 2009-2011 Mozilla Foundation and contributors
|
|
||||||
* Licensed under the New BSD license. See LICENSE.txt or:
|
|
||||||
* http://opensource.org/licenses/BSD-3-Clause
|
|
||||||
*/
|
|
||||||
exports.SourceMapGenerator = require('./lib/source-map-generator').SourceMapGenerator;
|
|
||||||
exports.SourceMapConsumer = require('./lib/source-map-consumer').SourceMapConsumer;
|
|
||||||
exports.SourceNode = require('./lib/source-node').SourceNode;
|
|
29
lib/node_modules/uglify-js/LICENSE
generated
vendored
29
lib/node_modules/uglify-js/LICENSE
generated
vendored
@ -1,29 +0,0 @@
|
|||||||
UglifyJS is released under the BSD license:
|
|
||||||
|
|
||||||
Copyright 2012-2019 (c) Mihai Bazon <mihai.bazon@gmail.com>
|
|
||||||
|
|
||||||
Redistribution and use in source and binary forms, with or without
|
|
||||||
modification, are permitted provided that the following conditions
|
|
||||||
are met:
|
|
||||||
|
|
||||||
* Redistributions of source code must retain the above
|
|
||||||
copyright notice, this list of conditions and the following
|
|
||||||
disclaimer.
|
|
||||||
|
|
||||||
* Redistributions in binary form must reproduce the above
|
|
||||||
copyright notice, this list of conditions and the following
|
|
||||||
disclaimer in the documentation and/or other materials
|
|
||||||
provided with the distribution.
|
|
||||||
|
|
||||||
THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDER “AS IS” AND ANY
|
|
||||||
EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
|
|
||||||
IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
|
|
||||||
PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER BE
|
|
||||||
LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY,
|
|
||||||
OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
|
|
||||||
PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR
|
|
||||||
PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
|
|
||||||
THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR
|
|
||||||
TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF
|
|
||||||
THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
|
|
||||||
SUCH DAMAGE.
|
|
1356
lib/node_modules/uglify-js/README.md
generated
vendored
1356
lib/node_modules/uglify-js/README.md
generated
vendored
File diff suppressed because it is too large
Load Diff
589
lib/node_modules/uglify-js/bin/uglifyjs
generated
vendored
589
lib/node_modules/uglify-js/bin/uglifyjs
generated
vendored
@ -1,589 +0,0 @@
|
|||||||
#! /usr/bin/env node
|
|
||||||
// -*- js -*-
|
|
||||||
|
|
||||||
"use strict";
|
|
||||||
|
|
||||||
require("../tools/tty");
|
|
||||||
|
|
||||||
var fs = require("fs");
|
|
||||||
var info = require("../package.json");
|
|
||||||
var path = require("path");
|
|
||||||
var UglifyJS = require("../tools/node");
|
|
||||||
|
|
||||||
var skip_keys = [ "cname", "fixed", "inlined", "parent_scope", "scope", "uses_eval", "uses_with" ];
|
|
||||||
var files = {};
|
|
||||||
var options = {};
|
|
||||||
var short_forms = {
|
|
||||||
b: "beautify",
|
|
||||||
c: "compress",
|
|
||||||
d: "define",
|
|
||||||
e: "enclose",
|
|
||||||
h: "help",
|
|
||||||
m: "mangle",
|
|
||||||
o: "output",
|
|
||||||
O: "output-opts",
|
|
||||||
p: "parse",
|
|
||||||
v: "version",
|
|
||||||
V: "version",
|
|
||||||
};
|
|
||||||
var args = process.argv.slice(2);
|
|
||||||
var paths = [];
|
|
||||||
var output, nameCache;
|
|
||||||
var specified = {};
|
|
||||||
while (args.length) {
|
|
||||||
var arg = args.shift();
|
|
||||||
if (arg[0] != "-") {
|
|
||||||
paths.push(arg);
|
|
||||||
} else if (arg == "--") {
|
|
||||||
paths = paths.concat(args);
|
|
||||||
break;
|
|
||||||
} else if (arg[1] == "-") {
|
|
||||||
process_option(arg.slice(2));
|
|
||||||
} else [].forEach.call(arg.slice(1), function(letter, index, arg) {
|
|
||||||
if (!(letter in short_forms)) fatal("invalid option -" + letter);
|
|
||||||
process_option(short_forms[letter], index + 1 < arg.length);
|
|
||||||
});
|
|
||||||
}
|
|
||||||
|
|
||||||
function process_option(name, no_value) {
|
|
||||||
specified[name] = true;
|
|
||||||
switch (name) {
|
|
||||||
case "help":
|
|
||||||
switch (read_value()) {
|
|
||||||
case "ast":
|
|
||||||
print(UglifyJS.describe_ast());
|
|
||||||
break;
|
|
||||||
case "options":
|
|
||||||
var text = [];
|
|
||||||
var toplevels = [];
|
|
||||||
var padding = "";
|
|
||||||
var defaults = UglifyJS.default_options();
|
|
||||||
for (var name in defaults) {
|
|
||||||
var option = defaults[name];
|
|
||||||
if (option && typeof option == "object") {
|
|
||||||
text.push("--" + ({
|
|
||||||
output: "beautify",
|
|
||||||
sourceMap: "source-map",
|
|
||||||
}[name] || name) + " options:");
|
|
||||||
text.push(format_object(option));
|
|
||||||
text.push("");
|
|
||||||
} else {
|
|
||||||
if (padding.length < name.length) padding = Array(name.length + 1).join(" ");
|
|
||||||
toplevels.push([ {
|
|
||||||
keep_fnames: "keep-fnames",
|
|
||||||
nameCache: "name-cache",
|
|
||||||
}[name] || name, option ]);
|
|
||||||
}
|
|
||||||
}
|
|
||||||
toplevels.forEach(function(tokens) {
|
|
||||||
text.push("--" + tokens[0] + padding.slice(tokens[0].length - 2) + tokens[1]);
|
|
||||||
});
|
|
||||||
print(text.join("\n"));
|
|
||||||
break;
|
|
||||||
default:
|
|
||||||
print([
|
|
||||||
"Usage: uglifyjs [files...] [options]",
|
|
||||||
"",
|
|
||||||
"Options:",
|
|
||||||
" -h, --help Print usage information.",
|
|
||||||
" `--help options` for details on available options.",
|
|
||||||
" -v, -V, --version Print version number.",
|
|
||||||
" -p, --parse <options> Specify parser options.",
|
|
||||||
" -c, --compress [options] Enable compressor/specify compressor options.",
|
|
||||||
" -m, --mangle [options] Mangle names/specify mangler options.",
|
|
||||||
" --mangle-props [options] Mangle properties/specify mangler options.",
|
|
||||||
" -b, --beautify [options] Beautify output/specify output options.",
|
|
||||||
" -O, --output-opts <options> Output options (beautify disabled).",
|
|
||||||
" -o, --output <file> Output file (default STDOUT).",
|
|
||||||
" --annotations Process and preserve comment annotations.",
|
|
||||||
" --no-annotations Ignore and discard comment annotations.",
|
|
||||||
" --comments [filter] Preserve copyright comments in the output.",
|
|
||||||
" --config-file <file> Read minify() options from JSON file.",
|
|
||||||
" -d, --define <expr>[=value] Global definitions.",
|
|
||||||
" -e, --enclose [arg[,...][:value[,...]]] Embed everything in a big function, with configurable argument(s) & value(s).",
|
|
||||||
" --ie8 Support non-standard Internet Explorer 8.",
|
|
||||||
" --keep-fnames Do not mangle/drop function names. Useful for code relying on Function.prototype.name.",
|
|
||||||
" --name-cache <file> File to hold mangled name mappings.",
|
|
||||||
" --rename Force symbol expansion.",
|
|
||||||
" --no-rename Disable symbol expansion.",
|
|
||||||
" --self Build UglifyJS as a library (implies --wrap UglifyJS)",
|
|
||||||
" --source-map [options] Enable source map/specify source map options.",
|
|
||||||
" --timings Display operations run time on STDERR.",
|
|
||||||
" --toplevel Compress and/or mangle variables in toplevel scope.",
|
|
||||||
" --validate Perform validation during AST manipulations.",
|
|
||||||
" --verbose Print diagnostic messages.",
|
|
||||||
" --warn Print warning messages.",
|
|
||||||
" --webkit Support non-standard Safari/Webkit.",
|
|
||||||
" --wrap <name> Embed everything as a function with “exports” corresponding to “name” globally.",
|
|
||||||
"",
|
|
||||||
"(internal debug use only)",
|
|
||||||
" --in-situ Warning: replaces original source files with minified output.",
|
|
||||||
" --reduce-test Reduce a standalone test case (assumes cloned repository).",
|
|
||||||
].join("\n"));
|
|
||||||
}
|
|
||||||
process.exit();
|
|
||||||
case "version":
|
|
||||||
print(info.name + " " + info.version);
|
|
||||||
process.exit();
|
|
||||||
case "config-file":
|
|
||||||
var config = JSON.parse(read_file(read_value(true)));
|
|
||||||
if (config.mangle && config.mangle.properties && config.mangle.properties.regex) {
|
|
||||||
config.mangle.properties.regex = UglifyJS.parse(config.mangle.properties.regex, {
|
|
||||||
expression: true,
|
|
||||||
}).value;
|
|
||||||
}
|
|
||||||
for (var key in config) if (!(key in options)) options[key] = config[key];
|
|
||||||
break;
|
|
||||||
case "compress":
|
|
||||||
case "mangle":
|
|
||||||
options[name] = parse_js(read_value(), options[name]);
|
|
||||||
break;
|
|
||||||
case "source-map":
|
|
||||||
options.sourceMap = parse_js(read_value(), options.sourceMap);
|
|
||||||
break;
|
|
||||||
case "enclose":
|
|
||||||
options[name] = read_value();
|
|
||||||
break;
|
|
||||||
case "annotations":
|
|
||||||
case "ie8":
|
|
||||||
case "timings":
|
|
||||||
case "toplevel":
|
|
||||||
case "validate":
|
|
||||||
case "webkit":
|
|
||||||
options[name] = true;
|
|
||||||
break;
|
|
||||||
case "no-annotations":
|
|
||||||
options.annotations = false;
|
|
||||||
break;
|
|
||||||
case "keep-fnames":
|
|
||||||
options.keep_fnames = true;
|
|
||||||
break;
|
|
||||||
case "wrap":
|
|
||||||
options[name] = read_value(true);
|
|
||||||
break;
|
|
||||||
case "verbose":
|
|
||||||
options.warnings = "verbose";
|
|
||||||
break;
|
|
||||||
case "warn":
|
|
||||||
if (!options.warnings) options.warnings = true;
|
|
||||||
break;
|
|
||||||
case "beautify":
|
|
||||||
options.output = parse_js(read_value(), options.output);
|
|
||||||
if (!("beautify" in options.output)) options.output.beautify = true;
|
|
||||||
break;
|
|
||||||
case "output-opts":
|
|
||||||
options.output = parse_js(read_value(true), options.output);
|
|
||||||
break;
|
|
||||||
case "comments":
|
|
||||||
if (typeof options.output != "object") options.output = {};
|
|
||||||
options.output.comments = read_value();
|
|
||||||
if (options.output.comments === true) options.output.comments = "some";
|
|
||||||
break;
|
|
||||||
case "define":
|
|
||||||
if (typeof options.compress != "object") options.compress = {};
|
|
||||||
options.compress.global_defs = parse_js(read_value(true), options.compress.global_defs, "define");
|
|
||||||
break;
|
|
||||||
case "mangle-props":
|
|
||||||
if (typeof options.mangle != "object") options.mangle = {};
|
|
||||||
options.mangle.properties = parse_js(read_value(), options.mangle.properties);
|
|
||||||
break;
|
|
||||||
case "name-cache":
|
|
||||||
nameCache = read_value(true);
|
|
||||||
options.nameCache = JSON.parse(read_file(nameCache, "{}"));
|
|
||||||
break;
|
|
||||||
case "output":
|
|
||||||
output = read_value(true);
|
|
||||||
break;
|
|
||||||
case "parse":
|
|
||||||
options.parse = parse_js(read_value(true), options.parse);
|
|
||||||
break;
|
|
||||||
case "rename":
|
|
||||||
options.rename = true;
|
|
||||||
break;
|
|
||||||
case "no-rename":
|
|
||||||
options.rename = false;
|
|
||||||
break;
|
|
||||||
case "in-situ":
|
|
||||||
case "reduce-test":
|
|
||||||
case "self":
|
|
||||||
break;
|
|
||||||
default:
|
|
||||||
fatal("invalid option --" + name);
|
|
||||||
}
|
|
||||||
|
|
||||||
function read_value(required) {
|
|
||||||
if (no_value || !args.length || args[0][0] == "-") {
|
|
||||||
if (required) fatal("missing option argument for --" + name);
|
|
||||||
return true;
|
|
||||||
}
|
|
||||||
return args.shift();
|
|
||||||
}
|
|
||||||
}
|
|
||||||
if (!output && options.sourceMap && options.sourceMap.url != "inline") fatal("cannot write source map to STDOUT");
|
|
||||||
if (specified["beautify"] && specified["output-opts"]) fatal("--beautify cannot be used with --output-opts");
|
|
||||||
[ "compress", "mangle" ].forEach(function(name) {
|
|
||||||
if (!(name in options)) options[name] = false;
|
|
||||||
});
|
|
||||||
if (options.mangle && options.mangle.properties) {
|
|
||||||
if (options.mangle.properties.domprops) {
|
|
||||||
delete options.mangle.properties.domprops;
|
|
||||||
} else {
|
|
||||||
if (typeof options.mangle.properties != "object") options.mangle.properties = {};
|
|
||||||
if (!Array.isArray(options.mangle.properties.reserved)) options.mangle.properties.reserved = [];
|
|
||||||
require("../tools/domprops").forEach(function(name) {
|
|
||||||
UglifyJS.push_uniq(options.mangle.properties.reserved, name);
|
|
||||||
});
|
|
||||||
}
|
|
||||||
}
|
|
||||||
if (/^ast|spidermonkey$/.test(output)) {
|
|
||||||
if (typeof options.output != "object") options.output = {};
|
|
||||||
options.output.ast = true;
|
|
||||||
options.output.code = false;
|
|
||||||
}
|
|
||||||
if (options.parse && (options.parse.acorn || options.parse.spidermonkey)
|
|
||||||
&& options.sourceMap && options.sourceMap.content == "inline") {
|
|
||||||
fatal("inline source map only works with built-in parser");
|
|
||||||
}
|
|
||||||
if (options.warnings) {
|
|
||||||
UglifyJS.AST_Node.log_function(print_error, options.warnings == "verbose");
|
|
||||||
delete options.warnings;
|
|
||||||
}
|
|
||||||
var convert_path = function(name) {
|
|
||||||
return name;
|
|
||||||
};
|
|
||||||
if (typeof options.sourceMap == "object" && "base" in options.sourceMap) {
|
|
||||||
convert_path = function() {
|
|
||||||
var base = options.sourceMap.base;
|
|
||||||
delete options.sourceMap.base;
|
|
||||||
return function(name) {
|
|
||||||
return path.relative(base, name);
|
|
||||||
};
|
|
||||||
}();
|
|
||||||
}
|
|
||||||
if (specified["self"]) {
|
|
||||||
if (paths.length) UglifyJS.AST_Node.warn("Ignoring input files since --self was passed");
|
|
||||||
if (!options.wrap) options.wrap = "UglifyJS";
|
|
||||||
paths = UglifyJS.FILES;
|
|
||||||
}
|
|
||||||
if (specified["in-situ"]) {
|
|
||||||
if (output && output != "spidermonkey" || specified["reduce-test"] || specified["self"]) {
|
|
||||||
fatal("incompatible options specified");
|
|
||||||
}
|
|
||||||
paths.forEach(function(name) {
|
|
||||||
print(name);
|
|
||||||
if (/^ast|spidermonkey$/.test(name)) fatal("invalid file name specified");
|
|
||||||
files = {};
|
|
||||||
files[convert_path(name)] = read_file(name);
|
|
||||||
output = name;
|
|
||||||
run();
|
|
||||||
});
|
|
||||||
} else if (paths.length) {
|
|
||||||
simple_glob(paths).forEach(function(name) {
|
|
||||||
files[convert_path(name)] = read_file(name);
|
|
||||||
});
|
|
||||||
run();
|
|
||||||
} else {
|
|
||||||
var timerId = process.stdin.isTTY && process.argv.length < 3 && setTimeout(function() {
|
|
||||||
print_error("Waiting for input... (use `--help` to print usage information)");
|
|
||||||
}, 1500);
|
|
||||||
var chunks = [];
|
|
||||||
process.stdin.setEncoding("utf8");
|
|
||||||
process.stdin.once("data", function() {
|
|
||||||
clearTimeout(timerId);
|
|
||||||
}).on("data", function(chunk) {
|
|
||||||
chunks.push(chunk);
|
|
||||||
}).on("end", function() {
|
|
||||||
files = { STDIN: chunks.join("") };
|
|
||||||
run();
|
|
||||||
});
|
|
||||||
process.stdin.resume();
|
|
||||||
}
|
|
||||||
|
|
||||||
function convert_ast(fn) {
|
|
||||||
return UglifyJS.AST_Node.from_mozilla_ast(Object.keys(files).reduce(fn, null));
|
|
||||||
}
|
|
||||||
|
|
||||||
function run() {
|
|
||||||
var content = options.sourceMap && options.sourceMap.content;
|
|
||||||
if (content && content != "inline") {
|
|
||||||
UglifyJS.AST_Node.info("Using input source map: {content}", {
|
|
||||||
content : content,
|
|
||||||
});
|
|
||||||
options.sourceMap.content = read_file(content, content);
|
|
||||||
}
|
|
||||||
try {
|
|
||||||
if (options.parse) {
|
|
||||||
if (options.parse.acorn) {
|
|
||||||
var annotations = Object.create(null);
|
|
||||||
files = convert_ast(function(toplevel, name) {
|
|
||||||
var content = files[name];
|
|
||||||
var list = annotations[name] = [];
|
|
||||||
var prev = -1;
|
|
||||||
return require("acorn").parse(content, {
|
|
||||||
allowHashBang: true,
|
|
||||||
ecmaVersion: "latest",
|
|
||||||
locations: true,
|
|
||||||
onComment: function(block, text, start, end) {
|
|
||||||
var match = /[@#]__PURE__/.exec(text);
|
|
||||||
if (!match) {
|
|
||||||
if (start != prev) return;
|
|
||||||
match = [ list[prev] ];
|
|
||||||
}
|
|
||||||
while (/\s/.test(content[end])) end++;
|
|
||||||
list[end] = match[0];
|
|
||||||
prev = end;
|
|
||||||
},
|
|
||||||
preserveParens: true,
|
|
||||||
program: toplevel,
|
|
||||||
sourceFile: name,
|
|
||||||
sourceType: "module",
|
|
||||||
});
|
|
||||||
});
|
|
||||||
files.walk(new UglifyJS.TreeWalker(function(node) {
|
|
||||||
if (!(node instanceof UglifyJS.AST_Call)) return;
|
|
||||||
var list = annotations[node.start.file];
|
|
||||||
var pure = list[node.start.pos];
|
|
||||||
if (!pure) {
|
|
||||||
var pos = node.start.parens;
|
|
||||||
if (pos) for (var i = 0; !pure && i < pos.length; i++) {
|
|
||||||
pure = list[pos[i]];
|
|
||||||
}
|
|
||||||
}
|
|
||||||
if (pure) node.pure = pure;
|
|
||||||
}));
|
|
||||||
} else if (options.parse.spidermonkey) {
|
|
||||||
files = convert_ast(function(toplevel, name) {
|
|
||||||
var obj = JSON.parse(files[name]);
|
|
||||||
if (!toplevel) return obj;
|
|
||||||
toplevel.body = toplevel.body.concat(obj.body);
|
|
||||||
return toplevel;
|
|
||||||
});
|
|
||||||
}
|
|
||||||
}
|
|
||||||
} catch (ex) {
|
|
||||||
fatal(ex);
|
|
||||||
}
|
|
||||||
var result;
|
|
||||||
if (specified["reduce-test"]) {
|
|
||||||
// load on demand - assumes cloned repository
|
|
||||||
var reduce_test = require("../test/reduce");
|
|
||||||
if (Object.keys(files).length != 1) fatal("can only test on a single file");
|
|
||||||
result = reduce_test(files[Object.keys(files)[0]], options, {
|
|
||||||
log: print_error,
|
|
||||||
verbose: true,
|
|
||||||
});
|
|
||||||
} else {
|
|
||||||
result = UglifyJS.minify(files, options);
|
|
||||||
}
|
|
||||||
if (result.error) {
|
|
||||||
var ex = result.error;
|
|
||||||
if (ex.name == "SyntaxError") {
|
|
||||||
print_error("Parse error at " + ex.filename + ":" + ex.line + "," + ex.col);
|
|
||||||
var file = files[ex.filename];
|
|
||||||
if (file) {
|
|
||||||
var col = ex.col;
|
|
||||||
var lines = file.split(/\r?\n/);
|
|
||||||
var line = lines[ex.line - 1];
|
|
||||||
if (!line && !col) {
|
|
||||||
line = lines[ex.line - 2];
|
|
||||||
col = line.length;
|
|
||||||
}
|
|
||||||
if (line) {
|
|
||||||
var limit = 70;
|
|
||||||
if (col > limit) {
|
|
||||||
line = line.slice(col - limit);
|
|
||||||
col = limit;
|
|
||||||
}
|
|
||||||
print_error(line.slice(0, 80));
|
|
||||||
print_error(line.slice(0, col).replace(/\S/g, " ") + "^");
|
|
||||||
}
|
|
||||||
}
|
|
||||||
} else if (ex.defs) {
|
|
||||||
print_error("Supported options:");
|
|
||||||
print_error(format_object(ex.defs));
|
|
||||||
}
|
|
||||||
fatal(ex);
|
|
||||||
} else if (output == "ast") {
|
|
||||||
if (!options.compress && !options.mangle) {
|
|
||||||
var toplevel = result.ast;
|
|
||||||
if (!(toplevel instanceof UglifyJS.AST_Toplevel)) {
|
|
||||||
if (!(toplevel instanceof UglifyJS.AST_Statement)) toplevel = new UglifyJS.AST_SimpleStatement({
|
|
||||||
body: toplevel,
|
|
||||||
});
|
|
||||||
toplevel = new UglifyJS.AST_Toplevel({
|
|
||||||
body: [ toplevel ],
|
|
||||||
});
|
|
||||||
}
|
|
||||||
toplevel.figure_out_scope({});
|
|
||||||
}
|
|
||||||
print(JSON.stringify(result.ast, function(key, value) {
|
|
||||||
if (value) switch (key) {
|
|
||||||
case "enclosed":
|
|
||||||
return value.length ? value.map(symdef) : undefined;
|
|
||||||
case "functions":
|
|
||||||
case "globals":
|
|
||||||
case "variables":
|
|
||||||
return value.size() ? value.map(symdef) : undefined;
|
|
||||||
case "thedef":
|
|
||||||
return symdef(value);
|
|
||||||
}
|
|
||||||
if (skip_key(key)) return;
|
|
||||||
if (value instanceof UglifyJS.AST_Token) return;
|
|
||||||
if (value instanceof UglifyJS.Dictionary) return;
|
|
||||||
if (value instanceof UglifyJS.AST_Node) {
|
|
||||||
var result = {
|
|
||||||
_class: "AST_" + value.TYPE
|
|
||||||
};
|
|
||||||
value.CTOR.PROPS.forEach(function(prop) {
|
|
||||||
result[prop] = value[prop];
|
|
||||||
});
|
|
||||||
return result;
|
|
||||||
}
|
|
||||||
return value;
|
|
||||||
}, 2));
|
|
||||||
} else if (output == "spidermonkey") {
|
|
||||||
print(JSON.stringify(result.ast.to_mozilla_ast(), null, 2));
|
|
||||||
} else if (output) {
|
|
||||||
var code;
|
|
||||||
if (result.ast) {
|
|
||||||
var opts = {};
|
|
||||||
for (var name in options.output) {
|
|
||||||
if (!/^ast|code$/.test(name)) opts[name] = options.output[name];
|
|
||||||
}
|
|
||||||
code = UglifyJS.AST_Node.from_mozilla_ast(result.ast.to_mozilla_ast()).print_to_string(opts);
|
|
||||||
} else {
|
|
||||||
code = result.code;
|
|
||||||
}
|
|
||||||
fs.writeFileSync(output, code);
|
|
||||||
if (result.map) fs.writeFileSync(output + ".map", result.map);
|
|
||||||
} else {
|
|
||||||
print(result.code);
|
|
||||||
}
|
|
||||||
if (nameCache) fs.writeFileSync(nameCache, JSON.stringify(options.nameCache));
|
|
||||||
if (result.timings) for (var phase in result.timings) {
|
|
||||||
print_error("- " + phase + ": " + result.timings[phase].toFixed(3) + "s");
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
function fatal(message) {
|
|
||||||
if (message instanceof Error) {
|
|
||||||
message = message.stack.replace(/^\S*?Error:/, "ERROR:")
|
|
||||||
} else {
|
|
||||||
message = "ERROR: " + message;
|
|
||||||
}
|
|
||||||
print_error(message);
|
|
||||||
process.exit(1);
|
|
||||||
}
|
|
||||||
|
|
||||||
// A file glob function that only supports "*" and "?" wildcards in the basename.
|
|
||||||
// Example: "foo/bar/*baz??.*.js"
|
|
||||||
// Argument `glob` may be a string or an array of strings.
|
|
||||||
// Returns an array of strings. Garbage in, garbage out.
|
|
||||||
function simple_glob(glob) {
|
|
||||||
if (Array.isArray(glob)) {
|
|
||||||
return [].concat.apply([], glob.map(simple_glob));
|
|
||||||
}
|
|
||||||
if (glob.match(/\*|\?/)) {
|
|
||||||
var dir = path.dirname(glob);
|
|
||||||
try {
|
|
||||||
var entries = fs.readdirSync(dir);
|
|
||||||
} catch (ex) {}
|
|
||||||
if (entries) {
|
|
||||||
var pattern = "^" + path.basename(glob)
|
|
||||||
.replace(/[.+^$[\]\\(){}]/g, "\\$&")
|
|
||||||
.replace(/\*/g, "[^/\\\\]*")
|
|
||||||
.replace(/\?/g, "[^/\\\\]") + "$";
|
|
||||||
var mod = process.platform === "win32" ? "i" : "";
|
|
||||||
var rx = new RegExp(pattern, mod);
|
|
||||||
var results = entries.sort().filter(function(name) {
|
|
||||||
return rx.test(name);
|
|
||||||
}).map(function(name) {
|
|
||||||
return path.join(dir, name);
|
|
||||||
});
|
|
||||||
if (results.length) return results;
|
|
||||||
}
|
|
||||||
}
|
|
||||||
return [ glob ];
|
|
||||||
}
|
|
||||||
|
|
||||||
function read_file(path, default_value) {
|
|
||||||
try {
|
|
||||||
return fs.readFileSync(path, "utf8");
|
|
||||||
} catch (ex) {
|
|
||||||
if (ex.code == "ENOENT" && default_value != null) return default_value;
|
|
||||||
fatal(ex);
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
function parse_js(value, options, flag) {
|
|
||||||
if (!options || typeof options != "object") options = {};
|
|
||||||
if (typeof value == "string") try {
|
|
||||||
UglifyJS.parse(value, {
|
|
||||||
expression: true
|
|
||||||
}).walk(new UglifyJS.TreeWalker(function(node) {
|
|
||||||
if (node instanceof UglifyJS.AST_Assign) {
|
|
||||||
var name = node.left.print_to_string();
|
|
||||||
var value = node.right;
|
|
||||||
if (flag) {
|
|
||||||
options[name] = value;
|
|
||||||
} else if (value instanceof UglifyJS.AST_Array) {
|
|
||||||
options[name] = value.elements.map(to_string);
|
|
||||||
} else {
|
|
||||||
options[name] = to_string(value);
|
|
||||||
}
|
|
||||||
return true;
|
|
||||||
}
|
|
||||||
if (node instanceof UglifyJS.AST_Symbol || node instanceof UglifyJS.AST_PropAccess) {
|
|
||||||
var name = node.print_to_string();
|
|
||||||
options[name] = true;
|
|
||||||
return true;
|
|
||||||
}
|
|
||||||
if (!(node instanceof UglifyJS.AST_Sequence)) throw node;
|
|
||||||
|
|
||||||
function to_string(value) {
|
|
||||||
return value instanceof UglifyJS.AST_Constant ? value.value : value.print_to_string({
|
|
||||||
quote_keys: true
|
|
||||||
});
|
|
||||||
}
|
|
||||||
}));
|
|
||||||
} catch (ex) {
|
|
||||||
if (flag) {
|
|
||||||
fatal("cannot parse arguments for '" + flag + "': " + value);
|
|
||||||
} else {
|
|
||||||
options[value] = null;
|
|
||||||
}
|
|
||||||
}
|
|
||||||
return options;
|
|
||||||
}
|
|
||||||
|
|
||||||
function skip_key(key) {
|
|
||||||
return skip_keys.indexOf(key) >= 0;
|
|
||||||
}
|
|
||||||
|
|
||||||
function symdef(def) {
|
|
||||||
var ret = (1e6 + def.id) + " " + def.name;
|
|
||||||
if (def.mangled_name) ret += " " + def.mangled_name;
|
|
||||||
return ret;
|
|
||||||
}
|
|
||||||
|
|
||||||
function format_object(obj) {
|
|
||||||
var lines = [];
|
|
||||||
var padding = "";
|
|
||||||
Object.keys(obj).map(function(name) {
|
|
||||||
if (padding.length < name.length) padding = Array(name.length + 1).join(" ");
|
|
||||||
return [ name, JSON.stringify(obj[name]) ];
|
|
||||||
}).forEach(function(tokens) {
|
|
||||||
lines.push(" " + tokens[0] + padding.slice(tokens[0].length - 2) + tokens[1]);
|
|
||||||
});
|
|
||||||
return lines.join("\n");
|
|
||||||
}
|
|
||||||
|
|
||||||
function print_error(msg) {
|
|
||||||
process.stderr.write(msg);
|
|
||||||
process.stderr.write("\n");
|
|
||||||
}
|
|
||||||
|
|
||||||
function print(txt) {
|
|
||||||
process.stdout.write(txt);
|
|
||||||
process.stdout.write("\n");
|
|
||||||
}
|
|
2064
lib/node_modules/uglify-js/lib/ast.js
generated
vendored
2064
lib/node_modules/uglify-js/lib/ast.js
generated
vendored
File diff suppressed because it is too large
Load Diff
12028
lib/node_modules/uglify-js/lib/compress.js
generated
vendored
12028
lib/node_modules/uglify-js/lib/compress.js
generated
vendored
File diff suppressed because it is too large
Load Diff
270
lib/node_modules/uglify-js/lib/minify.js
generated
vendored
270
lib/node_modules/uglify-js/lib/minify.js
generated
vendored
@ -1,270 +0,0 @@
|
|||||||
"use strict";
|
|
||||||
|
|
||||||
var to_ascii, to_base64;
|
|
||||||
if (typeof Buffer == "undefined") {
|
|
||||||
to_ascii = atob;
|
|
||||||
to_base64 = btoa;
|
|
||||||
} else if (typeof Buffer.alloc == "undefined") {
|
|
||||||
to_ascii = function(b64) {
|
|
||||||
return new Buffer(b64, "base64").toString();
|
|
||||||
};
|
|
||||||
to_base64 = function(str) {
|
|
||||||
return new Buffer(str).toString("base64");
|
|
||||||
};
|
|
||||||
} else {
|
|
||||||
to_ascii = function(b64) {
|
|
||||||
return Buffer.from(b64, "base64").toString();
|
|
||||||
};
|
|
||||||
to_base64 = function(str) {
|
|
||||||
return Buffer.from(str).toString("base64");
|
|
||||||
};
|
|
||||||
}
|
|
||||||
|
|
||||||
function read_source_map(name, toplevel) {
|
|
||||||
var comments = toplevel.end.comments_after;
|
|
||||||
for (var i = comments.length; --i >= 0;) {
|
|
||||||
var comment = comments[i];
|
|
||||||
if (comment.type != "comment1") break;
|
|
||||||
var match = /^# ([^\s=]+)=(\S+)\s*$/.exec(comment.value);
|
|
||||||
if (!match) break;
|
|
||||||
if (match[1] == "sourceMappingURL") {
|
|
||||||
match = /^data:application\/json(;.*?)?;base64,(\S+)$/.exec(match[2]);
|
|
||||||
if (!match) break;
|
|
||||||
return to_ascii(match[2]);
|
|
||||||
}
|
|
||||||
}
|
|
||||||
AST_Node.warn("inline source map not found: {name}", {
|
|
||||||
name: name,
|
|
||||||
});
|
|
||||||
}
|
|
||||||
|
|
||||||
function parse_source_map(content) {
|
|
||||||
try {
|
|
||||||
return JSON.parse(content);
|
|
||||||
} catch (ex) {
|
|
||||||
throw new Error("invalid input source map: " + content);
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
function set_shorthand(name, options, keys) {
|
|
||||||
keys.forEach(function(key) {
|
|
||||||
if (options[key]) {
|
|
||||||
if (typeof options[key] != "object") options[key] = {};
|
|
||||||
if (!(name in options[key])) options[key][name] = options[name];
|
|
||||||
}
|
|
||||||
});
|
|
||||||
}
|
|
||||||
|
|
||||||
function init_cache(cache) {
|
|
||||||
if (!cache) return;
|
|
||||||
if (!("props" in cache)) {
|
|
||||||
cache.props = new Dictionary();
|
|
||||||
} else if (!(cache.props instanceof Dictionary)) {
|
|
||||||
cache.props = Dictionary.fromObject(cache.props);
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
function to_json(cache) {
|
|
||||||
return {
|
|
||||||
props: cache.props.toObject()
|
|
||||||
};
|
|
||||||
}
|
|
||||||
|
|
||||||
function minify(files, options) {
|
|
||||||
try {
|
|
||||||
options = defaults(options, {
|
|
||||||
annotations: undefined,
|
|
||||||
compress: {},
|
|
||||||
enclose: false,
|
|
||||||
ie8: false,
|
|
||||||
keep_fnames: false,
|
|
||||||
mangle: {},
|
|
||||||
nameCache: null,
|
|
||||||
output: {},
|
|
||||||
parse: {},
|
|
||||||
rename: undefined,
|
|
||||||
sourceMap: false,
|
|
||||||
timings: false,
|
|
||||||
toplevel: false,
|
|
||||||
v8: false,
|
|
||||||
validate: false,
|
|
||||||
warnings: false,
|
|
||||||
webkit: false,
|
|
||||||
wrap: false,
|
|
||||||
}, true);
|
|
||||||
if (options.validate) AST_Node.enable_validation();
|
|
||||||
var timings = options.timings && { start: Date.now() };
|
|
||||||
if (options.rename === undefined) options.rename = options.compress && options.mangle;
|
|
||||||
if (options.annotations !== undefined) set_shorthand("annotations", options, [ "compress", "output" ]);
|
|
||||||
if (options.ie8) set_shorthand("ie8", options, [ "compress", "mangle", "output" ]);
|
|
||||||
if (options.keep_fnames) set_shorthand("keep_fnames", options, [ "compress", "mangle" ]);
|
|
||||||
if (options.toplevel) set_shorthand("toplevel", options, [ "compress", "mangle" ]);
|
|
||||||
if (options.v8) set_shorthand("v8", options, [ "mangle", "output" ]);
|
|
||||||
if (options.webkit) set_shorthand("webkit", options, [ "mangle", "output" ]);
|
|
||||||
var quoted_props;
|
|
||||||
if (options.mangle) {
|
|
||||||
options.mangle = defaults(options.mangle, {
|
|
||||||
cache: options.nameCache && (options.nameCache.vars || {}),
|
|
||||||
eval: false,
|
|
||||||
ie8: false,
|
|
||||||
keep_fnames: false,
|
|
||||||
properties: false,
|
|
||||||
reserved: [],
|
|
||||||
toplevel: false,
|
|
||||||
v8: false,
|
|
||||||
webkit: false,
|
|
||||||
}, true);
|
|
||||||
if (options.mangle.properties) {
|
|
||||||
if (typeof options.mangle.properties != "object") {
|
|
||||||
options.mangle.properties = {};
|
|
||||||
}
|
|
||||||
if (options.mangle.properties.keep_quoted) {
|
|
||||||
quoted_props = options.mangle.properties.reserved;
|
|
||||||
if (!Array.isArray(quoted_props)) quoted_props = [];
|
|
||||||
options.mangle.properties.reserved = quoted_props;
|
|
||||||
}
|
|
||||||
if (options.nameCache && !("cache" in options.mangle.properties)) {
|
|
||||||
options.mangle.properties.cache = options.nameCache.props || {};
|
|
||||||
}
|
|
||||||
}
|
|
||||||
init_cache(options.mangle.cache);
|
|
||||||
init_cache(options.mangle.properties.cache);
|
|
||||||
}
|
|
||||||
if (options.sourceMap) {
|
|
||||||
options.sourceMap = defaults(options.sourceMap, {
|
|
||||||
content: null,
|
|
||||||
filename: null,
|
|
||||||
includeSources: false,
|
|
||||||
names: true,
|
|
||||||
root: null,
|
|
||||||
url: null,
|
|
||||||
}, true);
|
|
||||||
}
|
|
||||||
var warnings = [];
|
|
||||||
if (options.warnings) AST_Node.log_function(function(warning) {
|
|
||||||
warnings.push(warning);
|
|
||||||
}, options.warnings == "verbose");
|
|
||||||
if (timings) timings.parse = Date.now();
|
|
||||||
var toplevel;
|
|
||||||
if (files instanceof AST_Toplevel) {
|
|
||||||
toplevel = files;
|
|
||||||
} else {
|
|
||||||
if (typeof files == "string") {
|
|
||||||
files = [ files ];
|
|
||||||
}
|
|
||||||
options.parse = options.parse || {};
|
|
||||||
options.parse.toplevel = null;
|
|
||||||
var source_map_content = options.sourceMap && options.sourceMap.content;
|
|
||||||
if (typeof source_map_content == "string" && source_map_content != "inline") {
|
|
||||||
source_map_content = parse_source_map(source_map_content);
|
|
||||||
}
|
|
||||||
if (source_map_content) options.sourceMap.orig = Object.create(null);
|
|
||||||
for (var name in files) if (HOP(files, name)) {
|
|
||||||
options.parse.filename = name;
|
|
||||||
options.parse.toplevel = toplevel = parse(files[name], options.parse);
|
|
||||||
if (source_map_content == "inline") {
|
|
||||||
var inlined_content = read_source_map(name, toplevel);
|
|
||||||
if (inlined_content) {
|
|
||||||
options.sourceMap.orig[name] = parse_source_map(inlined_content);
|
|
||||||
}
|
|
||||||
} else if (source_map_content) {
|
|
||||||
options.sourceMap.orig[name] = source_map_content;
|
|
||||||
}
|
|
||||||
}
|
|
||||||
}
|
|
||||||
if (quoted_props) {
|
|
||||||
reserve_quoted_keys(toplevel, quoted_props);
|
|
||||||
}
|
|
||||||
[ "enclose", "wrap" ].forEach(function(action) {
|
|
||||||
var option = options[action];
|
|
||||||
if (!option) return;
|
|
||||||
var orig = toplevel.print_to_string().slice(0, -1);
|
|
||||||
toplevel = toplevel[action](option);
|
|
||||||
files[toplevel.start.file] = toplevel.print_to_string().replace(orig, "");
|
|
||||||
});
|
|
||||||
if (options.validate) toplevel.validate_ast();
|
|
||||||
if (timings) timings.rename = Date.now();
|
|
||||||
if (options.rename) {
|
|
||||||
toplevel.figure_out_scope(options.mangle);
|
|
||||||
toplevel.expand_names(options.mangle);
|
|
||||||
}
|
|
||||||
if (timings) timings.compress = Date.now();
|
|
||||||
if (options.compress) {
|
|
||||||
toplevel = new Compressor(options.compress).compress(toplevel);
|
|
||||||
if (options.validate) toplevel.validate_ast();
|
|
||||||
}
|
|
||||||
if (timings) timings.scope = Date.now();
|
|
||||||
if (options.mangle) toplevel.figure_out_scope(options.mangle);
|
|
||||||
if (timings) timings.mangle = Date.now();
|
|
||||||
if (options.mangle) {
|
|
||||||
toplevel.compute_char_frequency(options.mangle);
|
|
||||||
toplevel.mangle_names(options.mangle);
|
|
||||||
}
|
|
||||||
if (timings) timings.properties = Date.now();
|
|
||||||
if (options.mangle && options.mangle.properties) mangle_properties(toplevel, options.mangle.properties);
|
|
||||||
if (timings) timings.output = Date.now();
|
|
||||||
var result = {};
|
|
||||||
var output = defaults(options.output, {
|
|
||||||
ast: false,
|
|
||||||
code: true,
|
|
||||||
});
|
|
||||||
if (output.ast) result.ast = toplevel;
|
|
||||||
if (output.code) {
|
|
||||||
if (options.sourceMap) {
|
|
||||||
output.source_map = SourceMap(options.sourceMap);
|
|
||||||
if (options.sourceMap.includeSources) {
|
|
||||||
if (files instanceof AST_Toplevel) {
|
|
||||||
throw new Error("original source content unavailable");
|
|
||||||
} else for (var name in files) if (HOP(files, name)) {
|
|
||||||
output.source_map.setSourceContent(name, files[name]);
|
|
||||||
}
|
|
||||||
}
|
|
||||||
}
|
|
||||||
delete output.ast;
|
|
||||||
delete output.code;
|
|
||||||
var stream = OutputStream(output);
|
|
||||||
toplevel.print(stream);
|
|
||||||
result.code = stream.get();
|
|
||||||
if (options.sourceMap) {
|
|
||||||
result.map = output.source_map.toString();
|
|
||||||
var url = options.sourceMap.url;
|
|
||||||
if (url) {
|
|
||||||
result.code = result.code.replace(/\n\/\/# sourceMappingURL=\S+\s*$/, "");
|
|
||||||
if (url == "inline") {
|
|
||||||
result.code += "\n//# sourceMappingURL=data:application/json;charset=utf-8;base64," + to_base64(result.map);
|
|
||||||
} else {
|
|
||||||
result.code += "\n//# sourceMappingURL=" + url;
|
|
||||||
}
|
|
||||||
}
|
|
||||||
}
|
|
||||||
}
|
|
||||||
if (options.nameCache && options.mangle) {
|
|
||||||
if (options.mangle.cache) options.nameCache.vars = to_json(options.mangle.cache);
|
|
||||||
if (options.mangle.properties && options.mangle.properties.cache) {
|
|
||||||
options.nameCache.props = to_json(options.mangle.properties.cache);
|
|
||||||
}
|
|
||||||
}
|
|
||||||
if (timings) {
|
|
||||||
timings.end = Date.now();
|
|
||||||
result.timings = {
|
|
||||||
parse: 1e-3 * (timings.rename - timings.parse),
|
|
||||||
rename: 1e-3 * (timings.compress - timings.rename),
|
|
||||||
compress: 1e-3 * (timings.scope - timings.compress),
|
|
||||||
scope: 1e-3 * (timings.mangle - timings.scope),
|
|
||||||
mangle: 1e-3 * (timings.properties - timings.mangle),
|
|
||||||
properties: 1e-3 * (timings.output - timings.properties),
|
|
||||||
output: 1e-3 * (timings.end - timings.output),
|
|
||||||
total: 1e-3 * (timings.end - timings.start)
|
|
||||||
};
|
|
||||||
}
|
|
||||||
if (warnings.length) {
|
|
||||||
result.warnings = warnings;
|
|
||||||
}
|
|
||||||
return result;
|
|
||||||
} catch (ex) {
|
|
||||||
return { error: ex };
|
|
||||||
} finally {
|
|
||||||
AST_Node.log_function();
|
|
||||||
AST_Node.disable_validation();
|
|
||||||
}
|
|
||||||
}
|
|
1272
lib/node_modules/uglify-js/lib/mozilla-ast.js
generated
vendored
1272
lib/node_modules/uglify-js/lib/mozilla-ast.js
generated
vendored
File diff suppressed because it is too large
Load Diff
1945
lib/node_modules/uglify-js/lib/output.js
generated
vendored
1945
lib/node_modules/uglify-js/lib/output.js
generated
vendored
File diff suppressed because it is too large
Load Diff
2548
lib/node_modules/uglify-js/lib/parse.js
generated
vendored
2548
lib/node_modules/uglify-js/lib/parse.js
generated
vendored
File diff suppressed because it is too large
Load Diff
259
lib/node_modules/uglify-js/lib/propmangle.js
generated
vendored
259
lib/node_modules/uglify-js/lib/propmangle.js
generated
vendored
@ -1,259 +0,0 @@
|
|||||||
/***********************************************************************
|
|
||||||
|
|
||||||
A JavaScript tokenizer / parser / beautifier / compressor.
|
|
||||||
https://github.com/mishoo/UglifyJS
|
|
||||||
|
|
||||||
-------------------------------- (C) ---------------------------------
|
|
||||||
|
|
||||||
Author: Mihai Bazon
|
|
||||||
<mihai.bazon@gmail.com>
|
|
||||||
http://mihai.bazon.net/blog
|
|
||||||
|
|
||||||
Distributed under the BSD license:
|
|
||||||
|
|
||||||
Copyright 2012 (c) Mihai Bazon <mihai.bazon@gmail.com>
|
|
||||||
|
|
||||||
Redistribution and use in source and binary forms, with or without
|
|
||||||
modification, are permitted provided that the following conditions
|
|
||||||
are met:
|
|
||||||
|
|
||||||
* Redistributions of source code must retain the above
|
|
||||||
copyright notice, this list of conditions and the following
|
|
||||||
disclaimer.
|
|
||||||
|
|
||||||
* Redistributions in binary form must reproduce the above
|
|
||||||
copyright notice, this list of conditions and the following
|
|
||||||
disclaimer in the documentation and/or other materials
|
|
||||||
provided with the distribution.
|
|
||||||
|
|
||||||
THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDER “AS IS” AND ANY
|
|
||||||
EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
|
|
||||||
IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
|
|
||||||
PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER BE
|
|
||||||
LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY,
|
|
||||||
OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
|
|
||||||
PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR
|
|
||||||
PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
|
|
||||||
THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR
|
|
||||||
TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF
|
|
||||||
THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
|
|
||||||
SUCH DAMAGE.
|
|
||||||
|
|
||||||
***********************************************************************/
|
|
||||||
|
|
||||||
"use strict";
|
|
||||||
|
|
||||||
var builtins = function() {
|
|
||||||
var names = [];
|
|
||||||
// NaN will be included due to Number.NaN
|
|
||||||
[
|
|
||||||
"null",
|
|
||||||
"true",
|
|
||||||
"false",
|
|
||||||
"Infinity",
|
|
||||||
"-Infinity",
|
|
||||||
"undefined",
|
|
||||||
].forEach(add);
|
|
||||||
[
|
|
||||||
Array,
|
|
||||||
Boolean,
|
|
||||||
Date,
|
|
||||||
Error,
|
|
||||||
Function,
|
|
||||||
Math,
|
|
||||||
Number,
|
|
||||||
Object,
|
|
||||||
RegExp,
|
|
||||||
String,
|
|
||||||
].forEach(function(ctor) {
|
|
||||||
Object.getOwnPropertyNames(ctor).map(add);
|
|
||||||
if (ctor.prototype) {
|
|
||||||
Object.getOwnPropertyNames(new ctor()).map(add);
|
|
||||||
Object.getOwnPropertyNames(ctor.prototype).map(add);
|
|
||||||
}
|
|
||||||
});
|
|
||||||
return makePredicate(names);
|
|
||||||
|
|
||||||
function add(name) {
|
|
||||||
names.push(name);
|
|
||||||
}
|
|
||||||
}();
|
|
||||||
|
|
||||||
function reserve_quoted_keys(ast, reserved) {
|
|
||||||
ast.walk(new TreeWalker(function(node) {
|
|
||||||
if (node instanceof AST_ClassProperty) {
|
|
||||||
if (node.start && node.start.quote) add(node.key);
|
|
||||||
} else if (node instanceof AST_ObjectProperty) {
|
|
||||||
if (node.start && node.start.quote) add(node.key);
|
|
||||||
} else if (node instanceof AST_Sub) {
|
|
||||||
addStrings(node.property, add);
|
|
||||||
}
|
|
||||||
}));
|
|
||||||
|
|
||||||
function add(name) {
|
|
||||||
push_uniq(reserved, name);
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
function addStrings(node, add) {
|
|
||||||
if (node instanceof AST_Conditional) {
|
|
||||||
addStrings(node.consequent, add);
|
|
||||||
addStrings(node.alternative, add);
|
|
||||||
} else if (node instanceof AST_Sequence) {
|
|
||||||
addStrings(node.tail_node(), add);
|
|
||||||
} else if (node instanceof AST_String) {
|
|
||||||
add(node.value);
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
function mangle_properties(ast, options) {
|
|
||||||
options = defaults(options, {
|
|
||||||
builtins: false,
|
|
||||||
cache: null,
|
|
||||||
debug: false,
|
|
||||||
keep_quoted: false,
|
|
||||||
regex: null,
|
|
||||||
reserved: null,
|
|
||||||
}, true);
|
|
||||||
|
|
||||||
var reserved = Object.create(options.builtins ? null : builtins);
|
|
||||||
if (Array.isArray(options.reserved)) options.reserved.forEach(function(name) {
|
|
||||||
reserved[name] = true;
|
|
||||||
});
|
|
||||||
|
|
||||||
var cname = -1;
|
|
||||||
var cache;
|
|
||||||
if (options.cache) {
|
|
||||||
cache = options.cache.props;
|
|
||||||
cache.each(function(name) {
|
|
||||||
reserved[name] = true;
|
|
||||||
});
|
|
||||||
} else {
|
|
||||||
cache = new Dictionary();
|
|
||||||
}
|
|
||||||
|
|
||||||
var regex = options.regex;
|
|
||||||
|
|
||||||
// note debug is either false (disabled), or a string of the debug suffix to use (enabled).
|
|
||||||
// note debug may be enabled as an empty string, which is falsey. Also treat passing 'true'
|
|
||||||
// the same as passing an empty string.
|
|
||||||
var debug = options.debug !== false;
|
|
||||||
var debug_suffix;
|
|
||||||
if (debug) debug_suffix = options.debug === true ? "" : options.debug;
|
|
||||||
|
|
||||||
var names_to_mangle = Object.create(null);
|
|
||||||
var unmangleable = Object.create(reserved);
|
|
||||||
|
|
||||||
// step 1: find candidates to mangle
|
|
||||||
ast.walk(new TreeWalker(function(node) {
|
|
||||||
if (node instanceof AST_Binary) {
|
|
||||||
if (node.operator == "in") addStrings(node.left, add);
|
|
||||||
} else if (node.TYPE == "Call") {
|
|
||||||
var exp = node.expression;
|
|
||||||
if (exp instanceof AST_Dot) switch (exp.property) {
|
|
||||||
case "defineProperty":
|
|
||||||
case "getOwnPropertyDescriptor":
|
|
||||||
if (node.args.length < 2) break;
|
|
||||||
exp = exp.expression;
|
|
||||||
if (!(exp instanceof AST_SymbolRef)) break;
|
|
||||||
if (exp.name != "Object") break;
|
|
||||||
if (!exp.definition().undeclared) break;
|
|
||||||
addStrings(node.args[1], add);
|
|
||||||
break;
|
|
||||||
case "hasOwnProperty":
|
|
||||||
if (node.args.length < 1) break;
|
|
||||||
addStrings(node.args[0], add);
|
|
||||||
break;
|
|
||||||
}
|
|
||||||
} else if (node instanceof AST_ClassProperty) {
|
|
||||||
if (typeof node.key == "string") add(node.key);
|
|
||||||
} else if (node instanceof AST_Dot) {
|
|
||||||
add(node.property);
|
|
||||||
} else if (node instanceof AST_ObjectProperty) {
|
|
||||||
if (typeof node.key == "string") add(node.key);
|
|
||||||
} else if (node instanceof AST_Sub) {
|
|
||||||
addStrings(node.property, add);
|
|
||||||
}
|
|
||||||
}));
|
|
||||||
|
|
||||||
// step 2: renaming properties
|
|
||||||
ast.walk(new TreeWalker(function(node) {
|
|
||||||
if (node instanceof AST_Binary) {
|
|
||||||
if (node.operator == "in") mangleStrings(node.left);
|
|
||||||
} else if (node.TYPE == "Call") {
|
|
||||||
var exp = node.expression;
|
|
||||||
if (exp instanceof AST_Dot) switch (exp.property) {
|
|
||||||
case "defineProperty":
|
|
||||||
case "getOwnPropertyDescriptor":
|
|
||||||
if (node.args.length < 2) break;
|
|
||||||
exp = exp.expression;
|
|
||||||
if (!(exp instanceof AST_SymbolRef)) break;
|
|
||||||
if (exp.name != "Object") break;
|
|
||||||
if (!exp.definition().undeclared) break;
|
|
||||||
mangleStrings(node.args[1]);
|
|
||||||
break;
|
|
||||||
case "hasOwnProperty":
|
|
||||||
if (node.args.length < 1) break;
|
|
||||||
mangleStrings(node.args[0]);
|
|
||||||
break;
|
|
||||||
}
|
|
||||||
} else if (node instanceof AST_ClassProperty) {
|
|
||||||
if (typeof node.key == "string") node.key = mangle(node.key);
|
|
||||||
} else if (node instanceof AST_Dot) {
|
|
||||||
node.property = mangle(node.property);
|
|
||||||
} else if (node instanceof AST_ObjectProperty) {
|
|
||||||
if (typeof node.key == "string") node.key = mangle(node.key);
|
|
||||||
} else if (node instanceof AST_Sub) {
|
|
||||||
if (!options.keep_quoted) mangleStrings(node.property);
|
|
||||||
}
|
|
||||||
}));
|
|
||||||
|
|
||||||
// only function declarations after this line
|
|
||||||
|
|
||||||
function can_mangle(name) {
|
|
||||||
if (unmangleable[name]) return false;
|
|
||||||
if (/^-?[0-9]+(\.[0-9]+)?(e[+-][0-9]+)?$/.test(name)) return false;
|
|
||||||
return true;
|
|
||||||
}
|
|
||||||
|
|
||||||
function should_mangle(name) {
|
|
||||||
if (reserved[name]) return false;
|
|
||||||
if (regex && !regex.test(name)) return false;
|
|
||||||
return cache.has(name) || names_to_mangle[name];
|
|
||||||
}
|
|
||||||
|
|
||||||
function add(name) {
|
|
||||||
if (can_mangle(name)) names_to_mangle[name] = true;
|
|
||||||
if (!should_mangle(name)) unmangleable[name] = true;
|
|
||||||
}
|
|
||||||
|
|
||||||
function mangle(name) {
|
|
||||||
if (!should_mangle(name)) return name;
|
|
||||||
var mangled = cache.get(name);
|
|
||||||
if (!mangled) {
|
|
||||||
if (debug) {
|
|
||||||
// debug mode: use a prefix and suffix to preserve readability, e.g. o.foo ---> o._$foo$NNN_.
|
|
||||||
var debug_mangled = "_$" + name + "$" + debug_suffix + "_";
|
|
||||||
if (can_mangle(debug_mangled)) mangled = debug_mangled;
|
|
||||||
}
|
|
||||||
// either debug mode is off, or it is on and we could not use the mangled name
|
|
||||||
if (!mangled) do {
|
|
||||||
mangled = base54(++cname);
|
|
||||||
} while (!can_mangle(mangled));
|
|
||||||
if (/^#/.test(name)) mangled = "#" + mangled;
|
|
||||||
cache.set(name, mangled);
|
|
||||||
}
|
|
||||||
return mangled;
|
|
||||||
}
|
|
||||||
|
|
||||||
function mangleStrings(node) {
|
|
||||||
if (node instanceof AST_Sequence) {
|
|
||||||
mangleStrings(node.expressions.tail_node());
|
|
||||||
} else if (node instanceof AST_String) {
|
|
||||||
node.value = mangle(node.value);
|
|
||||||
} else if (node instanceof AST_Conditional) {
|
|
||||||
mangleStrings(node.consequent);
|
|
||||||
mangleStrings(node.alternative);
|
|
||||||
}
|
|
||||||
}
|
|
||||||
}
|
|
829
lib/node_modules/uglify-js/lib/scope.js
generated
vendored
829
lib/node_modules/uglify-js/lib/scope.js
generated
vendored
@ -1,829 +0,0 @@
|
|||||||
/***********************************************************************
|
|
||||||
|
|
||||||
A JavaScript tokenizer / parser / beautifier / compressor.
|
|
||||||
https://github.com/mishoo/UglifyJS
|
|
||||||
|
|
||||||
-------------------------------- (C) ---------------------------------
|
|
||||||
|
|
||||||
Author: Mihai Bazon
|
|
||||||
<mihai.bazon@gmail.com>
|
|
||||||
http://mihai.bazon.net/blog
|
|
||||||
|
|
||||||
Distributed under the BSD license:
|
|
||||||
|
|
||||||
Copyright 2012 (c) Mihai Bazon <mihai.bazon@gmail.com>
|
|
||||||
|
|
||||||
Redistribution and use in source and binary forms, with or without
|
|
||||||
modification, are permitted provided that the following conditions
|
|
||||||
are met:
|
|
||||||
|
|
||||||
* Redistributions of source code must retain the above
|
|
||||||
copyright notice, this list of conditions and the following
|
|
||||||
disclaimer.
|
|
||||||
|
|
||||||
* Redistributions in binary form must reproduce the above
|
|
||||||
copyright notice, this list of conditions and the following
|
|
||||||
disclaimer in the documentation and/or other materials
|
|
||||||
provided with the distribution.
|
|
||||||
|
|
||||||
THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDER “AS IS” AND ANY
|
|
||||||
EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
|
|
||||||
IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
|
|
||||||
PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER BE
|
|
||||||
LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY,
|
|
||||||
OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
|
|
||||||
PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR
|
|
||||||
PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
|
|
||||||
THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR
|
|
||||||
TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF
|
|
||||||
THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
|
|
||||||
SUCH DAMAGE.
|
|
||||||
|
|
||||||
***********************************************************************/
|
|
||||||
|
|
||||||
"use strict";
|
|
||||||
|
|
||||||
function SymbolDef(id, scope, orig, init) {
|
|
||||||
this.eliminated = 0;
|
|
||||||
this.exported = false;
|
|
||||||
this.global = false;
|
|
||||||
this.id = id;
|
|
||||||
this.init = init;
|
|
||||||
this.mangled_name = null;
|
|
||||||
this.name = orig.name;
|
|
||||||
this.orig = [ orig ];
|
|
||||||
this.references = [];
|
|
||||||
this.replaced = 0;
|
|
||||||
this.scope = scope;
|
|
||||||
this.undeclared = false;
|
|
||||||
}
|
|
||||||
|
|
||||||
SymbolDef.prototype = {
|
|
||||||
forEach: function(fn) {
|
|
||||||
this.orig.forEach(fn);
|
|
||||||
this.references.forEach(fn);
|
|
||||||
},
|
|
||||||
mangle: function(options) {
|
|
||||||
var cache = options.cache && options.cache.props;
|
|
||||||
if (this.global && cache && cache.has(this.name)) {
|
|
||||||
this.mangled_name = cache.get(this.name);
|
|
||||||
} else if (!this.mangled_name && !this.unmangleable(options)) {
|
|
||||||
var def = this.redefined();
|
|
||||||
if (def) {
|
|
||||||
this.mangled_name = def.mangled_name || def.name;
|
|
||||||
} else {
|
|
||||||
this.mangled_name = next_mangled_name(this, options);
|
|
||||||
}
|
|
||||||
if (this.global && cache) {
|
|
||||||
cache.set(this.name, this.mangled_name);
|
|
||||||
}
|
|
||||||
}
|
|
||||||
},
|
|
||||||
redefined: function() {
|
|
||||||
var self = this;
|
|
||||||
var scope = self.defun;
|
|
||||||
if (!scope) return;
|
|
||||||
var name = self.name;
|
|
||||||
var def = scope.variables.get(name)
|
|
||||||
|| scope instanceof AST_Toplevel && scope.globals.get(name)
|
|
||||||
|| self.orig[0] instanceof AST_SymbolConst && find_if(function(def) {
|
|
||||||
return def.name == name;
|
|
||||||
}, scope.enclosed);
|
|
||||||
if (def && def !== self) return def.redefined() || def;
|
|
||||||
},
|
|
||||||
unmangleable: function(options) {
|
|
||||||
return this.global && !options.toplevel
|
|
||||||
|| this.exported
|
|
||||||
|| this.undeclared
|
|
||||||
|| !options.eval && this.scope.pinned()
|
|
||||||
|| options.keep_fnames
|
|
||||||
&& (this.orig[0] instanceof AST_SymbolClass
|
|
||||||
|| this.orig[0] instanceof AST_SymbolDefClass
|
|
||||||
|| this.orig[0] instanceof AST_SymbolDefun
|
|
||||||
|| this.orig[0] instanceof AST_SymbolLambda);
|
|
||||||
},
|
|
||||||
};
|
|
||||||
|
|
||||||
var unary_side_effects = makePredicate("delete ++ --");
|
|
||||||
|
|
||||||
function is_lhs(node, parent) {
|
|
||||||
if (parent instanceof AST_Assign) return parent.left === node && node;
|
|
||||||
if (parent instanceof AST_DefaultValue) return parent.name === node && node;
|
|
||||||
if (parent instanceof AST_Destructured) return node;
|
|
||||||
if (parent instanceof AST_DestructuredKeyVal) return node;
|
|
||||||
if (parent instanceof AST_ForEnumeration) return parent.init === node && node;
|
|
||||||
if (parent instanceof AST_Unary) return unary_side_effects[parent.operator] && parent.expression;
|
|
||||||
}
|
|
||||||
|
|
||||||
AST_Toplevel.DEFMETHOD("figure_out_scope", function(options) {
|
|
||||||
options = defaults(options, {
|
|
||||||
cache: null,
|
|
||||||
ie8: false,
|
|
||||||
});
|
|
||||||
|
|
||||||
// pass 1: setup scope chaining and handle definitions
|
|
||||||
var self = this;
|
|
||||||
var defun = null;
|
|
||||||
var exported = false;
|
|
||||||
var next_def_id = 0;
|
|
||||||
var scope = self.parent_scope = null;
|
|
||||||
var tw = new TreeWalker(function(node, descend) {
|
|
||||||
if (node instanceof AST_DefClass) {
|
|
||||||
var save_exported = exported;
|
|
||||||
exported = tw.parent() instanceof AST_ExportDeclaration;
|
|
||||||
node.name.walk(tw);
|
|
||||||
exported = save_exported;
|
|
||||||
walk_scope(function() {
|
|
||||||
if (node.extends) node.extends.walk(tw);
|
|
||||||
node.properties.forEach(function(prop) {
|
|
||||||
prop.walk(tw);
|
|
||||||
});
|
|
||||||
});
|
|
||||||
return true;
|
|
||||||
}
|
|
||||||
if (node instanceof AST_Definitions) {
|
|
||||||
var save_exported = exported;
|
|
||||||
exported = tw.parent() instanceof AST_ExportDeclaration;
|
|
||||||
descend();
|
|
||||||
exported = save_exported;
|
|
||||||
return true;
|
|
||||||
}
|
|
||||||
if (node instanceof AST_LambdaDefinition) {
|
|
||||||
var save_exported = exported;
|
|
||||||
exported = tw.parent() instanceof AST_ExportDeclaration;
|
|
||||||
node.name.walk(tw);
|
|
||||||
exported = save_exported;
|
|
||||||
walk_scope(function() {
|
|
||||||
node.argnames.forEach(function(argname) {
|
|
||||||
argname.walk(tw);
|
|
||||||
});
|
|
||||||
if (node.rest) node.rest.walk(tw);
|
|
||||||
walk_body(node, tw);
|
|
||||||
});
|
|
||||||
return true;
|
|
||||||
}
|
|
||||||
if (node instanceof AST_SwitchBranch) {
|
|
||||||
node.init_vars(scope);
|
|
||||||
descend();
|
|
||||||
return true;
|
|
||||||
}
|
|
||||||
if (node instanceof AST_Try) {
|
|
||||||
walk_scope(function() {
|
|
||||||
walk_body(node, tw);
|
|
||||||
});
|
|
||||||
if (node.bcatch) node.bcatch.walk(tw);
|
|
||||||
if (node.bfinally) node.bfinally.walk(tw);
|
|
||||||
return true;
|
|
||||||
}
|
|
||||||
if (node instanceof AST_With) {
|
|
||||||
var s = scope;
|
|
||||||
do {
|
|
||||||
s = s.resolve();
|
|
||||||
if (s.uses_with) break;
|
|
||||||
s.uses_with = true;
|
|
||||||
} while (s = s.parent_scope);
|
|
||||||
walk_scope(descend);
|
|
||||||
return true;
|
|
||||||
}
|
|
||||||
if (node instanceof AST_BlockScope) {
|
|
||||||
walk_scope(descend);
|
|
||||||
return true;
|
|
||||||
}
|
|
||||||
if (node instanceof AST_Symbol) {
|
|
||||||
node.scope = scope;
|
|
||||||
}
|
|
||||||
if (node instanceof AST_Label) {
|
|
||||||
node.thedef = node;
|
|
||||||
node.references = [];
|
|
||||||
}
|
|
||||||
if (node instanceof AST_SymbolCatch) {
|
|
||||||
scope.def_variable(node).defun = defun;
|
|
||||||
} else if (node instanceof AST_SymbolConst) {
|
|
||||||
var def = scope.def_variable(node);
|
|
||||||
def.defun = defun;
|
|
||||||
if (exported) def.exported = true;
|
|
||||||
} else if (node instanceof AST_SymbolDefun) {
|
|
||||||
var def = defun.def_function(node, tw.parent());
|
|
||||||
if (exported) def.exported = true;
|
|
||||||
entangle(defun, scope);
|
|
||||||
} else if (node instanceof AST_SymbolFunarg) {
|
|
||||||
defun.def_variable(node);
|
|
||||||
entangle(defun, scope);
|
|
||||||
} else if (node instanceof AST_SymbolLambda) {
|
|
||||||
var def = defun.def_function(node, node.name == "arguments" ? undefined : defun);
|
|
||||||
if (options.ie8) def.defun = defun.parent_scope.resolve();
|
|
||||||
} else if (node instanceof AST_SymbolLet) {
|
|
||||||
var def = scope.def_variable(node);
|
|
||||||
if (exported) def.exported = true;
|
|
||||||
} else if (node instanceof AST_SymbolVar) {
|
|
||||||
var def = defun.def_variable(node, node instanceof AST_SymbolImport ? undefined : null);
|
|
||||||
if (exported) def.exported = true;
|
|
||||||
entangle(defun, scope);
|
|
||||||
}
|
|
||||||
|
|
||||||
function walk_scope(descend) {
|
|
||||||
node.init_vars(scope);
|
|
||||||
var save_defun = defun;
|
|
||||||
var save_scope = scope;
|
|
||||||
if (node instanceof AST_Scope) defun = node;
|
|
||||||
scope = node;
|
|
||||||
descend();
|
|
||||||
scope = save_scope;
|
|
||||||
defun = save_defun;
|
|
||||||
}
|
|
||||||
|
|
||||||
function entangle(defun, scope) {
|
|
||||||
if (defun === scope) return;
|
|
||||||
node.mark_enclosed(options);
|
|
||||||
var def = scope.find_variable(node.name);
|
|
||||||
if (node.thedef === def) return;
|
|
||||||
node.thedef = def;
|
|
||||||
def.orig.push(node);
|
|
||||||
node.mark_enclosed(options);
|
|
||||||
}
|
|
||||||
});
|
|
||||||
self.make_def = function(orig, init) {
|
|
||||||
return new SymbolDef(++next_def_id, this, orig, init);
|
|
||||||
};
|
|
||||||
self.walk(tw);
|
|
||||||
|
|
||||||
// pass 2: find back references and eval
|
|
||||||
self.globals = new Dictionary();
|
|
||||||
var in_arg = [];
|
|
||||||
var tw = new TreeWalker(function(node) {
|
|
||||||
if (node instanceof AST_Catch) {
|
|
||||||
if (!(node.argname instanceof AST_Destructured)) return;
|
|
||||||
in_arg.push(node);
|
|
||||||
node.argname.walk(tw);
|
|
||||||
in_arg.pop();
|
|
||||||
walk_body(node, tw);
|
|
||||||
return true;
|
|
||||||
}
|
|
||||||
if (node instanceof AST_Lambda) {
|
|
||||||
in_arg.push(node);
|
|
||||||
node.argnames.forEach(function(argname) {
|
|
||||||
argname.walk(tw);
|
|
||||||
});
|
|
||||||
if (node.rest) node.rest.walk(tw);
|
|
||||||
in_arg.pop();
|
|
||||||
walk_lambda(node, tw);
|
|
||||||
return true;
|
|
||||||
}
|
|
||||||
if (node instanceof AST_LoopControl) {
|
|
||||||
if (node.label) node.label.thedef.references.push(node);
|
|
||||||
return true;
|
|
||||||
}
|
|
||||||
if (node instanceof AST_SymbolDeclaration) {
|
|
||||||
var def = node.definition();
|
|
||||||
def.preinit = def.references.length;
|
|
||||||
if (node instanceof AST_SymbolCatch) {
|
|
||||||
// ensure mangling works if `catch` reuses a scope variable
|
|
||||||
var redef = def.redefined();
|
|
||||||
if (redef) for (var s = node.scope; s; s = s.parent_scope) {
|
|
||||||
push_uniq(s.enclosed, redef);
|
|
||||||
if (s === redef.scope) break;
|
|
||||||
}
|
|
||||||
} else if (node instanceof AST_SymbolConst) {
|
|
||||||
// ensure compression works if `const` reuses a scope variable
|
|
||||||
var redef = def.redefined();
|
|
||||||
if (redef) redef.const_redefs = true;
|
|
||||||
}
|
|
||||||
if (node.name != "arguments") return true;
|
|
||||||
var parent = node instanceof AST_SymbolVar && tw.parent();
|
|
||||||
if (parent instanceof AST_VarDef && !parent.value) return true;
|
|
||||||
var sym = node.scope.resolve().find_variable("arguments");
|
|
||||||
if (sym && is_arguments(sym)) sym.scope.uses_arguments = 3;
|
|
||||||
return true;
|
|
||||||
}
|
|
||||||
if (node instanceof AST_SymbolRef) {
|
|
||||||
var name = node.name;
|
|
||||||
var sym = node.scope.find_variable(name);
|
|
||||||
for (var i = in_arg.length; i > 0 && sym;) {
|
|
||||||
i = in_arg.lastIndexOf(sym.scope, i - 1);
|
|
||||||
if (i < 0) break;
|
|
||||||
var decl = sym.orig[0];
|
|
||||||
if (decl instanceof AST_SymbolCatch
|
|
||||||
|| decl instanceof AST_SymbolFunarg
|
|
||||||
|| decl instanceof AST_SymbolLambda) {
|
|
||||||
node.in_arg = true;
|
|
||||||
break;
|
|
||||||
}
|
|
||||||
sym = sym.scope.parent_scope.find_variable(name);
|
|
||||||
}
|
|
||||||
if (!sym) {
|
|
||||||
sym = self.def_global(node);
|
|
||||||
} else if (name == "arguments" && is_arguments(sym)) {
|
|
||||||
var parent = tw.parent();
|
|
||||||
if (is_lhs(node, parent)) {
|
|
||||||
sym.scope.uses_arguments = 3;
|
|
||||||
} else if (sym.scope.uses_arguments < 2
|
|
||||||
&& !(parent instanceof AST_PropAccess && parent.expression === node)) {
|
|
||||||
sym.scope.uses_arguments = 2;
|
|
||||||
} else if (!sym.scope.uses_arguments) {
|
|
||||||
sym.scope.uses_arguments = true;
|
|
||||||
}
|
|
||||||
}
|
|
||||||
if (name == "eval") {
|
|
||||||
var parent = tw.parent();
|
|
||||||
if (parent.TYPE == "Call" && parent.expression === node) {
|
|
||||||
var s = node.scope;
|
|
||||||
do {
|
|
||||||
s = s.resolve();
|
|
||||||
if (s.uses_eval) break;
|
|
||||||
s.uses_eval = true;
|
|
||||||
} while (s = s.parent_scope);
|
|
||||||
} else if (sym.undeclared) {
|
|
||||||
self.uses_eval = true;
|
|
||||||
}
|
|
||||||
}
|
|
||||||
if (sym.init instanceof AST_LambdaDefinition && sym.scope !== sym.init.name.scope) {
|
|
||||||
var scope = node.scope;
|
|
||||||
do {
|
|
||||||
if (scope === sym.init.name.scope) break;
|
|
||||||
} while (scope = scope.parent_scope);
|
|
||||||
if (!scope) sym.init = undefined;
|
|
||||||
}
|
|
||||||
node.thedef = sym;
|
|
||||||
node.reference(options);
|
|
||||||
return true;
|
|
||||||
}
|
|
||||||
});
|
|
||||||
self.walk(tw);
|
|
||||||
|
|
||||||
// pass 3: fix up any scoping issue with IE8
|
|
||||||
if (options.ie8) self.walk(new TreeWalker(function(node) {
|
|
||||||
if (node instanceof AST_SymbolCatch) {
|
|
||||||
var scope = node.thedef.defun;
|
|
||||||
if (scope.name instanceof AST_SymbolLambda && scope.name.name == node.name) {
|
|
||||||
scope = scope.parent_scope.resolve();
|
|
||||||
}
|
|
||||||
redefine(node, scope);
|
|
||||||
return true;
|
|
||||||
}
|
|
||||||
if (node instanceof AST_SymbolLambda) {
|
|
||||||
var def = node.thedef;
|
|
||||||
if (!redefine(node, node.scope.parent_scope.resolve())) {
|
|
||||||
delete def.defun;
|
|
||||||
} else if (typeof node.thedef.init !== "undefined") {
|
|
||||||
node.thedef.init = false;
|
|
||||||
} else if (def.init) {
|
|
||||||
node.thedef.init = def.init;
|
|
||||||
}
|
|
||||||
return true;
|
|
||||||
}
|
|
||||||
}));
|
|
||||||
|
|
||||||
function is_arguments(sym) {
|
|
||||||
return sym.orig[0] instanceof AST_SymbolFunarg
|
|
||||||
&& !(sym.orig[1] instanceof AST_SymbolFunarg || sym.orig[2] instanceof AST_SymbolFunarg)
|
|
||||||
&& !is_arrow(sym.scope);
|
|
||||||
}
|
|
||||||
|
|
||||||
function redefine(node, scope) {
|
|
||||||
var name = node.name;
|
|
||||||
var old_def = node.thedef;
|
|
||||||
if (!all(old_def.orig, function(sym) {
|
|
||||||
return !(sym instanceof AST_SymbolConst || sym instanceof AST_SymbolLet);
|
|
||||||
})) return false;
|
|
||||||
var new_def = scope.find_variable(name);
|
|
||||||
if (new_def) {
|
|
||||||
var redef = new_def.redefined();
|
|
||||||
if (redef) new_def = redef;
|
|
||||||
} else {
|
|
||||||
new_def = self.globals.get(name);
|
|
||||||
}
|
|
||||||
if (new_def) {
|
|
||||||
new_def.orig.push(node);
|
|
||||||
} else {
|
|
||||||
new_def = scope.def_variable(node);
|
|
||||||
}
|
|
||||||
if (new_def.undeclared) self.variables.set(name, new_def);
|
|
||||||
if (name == "arguments" && is_arguments(old_def) && node instanceof AST_SymbolLambda) return true;
|
|
||||||
old_def.defun = new_def.scope;
|
|
||||||
old_def.forEach(function(node) {
|
|
||||||
node.redef = old_def;
|
|
||||||
node.thedef = new_def;
|
|
||||||
node.reference(options);
|
|
||||||
});
|
|
||||||
return true;
|
|
||||||
}
|
|
||||||
});
|
|
||||||
|
|
||||||
AST_Toplevel.DEFMETHOD("def_global", function(node) {
|
|
||||||
var globals = this.globals, name = node.name;
|
|
||||||
if (globals.has(name)) {
|
|
||||||
return globals.get(name);
|
|
||||||
} else {
|
|
||||||
var g = this.make_def(node);
|
|
||||||
g.undeclared = true;
|
|
||||||
g.global = true;
|
|
||||||
globals.set(name, g);
|
|
||||||
return g;
|
|
||||||
}
|
|
||||||
});
|
|
||||||
|
|
||||||
function init_block_vars(scope, parent) {
|
|
||||||
scope.enclosed = []; // variables from this or outer scope(s) that are referenced from this or inner scopes
|
|
||||||
scope.parent_scope = parent; // the parent scope (null if this is the top level)
|
|
||||||
scope.functions = new Dictionary(); // map name to AST_SymbolDefun (functions defined in this scope)
|
|
||||||
scope.variables = new Dictionary(); // map name to AST_SymbolVar (variables defined in this scope; includes functions)
|
|
||||||
if (parent) scope.make_def = parent.make_def; // top-level tracking of SymbolDef instances
|
|
||||||
}
|
|
||||||
|
|
||||||
function init_scope_vars(scope, parent) {
|
|
||||||
init_block_vars(scope, parent);
|
|
||||||
scope.uses_eval = false; // will be set to true if this or nested scope uses the global `eval`
|
|
||||||
scope.uses_with = false; // will be set to true if this or some nested scope uses the `with` statement
|
|
||||||
}
|
|
||||||
|
|
||||||
AST_BlockScope.DEFMETHOD("init_vars", function(parent_scope) {
|
|
||||||
init_block_vars(this, parent_scope);
|
|
||||||
});
|
|
||||||
AST_Scope.DEFMETHOD("init_vars", function(parent_scope) {
|
|
||||||
init_scope_vars(this, parent_scope);
|
|
||||||
});
|
|
||||||
AST_Arrow.DEFMETHOD("init_vars", function(parent_scope) {
|
|
||||||
init_scope_vars(this, parent_scope);
|
|
||||||
return this;
|
|
||||||
});
|
|
||||||
AST_AsyncArrow.DEFMETHOD("init_vars", function(parent_scope) {
|
|
||||||
init_scope_vars(this, parent_scope);
|
|
||||||
});
|
|
||||||
AST_Lambda.DEFMETHOD("init_vars", function(parent_scope) {
|
|
||||||
init_scope_vars(this, parent_scope);
|
|
||||||
this.uses_arguments = false;
|
|
||||||
this.def_variable(new AST_SymbolFunarg({
|
|
||||||
name: "arguments",
|
|
||||||
start: this.start,
|
|
||||||
end: this.end,
|
|
||||||
}));
|
|
||||||
return this;
|
|
||||||
});
|
|
||||||
|
|
||||||
AST_Symbol.DEFMETHOD("mark_enclosed", function(options) {
|
|
||||||
var def = this.definition();
|
|
||||||
for (var s = this.scope; s; s = s.parent_scope) {
|
|
||||||
push_uniq(s.enclosed, def);
|
|
||||||
if (!options) {
|
|
||||||
delete s._var_names;
|
|
||||||
} else if (options.keep_fnames) {
|
|
||||||
s.functions.each(function(d) {
|
|
||||||
push_uniq(def.scope.enclosed, d);
|
|
||||||
});
|
|
||||||
}
|
|
||||||
if (s === def.scope) break;
|
|
||||||
}
|
|
||||||
});
|
|
||||||
|
|
||||||
AST_Symbol.DEFMETHOD("reference", function(options) {
|
|
||||||
this.definition().references.push(this);
|
|
||||||
this.mark_enclosed(options);
|
|
||||||
});
|
|
||||||
|
|
||||||
AST_BlockScope.DEFMETHOD("find_variable", function(name) {
|
|
||||||
return this.variables.get(name)
|
|
||||||
|| this.parent_scope && this.parent_scope.find_variable(name);
|
|
||||||
});
|
|
||||||
|
|
||||||
AST_BlockScope.DEFMETHOD("def_function", function(symbol, init) {
|
|
||||||
var def = this.def_variable(symbol, init);
|
|
||||||
if (!def.init || def.init instanceof AST_LambdaDefinition) def.init = init;
|
|
||||||
this.functions.set(symbol.name, def);
|
|
||||||
return def;
|
|
||||||
});
|
|
||||||
|
|
||||||
AST_BlockScope.DEFMETHOD("def_variable", function(symbol, init) {
|
|
||||||
var def = this.variables.get(symbol.name);
|
|
||||||
if (def) {
|
|
||||||
def.orig.push(symbol);
|
|
||||||
if (def.init instanceof AST_LambdaExpression) def.init = init;
|
|
||||||
} else {
|
|
||||||
def = this.make_def(symbol, init);
|
|
||||||
this.variables.set(symbol.name, def);
|
|
||||||
def.global = !this.parent_scope;
|
|
||||||
}
|
|
||||||
return symbol.thedef = def;
|
|
||||||
});
|
|
||||||
|
|
||||||
function names_in_use(scope, options) {
|
|
||||||
var names = scope.names_in_use;
|
|
||||||
if (!names) {
|
|
||||||
scope.cname = -1;
|
|
||||||
scope.cname_holes = [];
|
|
||||||
scope.names_in_use = names = Object.create(null);
|
|
||||||
var cache = options.cache && options.cache.props;
|
|
||||||
scope.enclosed.forEach(function(def) {
|
|
||||||
if (def.unmangleable(options)) names[def.name] = true;
|
|
||||||
if (def.global && cache && cache.has(def.name)) {
|
|
||||||
names[cache.get(def.name)] = true;
|
|
||||||
}
|
|
||||||
});
|
|
||||||
}
|
|
||||||
return names;
|
|
||||||
}
|
|
||||||
|
|
||||||
function next_mangled_name(def, options) {
|
|
||||||
var scope = def.scope;
|
|
||||||
var in_use = names_in_use(scope, options);
|
|
||||||
var holes = scope.cname_holes;
|
|
||||||
var names = Object.create(null);
|
|
||||||
var scopes = [ scope ];
|
|
||||||
def.forEach(function(sym) {
|
|
||||||
var scope = sym.scope;
|
|
||||||
do {
|
|
||||||
if (scopes.indexOf(scope) < 0) {
|
|
||||||
for (var name in names_in_use(scope, options)) {
|
|
||||||
names[name] = true;
|
|
||||||
}
|
|
||||||
scopes.push(scope);
|
|
||||||
} else break;
|
|
||||||
} while (scope = scope.parent_scope);
|
|
||||||
});
|
|
||||||
var name;
|
|
||||||
for (var i = 0; i < holes.length; i++) {
|
|
||||||
name = base54(holes[i]);
|
|
||||||
if (names[name]) continue;
|
|
||||||
holes.splice(i, 1);
|
|
||||||
in_use[name] = true;
|
|
||||||
return name;
|
|
||||||
}
|
|
||||||
while (true) {
|
|
||||||
name = base54(++scope.cname);
|
|
||||||
if (in_use[name] || RESERVED_WORDS[name] || options.reserved.has[name]) continue;
|
|
||||||
if (!names[name]) break;
|
|
||||||
holes.push(scope.cname);
|
|
||||||
}
|
|
||||||
in_use[name] = true;
|
|
||||||
return name;
|
|
||||||
}
|
|
||||||
|
|
||||||
AST_Symbol.DEFMETHOD("unmangleable", function(options) {
|
|
||||||
var def = this.definition();
|
|
||||||
return !def || def.unmangleable(options);
|
|
||||||
});
|
|
||||||
|
|
||||||
// labels are always mangleable
|
|
||||||
AST_Label.DEFMETHOD("unmangleable", return_false);
|
|
||||||
|
|
||||||
AST_Symbol.DEFMETHOD("definition", function() {
|
|
||||||
return this.thedef;
|
|
||||||
});
|
|
||||||
|
|
||||||
function _default_mangler_options(options) {
|
|
||||||
options = defaults(options, {
|
|
||||||
eval : false,
|
|
||||||
ie8 : false,
|
|
||||||
keep_fnames : false,
|
|
||||||
reserved : [],
|
|
||||||
toplevel : false,
|
|
||||||
v8 : false,
|
|
||||||
webkit : false,
|
|
||||||
});
|
|
||||||
if (!Array.isArray(options.reserved)) options.reserved = [];
|
|
||||||
// Never mangle arguments
|
|
||||||
push_uniq(options.reserved, "arguments");
|
|
||||||
options.reserved.has = makePredicate(options.reserved);
|
|
||||||
return options;
|
|
||||||
}
|
|
||||||
|
|
||||||
AST_Toplevel.DEFMETHOD("mangle_names", function(options) {
|
|
||||||
options = _default_mangler_options(options);
|
|
||||||
|
|
||||||
// We only need to mangle declaration nodes. Special logic wired
|
|
||||||
// into the code generator will display the mangled name if it's
|
|
||||||
// present (and for AST_SymbolRef-s it'll use the mangled name of
|
|
||||||
// the AST_SymbolDeclaration that it points to).
|
|
||||||
var lname = -1;
|
|
||||||
|
|
||||||
if (options.cache && options.cache.props) {
|
|
||||||
var mangled_names = names_in_use(this, options);
|
|
||||||
options.cache.props.each(function(mangled_name) {
|
|
||||||
mangled_names[mangled_name] = true;
|
|
||||||
});
|
|
||||||
}
|
|
||||||
|
|
||||||
var redefined = [];
|
|
||||||
var tw = new TreeWalker(function(node, descend) {
|
|
||||||
if (node instanceof AST_LabeledStatement) {
|
|
||||||
// lname is incremented when we get to the AST_Label
|
|
||||||
var save_nesting = lname;
|
|
||||||
descend();
|
|
||||||
if (!options.v8 || !in_label(tw)) lname = save_nesting;
|
|
||||||
return true;
|
|
||||||
}
|
|
||||||
if (node instanceof AST_BlockScope) {
|
|
||||||
if (options.webkit && node instanceof AST_IterationStatement && node.init instanceof AST_Let) {
|
|
||||||
node.init.definitions.forEach(function(defn) {
|
|
||||||
defn.name.match_symbol(function(sym) {
|
|
||||||
if (!(sym instanceof AST_SymbolLet)) return;
|
|
||||||
var def = sym.definition();
|
|
||||||
var scope = sym.scope.parent_scope;
|
|
||||||
var redef = scope.def_variable(sym);
|
|
||||||
sym.thedef = def;
|
|
||||||
scope.to_mangle.push(redef);
|
|
||||||
def.redefined = function() {
|
|
||||||
return redef;
|
|
||||||
};
|
|
||||||
});
|
|
||||||
}, true);
|
|
||||||
}
|
|
||||||
node.to_mangle = [];
|
|
||||||
node.variables.each(function(def) {
|
|
||||||
if (!defer_redef(def)) node.to_mangle.push(def);
|
|
||||||
});
|
|
||||||
descend();
|
|
||||||
if (options.cache && node instanceof AST_Toplevel) {
|
|
||||||
node.globals.each(mangle);
|
|
||||||
}
|
|
||||||
if (node instanceof AST_Defun && tw.has_directive("use asm")) {
|
|
||||||
var sym = new AST_SymbolRef(node.name);
|
|
||||||
sym.scope = node;
|
|
||||||
sym.reference(options);
|
|
||||||
}
|
|
||||||
node.to_mangle.forEach(mangle);
|
|
||||||
return true;
|
|
||||||
}
|
|
||||||
if (node instanceof AST_Label) {
|
|
||||||
var name;
|
|
||||||
do {
|
|
||||||
name = base54(++lname);
|
|
||||||
} while (RESERVED_WORDS[name]);
|
|
||||||
node.mangled_name = name;
|
|
||||||
return true;
|
|
||||||
}
|
|
||||||
});
|
|
||||||
this.walk(tw);
|
|
||||||
redefined.forEach(mangle);
|
|
||||||
|
|
||||||
function mangle(def) {
|
|
||||||
if (options.reserved.has[def.name]) return;
|
|
||||||
def.mangle(options);
|
|
||||||
}
|
|
||||||
|
|
||||||
function defer_redef(def) {
|
|
||||||
var sym = def.orig[0];
|
|
||||||
var redef = def.redefined();
|
|
||||||
if (!redef) {
|
|
||||||
if (!(sym instanceof AST_SymbolConst)) return false;
|
|
||||||
var scope = def.scope.resolve();
|
|
||||||
if (def.scope === scope) return false;
|
|
||||||
if (def.scope.parent_scope.find_variable(sym.name)) return false;
|
|
||||||
redef = scope.def_variable(sym);
|
|
||||||
scope.to_mangle.push(redef);
|
|
||||||
}
|
|
||||||
redefined.push(def);
|
|
||||||
def.references.forEach(reference);
|
|
||||||
if (sym instanceof AST_SymbolCatch || sym instanceof AST_SymbolConst) reference(sym);
|
|
||||||
return true;
|
|
||||||
|
|
||||||
function reference(sym) {
|
|
||||||
sym.thedef = redef;
|
|
||||||
sym.reference(options);
|
|
||||||
sym.thedef = def;
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
function in_label(tw) {
|
|
||||||
var level = 0, parent;
|
|
||||||
while (parent = tw.parent(level++)) {
|
|
||||||
if (parent instanceof AST_Block) return parent instanceof AST_Toplevel && !options.toplevel;
|
|
||||||
if (parent instanceof AST_LabeledStatement) return true;
|
|
||||||
}
|
|
||||||
}
|
|
||||||
});
|
|
||||||
|
|
||||||
AST_Toplevel.DEFMETHOD("find_colliding_names", function(options) {
|
|
||||||
var cache = options.cache && options.cache.props;
|
|
||||||
var avoid = Object.create(RESERVED_WORDS);
|
|
||||||
options.reserved.forEach(to_avoid);
|
|
||||||
this.globals.each(add_def);
|
|
||||||
this.walk(new TreeWalker(function(node) {
|
|
||||||
if (node instanceof AST_BlockScope) node.variables.each(add_def);
|
|
||||||
}));
|
|
||||||
return avoid;
|
|
||||||
|
|
||||||
function to_avoid(name) {
|
|
||||||
avoid[name] = true;
|
|
||||||
}
|
|
||||||
|
|
||||||
function add_def(def) {
|
|
||||||
var name = def.name;
|
|
||||||
if (def.global && cache && cache.has(name)) name = cache.get(name);
|
|
||||||
else if (!def.unmangleable(options)) return;
|
|
||||||
to_avoid(name);
|
|
||||||
}
|
|
||||||
});
|
|
||||||
|
|
||||||
AST_Toplevel.DEFMETHOD("expand_names", function(options) {
|
|
||||||
base54.reset();
|
|
||||||
base54.sort();
|
|
||||||
options = _default_mangler_options(options);
|
|
||||||
var avoid = this.find_colliding_names(options);
|
|
||||||
var cname = 0;
|
|
||||||
this.globals.each(rename);
|
|
||||||
this.walk(new TreeWalker(function(node) {
|
|
||||||
if (node instanceof AST_BlockScope) node.variables.each(rename);
|
|
||||||
}));
|
|
||||||
|
|
||||||
function next_name() {
|
|
||||||
var name;
|
|
||||||
do {
|
|
||||||
name = base54(cname++);
|
|
||||||
} while (avoid[name]);
|
|
||||||
return name;
|
|
||||||
}
|
|
||||||
|
|
||||||
function rename(def) {
|
|
||||||
if (def.global && options.cache) return;
|
|
||||||
if (def.unmangleable(options)) return;
|
|
||||||
if (options.reserved.has[def.name]) return;
|
|
||||||
var redef = def.redefined();
|
|
||||||
var name = redef ? redef.rename || redef.name : next_name();
|
|
||||||
def.rename = name;
|
|
||||||
def.forEach(function(sym) {
|
|
||||||
if (sym.definition() === def) sym.name = name;
|
|
||||||
});
|
|
||||||
}
|
|
||||||
});
|
|
||||||
|
|
||||||
AST_Node.DEFMETHOD("tail_node", return_this);
|
|
||||||
AST_Sequence.DEFMETHOD("tail_node", function() {
|
|
||||||
return this.expressions[this.expressions.length - 1];
|
|
||||||
});
|
|
||||||
|
|
||||||
AST_Toplevel.DEFMETHOD("compute_char_frequency", function(options) {
|
|
||||||
options = _default_mangler_options(options);
|
|
||||||
base54.reset();
|
|
||||||
var fn = AST_Symbol.prototype.add_source_map;
|
|
||||||
try {
|
|
||||||
AST_Symbol.prototype.add_source_map = function() {
|
|
||||||
if (!this.unmangleable(options)) base54.consider(this.name, -1);
|
|
||||||
};
|
|
||||||
if (options.properties) {
|
|
||||||
AST_Dot.prototype.add_source_map = function() {
|
|
||||||
base54.consider(this.property, -1);
|
|
||||||
};
|
|
||||||
AST_Sub.prototype.add_source_map = function() {
|
|
||||||
skip_string(this.property);
|
|
||||||
};
|
|
||||||
}
|
|
||||||
base54.consider(this.print_to_string(), 1);
|
|
||||||
} finally {
|
|
||||||
AST_Symbol.prototype.add_source_map = fn;
|
|
||||||
delete AST_Dot.prototype.add_source_map;
|
|
||||||
delete AST_Sub.prototype.add_source_map;
|
|
||||||
}
|
|
||||||
base54.sort();
|
|
||||||
|
|
||||||
function skip_string(node) {
|
|
||||||
if (node instanceof AST_String) {
|
|
||||||
base54.consider(node.value, -1);
|
|
||||||
} else if (node instanceof AST_Conditional) {
|
|
||||||
skip_string(node.consequent);
|
|
||||||
skip_string(node.alternative);
|
|
||||||
} else if (node instanceof AST_Sequence) {
|
|
||||||
skip_string(node.tail_node());
|
|
||||||
}
|
|
||||||
}
|
|
||||||
});
|
|
||||||
|
|
||||||
var base54 = (function() {
|
|
||||||
var freq = Object.create(null);
|
|
||||||
function init(chars) {
|
|
||||||
var array = [];
|
|
||||||
for (var i = 0; i < chars.length; i++) {
|
|
||||||
var ch = chars[i];
|
|
||||||
array.push(ch);
|
|
||||||
freq[ch] = -1e-2 * i;
|
|
||||||
}
|
|
||||||
return array;
|
|
||||||
}
|
|
||||||
var digits = init("0123456789");
|
|
||||||
var leading = init("abcdefghijklmnopqrstuvwxyzABCDEFGHIJKLMNOPQRSTUVWXYZ$_");
|
|
||||||
var chars, frequency;
|
|
||||||
function reset() {
|
|
||||||
chars = null;
|
|
||||||
frequency = Object.create(freq);
|
|
||||||
}
|
|
||||||
base54.consider = function(str, delta) {
|
|
||||||
for (var i = str.length; --i >= 0;) {
|
|
||||||
frequency[str[i]] += delta;
|
|
||||||
}
|
|
||||||
};
|
|
||||||
function compare(a, b) {
|
|
||||||
return frequency[b] - frequency[a];
|
|
||||||
}
|
|
||||||
base54.sort = function() {
|
|
||||||
chars = leading.sort(compare).concat(digits).sort(compare);
|
|
||||||
};
|
|
||||||
base54.reset = reset;
|
|
||||||
reset();
|
|
||||||
function base54(num) {
|
|
||||||
var ret = leading[num % 54];
|
|
||||||
for (num = Math.floor(num / 54); --num >= 0; num >>= 6) {
|
|
||||||
ret += chars[num & 0x3F];
|
|
||||||
}
|
|
||||||
return ret;
|
|
||||||
}
|
|
||||||
return base54;
|
|
||||||
})();
|
|
193
lib/node_modules/uglify-js/lib/sourcemap.js
generated
vendored
193
lib/node_modules/uglify-js/lib/sourcemap.js
generated
vendored
@ -1,193 +0,0 @@
|
|||||||
/***********************************************************************
|
|
||||||
|
|
||||||
A JavaScript tokenizer / parser / beautifier / compressor.
|
|
||||||
https://github.com/mishoo/UglifyJS
|
|
||||||
|
|
||||||
-------------------------------- (C) ---------------------------------
|
|
||||||
|
|
||||||
Author: Mihai Bazon
|
|
||||||
<mihai.bazon@gmail.com>
|
|
||||||
http://mihai.bazon.net/blog
|
|
||||||
|
|
||||||
Distributed under the BSD license:
|
|
||||||
|
|
||||||
Copyright 2012 (c) Mihai Bazon <mihai.bazon@gmail.com>
|
|
||||||
|
|
||||||
Redistribution and use in source and binary forms, with or without
|
|
||||||
modification, are permitted provided that the following conditions
|
|
||||||
are met:
|
|
||||||
|
|
||||||
* Redistributions of source code must retain the above
|
|
||||||
copyright notice, this list of conditions and the following
|
|
||||||
disclaimer.
|
|
||||||
|
|
||||||
* Redistributions in binary form must reproduce the above
|
|
||||||
copyright notice, this list of conditions and the following
|
|
||||||
disclaimer in the documentation and/or other materials
|
|
||||||
provided with the distribution.
|
|
||||||
|
|
||||||
THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDER “AS IS” AND ANY
|
|
||||||
EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
|
|
||||||
IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
|
|
||||||
PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER BE
|
|
||||||
LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY,
|
|
||||||
OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
|
|
||||||
PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR
|
|
||||||
PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
|
|
||||||
THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR
|
|
||||||
TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF
|
|
||||||
THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
|
|
||||||
SUCH DAMAGE.
|
|
||||||
|
|
||||||
***********************************************************************/
|
|
||||||
|
|
||||||
"use strict";
|
|
||||||
|
|
||||||
var vlq_char = characters("ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/");
|
|
||||||
var vlq_bits = vlq_char.reduce(function(map, ch, bits) {
|
|
||||||
map[ch] = bits;
|
|
||||||
return map;
|
|
||||||
}, Object.create(null));
|
|
||||||
|
|
||||||
function vlq_decode(indices, str) {
|
|
||||||
var value = 0;
|
|
||||||
var shift = 0;
|
|
||||||
for (var i = 0, j = 0; i < str.length; i++) {
|
|
||||||
var bits = vlq_bits[str[i]];
|
|
||||||
value += (bits & 31) << shift;
|
|
||||||
if (bits & 32) {
|
|
||||||
shift += 5;
|
|
||||||
} else {
|
|
||||||
indices[j++] += value & 1 ? 0x80000000 | -(value >> 1) : value >> 1;
|
|
||||||
value = shift = 0;
|
|
||||||
}
|
|
||||||
}
|
|
||||||
return j;
|
|
||||||
}
|
|
||||||
|
|
||||||
function vlq_encode(num) {
|
|
||||||
var result = "";
|
|
||||||
num = Math.abs(num) << 1 | num >>> 31;
|
|
||||||
do {
|
|
||||||
var bits = num & 31;
|
|
||||||
if (num >>>= 5) bits |= 32;
|
|
||||||
result += vlq_char[bits];
|
|
||||||
} while (num);
|
|
||||||
return result;
|
|
||||||
}
|
|
||||||
|
|
||||||
function create_array_map() {
|
|
||||||
var map = Object.create(null);
|
|
||||||
var array = [];
|
|
||||||
array.index = function(name) {
|
|
||||||
if (!HOP(map, name)) {
|
|
||||||
map[name] = array.length;
|
|
||||||
array.push(name);
|
|
||||||
}
|
|
||||||
return map[name];
|
|
||||||
};
|
|
||||||
return array;
|
|
||||||
}
|
|
||||||
|
|
||||||
function SourceMap(options) {
|
|
||||||
var sources = create_array_map();
|
|
||||||
var sources_content = options.includeSources && Object.create(null);
|
|
||||||
var names = create_array_map();
|
|
||||||
var mappings = "";
|
|
||||||
if (options.orig) Object.keys(options.orig).forEach(function(name) {
|
|
||||||
var map = options.orig[name];
|
|
||||||
var indices = [ 0, 0, 1, 0, 0 ];
|
|
||||||
options.orig[name] = {
|
|
||||||
names: map.names,
|
|
||||||
mappings: map.mappings.split(/;/).map(function(line) {
|
|
||||||
indices[0] = 0;
|
|
||||||
return line.split(/,/).map(function(segment) {
|
|
||||||
return indices.slice(0, vlq_decode(indices, segment));
|
|
||||||
});
|
|
||||||
}),
|
|
||||||
sources: map.sources,
|
|
||||||
};
|
|
||||||
if (!sources_content || !map.sourcesContent) return;
|
|
||||||
for (var i = 0; i < map.sources.length; i++) {
|
|
||||||
var content = map.sourcesContent[i];
|
|
||||||
if (content) sources_content[map.sources[i]] = content;
|
|
||||||
}
|
|
||||||
});
|
|
||||||
var prev_source;
|
|
||||||
var generated_line = 1;
|
|
||||||
var generated_column = 0;
|
|
||||||
var source_index = 0;
|
|
||||||
var original_line = 1;
|
|
||||||
var original_column = 0;
|
|
||||||
var name_index = 0;
|
|
||||||
return {
|
|
||||||
add: options.orig ? function(source, gen_line, gen_col, orig_line, orig_col, name) {
|
|
||||||
var map = options.orig[source];
|
|
||||||
if (map) {
|
|
||||||
var segments = map.mappings[orig_line - 1];
|
|
||||||
if (!segments) return;
|
|
||||||
var indices;
|
|
||||||
for (var i = 0; i < segments.length; i++) {
|
|
||||||
var col = segments[i][0];
|
|
||||||
if (orig_col >= col) indices = segments[i];
|
|
||||||
if (orig_col <= col) break;
|
|
||||||
}
|
|
||||||
if (!indices || indices.length < 4) {
|
|
||||||
source = null;
|
|
||||||
} else {
|
|
||||||
source = map.sources[indices[1]];
|
|
||||||
orig_line = indices[2];
|
|
||||||
orig_col = indices[3];
|
|
||||||
if (indices.length > 4) name = map.names[indices[4]];
|
|
||||||
}
|
|
||||||
}
|
|
||||||
add(source, gen_line, gen_col, orig_line, orig_col, name);
|
|
||||||
} : add,
|
|
||||||
setSourceContent: sources_content ? function(source, content) {
|
|
||||||
if (!(source in sources_content)) {
|
|
||||||
sources_content[source] = content;
|
|
||||||
}
|
|
||||||
} : noop,
|
|
||||||
toString: function() {
|
|
||||||
return JSON.stringify({
|
|
||||||
version: 3,
|
|
||||||
file: options.filename || undefined,
|
|
||||||
sourceRoot: options.root || undefined,
|
|
||||||
sources: sources,
|
|
||||||
sourcesContent: sources_content ? sources.map(function(source) {
|
|
||||||
return sources_content[source] || null;
|
|
||||||
}) : undefined,
|
|
||||||
names: names,
|
|
||||||
mappings: mappings,
|
|
||||||
});
|
|
||||||
}
|
|
||||||
};
|
|
||||||
|
|
||||||
function add(source, gen_line, gen_col, orig_line, orig_col, name) {
|
|
||||||
if (prev_source == null && source == null) return;
|
|
||||||
prev_source = source;
|
|
||||||
if (generated_line < gen_line) {
|
|
||||||
generated_column = 0;
|
|
||||||
do {
|
|
||||||
mappings += ";";
|
|
||||||
} while (++generated_line < gen_line);
|
|
||||||
} else if (mappings) {
|
|
||||||
mappings += ",";
|
|
||||||
}
|
|
||||||
mappings += vlq_encode(gen_col - generated_column);
|
|
||||||
generated_column = gen_col;
|
|
||||||
if (source == null) return;
|
|
||||||
var src_idx = sources.index(source);
|
|
||||||
mappings += vlq_encode(src_idx - source_index);
|
|
||||||
source_index = src_idx;
|
|
||||||
mappings += vlq_encode(orig_line - original_line);
|
|
||||||
original_line = orig_line;
|
|
||||||
mappings += vlq_encode(orig_col - original_column);
|
|
||||||
original_column = orig_col;
|
|
||||||
if (options.names && name != null) {
|
|
||||||
var name_idx = names.index(name);
|
|
||||||
mappings += vlq_encode(name_idx - name_index);
|
|
||||||
name_index = name_idx;
|
|
||||||
}
|
|
||||||
}
|
|
||||||
}
|
|
250
lib/node_modules/uglify-js/lib/transform.js
generated
vendored
250
lib/node_modules/uglify-js/lib/transform.js
generated
vendored
@ -1,250 +0,0 @@
|
|||||||
/***********************************************************************
|
|
||||||
|
|
||||||
A JavaScript tokenizer / parser / beautifier / compressor.
|
|
||||||
https://github.com/mishoo/UglifyJS
|
|
||||||
|
|
||||||
-------------------------------- (C) ---------------------------------
|
|
||||||
|
|
||||||
Author: Mihai Bazon
|
|
||||||
<mihai.bazon@gmail.com>
|
|
||||||
http://mihai.bazon.net/blog
|
|
||||||
|
|
||||||
Distributed under the BSD license:
|
|
||||||
|
|
||||||
Copyright 2012 (c) Mihai Bazon <mihai.bazon@gmail.com>
|
|
||||||
|
|
||||||
Redistribution and use in source and binary forms, with or without
|
|
||||||
modification, are permitted provided that the following conditions
|
|
||||||
are met:
|
|
||||||
|
|
||||||
* Redistributions of source code must retain the above
|
|
||||||
copyright notice, this list of conditions and the following
|
|
||||||
disclaimer.
|
|
||||||
|
|
||||||
* Redistributions in binary form must reproduce the above
|
|
||||||
copyright notice, this list of conditions and the following
|
|
||||||
disclaimer in the documentation and/or other materials
|
|
||||||
provided with the distribution.
|
|
||||||
|
|
||||||
THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDER “AS IS” AND ANY
|
|
||||||
EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
|
|
||||||
IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
|
|
||||||
PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER BE
|
|
||||||
LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY,
|
|
||||||
OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
|
|
||||||
PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR
|
|
||||||
PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
|
|
||||||
THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR
|
|
||||||
TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF
|
|
||||||
THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
|
|
||||||
SUCH DAMAGE.
|
|
||||||
|
|
||||||
***********************************************************************/
|
|
||||||
|
|
||||||
"use strict";
|
|
||||||
|
|
||||||
function TreeTransformer(before, after) {
|
|
||||||
TreeWalker.call(this);
|
|
||||||
this.before = before;
|
|
||||||
this.after = after;
|
|
||||||
}
|
|
||||||
TreeTransformer.prototype = new TreeWalker;
|
|
||||||
|
|
||||||
(function(DEF) {
|
|
||||||
function do_list(list, tw) {
|
|
||||||
return List(list, function(node) {
|
|
||||||
return node.transform(tw, true);
|
|
||||||
});
|
|
||||||
}
|
|
||||||
|
|
||||||
DEF(AST_Node, noop);
|
|
||||||
DEF(AST_LabeledStatement, function(self, tw) {
|
|
||||||
self.label = self.label.transform(tw);
|
|
||||||
self.body = self.body.transform(tw);
|
|
||||||
});
|
|
||||||
DEF(AST_SimpleStatement, function(self, tw) {
|
|
||||||
self.body = self.body.transform(tw);
|
|
||||||
});
|
|
||||||
DEF(AST_Block, function(self, tw) {
|
|
||||||
self.body = do_list(self.body, tw);
|
|
||||||
});
|
|
||||||
DEF(AST_Do, function(self, tw) {
|
|
||||||
self.body = self.body.transform(tw);
|
|
||||||
self.condition = self.condition.transform(tw);
|
|
||||||
});
|
|
||||||
DEF(AST_While, function(self, tw) {
|
|
||||||
self.condition = self.condition.transform(tw);
|
|
||||||
self.body = self.body.transform(tw);
|
|
||||||
});
|
|
||||||
DEF(AST_For, function(self, tw) {
|
|
||||||
if (self.init) self.init = self.init.transform(tw);
|
|
||||||
if (self.condition) self.condition = self.condition.transform(tw);
|
|
||||||
if (self.step) self.step = self.step.transform(tw);
|
|
||||||
self.body = self.body.transform(tw);
|
|
||||||
});
|
|
||||||
DEF(AST_ForEnumeration, function(self, tw) {
|
|
||||||
self.init = self.init.transform(tw);
|
|
||||||
self.object = self.object.transform(tw);
|
|
||||||
self.body = self.body.transform(tw);
|
|
||||||
});
|
|
||||||
DEF(AST_With, function(self, tw) {
|
|
||||||
self.expression = self.expression.transform(tw);
|
|
||||||
self.body = self.body.transform(tw);
|
|
||||||
});
|
|
||||||
DEF(AST_Exit, function(self, tw) {
|
|
||||||
if (self.value) self.value = self.value.transform(tw);
|
|
||||||
});
|
|
||||||
DEF(AST_LoopControl, function(self, tw) {
|
|
||||||
if (self.label) self.label = self.label.transform(tw);
|
|
||||||
});
|
|
||||||
DEF(AST_If, function(self, tw) {
|
|
||||||
self.condition = self.condition.transform(tw);
|
|
||||||
self.body = self.body.transform(tw);
|
|
||||||
if (self.alternative) self.alternative = self.alternative.transform(tw);
|
|
||||||
});
|
|
||||||
DEF(AST_Switch, function(self, tw) {
|
|
||||||
self.expression = self.expression.transform(tw);
|
|
||||||
self.body = do_list(self.body, tw);
|
|
||||||
});
|
|
||||||
DEF(AST_Case, function(self, tw) {
|
|
||||||
self.expression = self.expression.transform(tw);
|
|
||||||
self.body = do_list(self.body, tw);
|
|
||||||
});
|
|
||||||
DEF(AST_Try, function(self, tw) {
|
|
||||||
self.body = do_list(self.body, tw);
|
|
||||||
if (self.bcatch) self.bcatch = self.bcatch.transform(tw);
|
|
||||||
if (self.bfinally) self.bfinally = self.bfinally.transform(tw);
|
|
||||||
});
|
|
||||||
DEF(AST_Catch, function(self, tw) {
|
|
||||||
if (self.argname) self.argname = self.argname.transform(tw);
|
|
||||||
self.body = do_list(self.body, tw);
|
|
||||||
});
|
|
||||||
DEF(AST_Definitions, function(self, tw) {
|
|
||||||
self.definitions = do_list(self.definitions, tw);
|
|
||||||
});
|
|
||||||
DEF(AST_VarDef, function(self, tw) {
|
|
||||||
self.name = self.name.transform(tw);
|
|
||||||
if (self.value) self.value = self.value.transform(tw);
|
|
||||||
});
|
|
||||||
DEF(AST_DefaultValue, function(self, tw) {
|
|
||||||
self.name = self.name.transform(tw);
|
|
||||||
self.value = self.value.transform(tw);
|
|
||||||
});
|
|
||||||
DEF(AST_Lambda, function(self, tw) {
|
|
||||||
if (self.name) self.name = self.name.transform(tw);
|
|
||||||
self.argnames = do_list(self.argnames, tw);
|
|
||||||
if (self.rest) self.rest = self.rest.transform(tw);
|
|
||||||
self.body = do_list(self.body, tw);
|
|
||||||
});
|
|
||||||
function transform_arrow(self, tw) {
|
|
||||||
self.argnames = do_list(self.argnames, tw);
|
|
||||||
if (self.rest) self.rest = self.rest.transform(tw);
|
|
||||||
if (self.value) {
|
|
||||||
self.value = self.value.transform(tw);
|
|
||||||
} else {
|
|
||||||
self.body = do_list(self.body, tw);
|
|
||||||
}
|
|
||||||
}
|
|
||||||
DEF(AST_Arrow, transform_arrow);
|
|
||||||
DEF(AST_AsyncArrow, transform_arrow);
|
|
||||||
DEF(AST_Class, function(self, tw) {
|
|
||||||
if (self.name) self.name = self.name.transform(tw);
|
|
||||||
if (self.extends) self.extends = self.extends.transform(tw);
|
|
||||||
self.properties = do_list(self.properties, tw);
|
|
||||||
});
|
|
||||||
DEF(AST_ClassProperty, function(self, tw) {
|
|
||||||
if (self.key instanceof AST_Node) self.key = self.key.transform(tw);
|
|
||||||
if (self.value) self.value = self.value.transform(tw);
|
|
||||||
});
|
|
||||||
DEF(AST_Call, function(self, tw) {
|
|
||||||
self.expression = self.expression.transform(tw);
|
|
||||||
self.args = do_list(self.args, tw);
|
|
||||||
});
|
|
||||||
DEF(AST_Sequence, function(self, tw) {
|
|
||||||
self.expressions = do_list(self.expressions, tw);
|
|
||||||
});
|
|
||||||
DEF(AST_Await, function(self, tw) {
|
|
||||||
self.expression = self.expression.transform(tw);
|
|
||||||
});
|
|
||||||
DEF(AST_Yield, function(self, tw) {
|
|
||||||
if (self.expression) self.expression = self.expression.transform(tw);
|
|
||||||
});
|
|
||||||
DEF(AST_Dot, function(self, tw) {
|
|
||||||
self.expression = self.expression.transform(tw);
|
|
||||||
});
|
|
||||||
DEF(AST_Sub, function(self, tw) {
|
|
||||||
self.expression = self.expression.transform(tw);
|
|
||||||
self.property = self.property.transform(tw);
|
|
||||||
});
|
|
||||||
DEF(AST_Spread, function(self, tw) {
|
|
||||||
self.expression = self.expression.transform(tw);
|
|
||||||
});
|
|
||||||
DEF(AST_Unary, function(self, tw) {
|
|
||||||
self.expression = self.expression.transform(tw);
|
|
||||||
});
|
|
||||||
DEF(AST_Binary, function(self, tw) {
|
|
||||||
self.left = self.left.transform(tw);
|
|
||||||
self.right = self.right.transform(tw);
|
|
||||||
});
|
|
||||||
DEF(AST_Conditional, function(self, tw) {
|
|
||||||
self.condition = self.condition.transform(tw);
|
|
||||||
self.consequent = self.consequent.transform(tw);
|
|
||||||
self.alternative = self.alternative.transform(tw);
|
|
||||||
});
|
|
||||||
DEF(AST_Array, function(self, tw) {
|
|
||||||
self.elements = do_list(self.elements, tw);
|
|
||||||
});
|
|
||||||
DEF(AST_DestructuredArray, function(self, tw) {
|
|
||||||
self.elements = do_list(self.elements, tw);
|
|
||||||
if (self.rest) self.rest = self.rest.transform(tw);
|
|
||||||
});
|
|
||||||
DEF(AST_DestructuredKeyVal, function(self, tw) {
|
|
||||||
if (self.key instanceof AST_Node) self.key = self.key.transform(tw);
|
|
||||||
self.value = self.value.transform(tw);
|
|
||||||
});
|
|
||||||
DEF(AST_DestructuredObject, function(self, tw) {
|
|
||||||
self.properties = do_list(self.properties, tw);
|
|
||||||
if (self.rest) self.rest = self.rest.transform(tw);
|
|
||||||
});
|
|
||||||
DEF(AST_Object, function(self, tw) {
|
|
||||||
self.properties = do_list(self.properties, tw);
|
|
||||||
});
|
|
||||||
DEF(AST_ObjectProperty, function(self, tw) {
|
|
||||||
if (self.key instanceof AST_Node) self.key = self.key.transform(tw);
|
|
||||||
self.value = self.value.transform(tw);
|
|
||||||
});
|
|
||||||
DEF(AST_ExportDeclaration, function(self, tw) {
|
|
||||||
self.body = self.body.transform(tw);
|
|
||||||
});
|
|
||||||
DEF(AST_ExportDefault, function(self, tw) {
|
|
||||||
self.body = self.body.transform(tw);
|
|
||||||
});
|
|
||||||
DEF(AST_ExportReferences, function(self, tw) {
|
|
||||||
self.properties = do_list(self.properties, tw);
|
|
||||||
});
|
|
||||||
DEF(AST_Import, function(self, tw) {
|
|
||||||
if (self.all) self.all = self.all.transform(tw);
|
|
||||||
if (self.default) self.default = self.default.transform(tw);
|
|
||||||
if (self.properties) self.properties = do_list(self.properties, tw);
|
|
||||||
});
|
|
||||||
DEF(AST_Template, function(self, tw) {
|
|
||||||
if (self.tag) self.tag = self.tag.transform(tw);
|
|
||||||
self.expressions = do_list(self.expressions, tw);
|
|
||||||
});
|
|
||||||
})(function(node, descend) {
|
|
||||||
node.DEFMETHOD("transform", function(tw, in_list) {
|
|
||||||
var x, y;
|
|
||||||
tw.push(this);
|
|
||||||
if (tw.before) x = tw.before(this, descend, in_list);
|
|
||||||
if (typeof x === "undefined") {
|
|
||||||
x = this;
|
|
||||||
descend(x, tw);
|
|
||||||
if (tw.after) {
|
|
||||||
y = tw.after(x, in_list);
|
|
||||||
if (typeof y !== "undefined") x = y;
|
|
||||||
}
|
|
||||||
}
|
|
||||||
tw.pop();
|
|
||||||
return x;
|
|
||||||
});
|
|
||||||
});
|
|
267
lib/node_modules/uglify-js/lib/utils.js
generated
vendored
267
lib/node_modules/uglify-js/lib/utils.js
generated
vendored
@ -1,267 +0,0 @@
|
|||||||
/***********************************************************************
|
|
||||||
|
|
||||||
A JavaScript tokenizer / parser / beautifier / compressor.
|
|
||||||
https://github.com/mishoo/UglifyJS
|
|
||||||
|
|
||||||
-------------------------------- (C) ---------------------------------
|
|
||||||
|
|
||||||
Author: Mihai Bazon
|
|
||||||
<mihai.bazon@gmail.com>
|
|
||||||
http://mihai.bazon.net/blog
|
|
||||||
|
|
||||||
Distributed under the BSD license:
|
|
||||||
|
|
||||||
Copyright 2012 (c) Mihai Bazon <mihai.bazon@gmail.com>
|
|
||||||
|
|
||||||
Redistribution and use in source and binary forms, with or without
|
|
||||||
modification, are permitted provided that the following conditions
|
|
||||||
are met:
|
|
||||||
|
|
||||||
* Redistributions of source code must retain the above
|
|
||||||
copyright notice, this list of conditions and the following
|
|
||||||
disclaimer.
|
|
||||||
|
|
||||||
* Redistributions in binary form must reproduce the above
|
|
||||||
copyright notice, this list of conditions and the following
|
|
||||||
disclaimer in the documentation and/or other materials
|
|
||||||
provided with the distribution.
|
|
||||||
|
|
||||||
THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDER “AS IS” AND ANY
|
|
||||||
EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
|
|
||||||
IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
|
|
||||||
PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER BE
|
|
||||||
LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY,
|
|
||||||
OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
|
|
||||||
PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR
|
|
||||||
PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
|
|
||||||
THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR
|
|
||||||
TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF
|
|
||||||
THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
|
|
||||||
SUCH DAMAGE.
|
|
||||||
|
|
||||||
***********************************************************************/
|
|
||||||
|
|
||||||
"use strict";
|
|
||||||
|
|
||||||
function characters(str) {
|
|
||||||
return str.split("");
|
|
||||||
}
|
|
||||||
|
|
||||||
function member(name, array) {
|
|
||||||
return array.indexOf(name) >= 0;
|
|
||||||
}
|
|
||||||
|
|
||||||
function find_if(func, array) {
|
|
||||||
for (var i = array.length; --i >= 0;) if (func(array[i])) return array[i];
|
|
||||||
}
|
|
||||||
|
|
||||||
function repeat_string(str, i) {
|
|
||||||
if (i <= 0) return "";
|
|
||||||
if (i == 1) return str;
|
|
||||||
var d = repeat_string(str, i >> 1);
|
|
||||||
d += d;
|
|
||||||
return i & 1 ? d + str : d;
|
|
||||||
}
|
|
||||||
|
|
||||||
function configure_error_stack(fn) {
|
|
||||||
Object.defineProperty(fn.prototype, "stack", {
|
|
||||||
get: function() {
|
|
||||||
var err = new Error(this.message);
|
|
||||||
err.name = this.name;
|
|
||||||
try {
|
|
||||||
throw err;
|
|
||||||
} catch (e) {
|
|
||||||
return e.stack;
|
|
||||||
}
|
|
||||||
}
|
|
||||||
});
|
|
||||||
}
|
|
||||||
|
|
||||||
function DefaultsError(msg, defs) {
|
|
||||||
this.message = msg;
|
|
||||||
this.defs = defs;
|
|
||||||
}
|
|
||||||
DefaultsError.prototype = Object.create(Error.prototype);
|
|
||||||
DefaultsError.prototype.constructor = DefaultsError;
|
|
||||||
DefaultsError.prototype.name = "DefaultsError";
|
|
||||||
configure_error_stack(DefaultsError);
|
|
||||||
|
|
||||||
function defaults(args, defs, croak) {
|
|
||||||
if (croak) for (var i in args) {
|
|
||||||
if (HOP(args, i) && !HOP(defs, i)) throw new DefaultsError("`" + i + "` is not a supported option", defs);
|
|
||||||
}
|
|
||||||
for (var i in args) {
|
|
||||||
if (HOP(args, i)) defs[i] = args[i];
|
|
||||||
}
|
|
||||||
return defs;
|
|
||||||
}
|
|
||||||
|
|
||||||
function merge(obj, ext) {
|
|
||||||
var count = 0;
|
|
||||||
for (var i in ext) if (HOP(ext, i)) {
|
|
||||||
obj[i] = ext[i];
|
|
||||||
count++;
|
|
||||||
}
|
|
||||||
return count;
|
|
||||||
}
|
|
||||||
|
|
||||||
function noop() {}
|
|
||||||
function return_false() { return false; }
|
|
||||||
function return_true() { return true; }
|
|
||||||
function return_this() { return this; }
|
|
||||||
function return_null() { return null; }
|
|
||||||
|
|
||||||
var List = (function() {
|
|
||||||
function List(a, f) {
|
|
||||||
var ret = [];
|
|
||||||
for (var i = 0; i < a.length; i++) {
|
|
||||||
var val = f(a[i], i);
|
|
||||||
if (val === skip) continue;
|
|
||||||
if (val instanceof Splice) {
|
|
||||||
ret.push.apply(ret, val.v);
|
|
||||||
} else {
|
|
||||||
ret.push(val);
|
|
||||||
}
|
|
||||||
}
|
|
||||||
return ret;
|
|
||||||
}
|
|
||||||
List.is_op = function(val) {
|
|
||||||
return val === skip || val instanceof Splice;
|
|
||||||
};
|
|
||||||
List.splice = function(val) {
|
|
||||||
return new Splice(val);
|
|
||||||
};
|
|
||||||
var skip = List.skip = {};
|
|
||||||
function Splice(val) {
|
|
||||||
this.v = val;
|
|
||||||
}
|
|
||||||
return List;
|
|
||||||
})();
|
|
||||||
|
|
||||||
function push_uniq(array, el) {
|
|
||||||
if (array.indexOf(el) < 0) return array.push(el);
|
|
||||||
}
|
|
||||||
|
|
||||||
function string_template(text, props) {
|
|
||||||
return text.replace(/\{([^}]+)\}/g, function(str, p) {
|
|
||||||
var value = props[p];
|
|
||||||
return value instanceof AST_Node ? value.print_to_string() : value;
|
|
||||||
});
|
|
||||||
}
|
|
||||||
|
|
||||||
function remove(array, el) {
|
|
||||||
var index = array.indexOf(el);
|
|
||||||
if (index >= 0) array.splice(index, 1);
|
|
||||||
}
|
|
||||||
|
|
||||||
function makePredicate(words) {
|
|
||||||
if (!Array.isArray(words)) words = words.split(" ");
|
|
||||||
var map = Object.create(null);
|
|
||||||
words.forEach(function(word) {
|
|
||||||
map[word] = true;
|
|
||||||
});
|
|
||||||
return map;
|
|
||||||
}
|
|
||||||
|
|
||||||
function all(array, predicate) {
|
|
||||||
for (var i = array.length; --i >= 0;)
|
|
||||||
if (!predicate(array[i], i))
|
|
||||||
return false;
|
|
||||||
return true;
|
|
||||||
}
|
|
||||||
|
|
||||||
function Dictionary() {
|
|
||||||
this._values = Object.create(null);
|
|
||||||
this._size = 0;
|
|
||||||
}
|
|
||||||
Dictionary.prototype = {
|
|
||||||
set: function(key, val) {
|
|
||||||
if (!this.has(key)) ++this._size;
|
|
||||||
this._values["$" + key] = val;
|
|
||||||
return this;
|
|
||||||
},
|
|
||||||
add: function(key, val) {
|
|
||||||
if (this.has(key)) {
|
|
||||||
this.get(key).push(val);
|
|
||||||
} else {
|
|
||||||
this.set(key, [ val ]);
|
|
||||||
}
|
|
||||||
return this;
|
|
||||||
},
|
|
||||||
get: function(key) { return this._values["$" + key] },
|
|
||||||
del: function(key) {
|
|
||||||
if (this.has(key)) {
|
|
||||||
--this._size;
|
|
||||||
delete this._values["$" + key];
|
|
||||||
}
|
|
||||||
return this;
|
|
||||||
},
|
|
||||||
has: function(key) { return ("$" + key) in this._values },
|
|
||||||
all: function(predicate) {
|
|
||||||
for (var i in this._values)
|
|
||||||
if (!predicate(this._values[i], i.substr(1)))
|
|
||||||
return false;
|
|
||||||
return true;
|
|
||||||
},
|
|
||||||
each: function(f) {
|
|
||||||
for (var i in this._values)
|
|
||||||
f(this._values[i], i.substr(1));
|
|
||||||
},
|
|
||||||
size: function() {
|
|
||||||
return this._size;
|
|
||||||
},
|
|
||||||
map: function(f) {
|
|
||||||
var ret = [];
|
|
||||||
for (var i in this._values)
|
|
||||||
ret.push(f(this._values[i], i.substr(1)));
|
|
||||||
return ret;
|
|
||||||
},
|
|
||||||
clone: function() {
|
|
||||||
var ret = new Dictionary();
|
|
||||||
for (var i in this._values)
|
|
||||||
ret._values[i] = this._values[i];
|
|
||||||
ret._size = this._size;
|
|
||||||
return ret;
|
|
||||||
},
|
|
||||||
toObject: function() { return this._values }
|
|
||||||
};
|
|
||||||
Dictionary.fromObject = function(obj) {
|
|
||||||
var dict = new Dictionary();
|
|
||||||
dict._size = merge(dict._values, obj);
|
|
||||||
return dict;
|
|
||||||
};
|
|
||||||
|
|
||||||
function HOP(obj, prop) {
|
|
||||||
return Object.prototype.hasOwnProperty.call(obj, prop);
|
|
||||||
}
|
|
||||||
|
|
||||||
// return true if the node at the top of the stack (that means the
|
|
||||||
// innermost node in the current output) is lexically the first in
|
|
||||||
// a statement.
|
|
||||||
function first_in_statement(stack, arrow, export_default) {
|
|
||||||
var node = stack.parent(-1);
|
|
||||||
for (var i = 0, p; p = stack.parent(i++); node = p) {
|
|
||||||
if (is_arrow(p)) {
|
|
||||||
return arrow && p.value === node;
|
|
||||||
} else if (p instanceof AST_Binary) {
|
|
||||||
if (p.left === node) continue;
|
|
||||||
} else if (p.TYPE == "Call") {
|
|
||||||
if (p.expression === node) continue;
|
|
||||||
} else if (p instanceof AST_Conditional) {
|
|
||||||
if (p.condition === node) continue;
|
|
||||||
} else if (p instanceof AST_ExportDefault) {
|
|
||||||
return export_default;
|
|
||||||
} else if (p instanceof AST_PropAccess) {
|
|
||||||
if (p.expression === node) continue;
|
|
||||||
} else if (p instanceof AST_Sequence) {
|
|
||||||
if (p.expressions[0] === node) continue;
|
|
||||||
} else if (p instanceof AST_SimpleStatement) {
|
|
||||||
return true;
|
|
||||||
} else if (p instanceof AST_Template) {
|
|
||||||
if (p.tag === node) continue;
|
|
||||||
} else if (p instanceof AST_UnaryPostfix) {
|
|
||||||
if (p.expression === node) continue;
|
|
||||||
}
|
|
||||||
return false;
|
|
||||||
}
|
|
||||||
}
|
|
99
lib/node_modules/uglify-js/package.json
generated
vendored
99
lib/node_modules/uglify-js/package.json
generated
vendored
@ -1,99 +0,0 @@
|
|||||||
{
|
|
||||||
"_from": "uglify-js",
|
|
||||||
"_id": "uglify-js@3.13.9",
|
|
||||||
"_inBundle": false,
|
|
||||||
"_integrity": "sha512-wZbyTQ1w6Y7fHdt8sJnHfSIuWeDgk6B5rCb4E/AM6QNNPbOMIZph21PW5dRB3h7Df0GszN+t7RuUH6sWK5bF0g==",
|
|
||||||
"_location": "/uglify-js",
|
|
||||||
"_phantomChildren": {},
|
|
||||||
"_requested": {
|
|
||||||
"type": "tag",
|
|
||||||
"registry": true,
|
|
||||||
"raw": "uglify-js",
|
|
||||||
"name": "uglify-js",
|
|
||||||
"escapedName": "uglify-js",
|
|
||||||
"rawSpec": "",
|
|
||||||
"saveSpec": null,
|
|
||||||
"fetchSpec": "latest"
|
|
||||||
},
|
|
||||||
"_requiredBy": [
|
|
||||||
"#USER"
|
|
||||||
],
|
|
||||||
"_resolved": "https://registry.npmjs.org/uglify-js/-/uglify-js-3.13.9.tgz",
|
|
||||||
"_shasum": "4d8d21dcd497f29cfd8e9378b9df123ad025999b",
|
|
||||||
"_spec": "uglify-js",
|
|
||||||
"_where": "C:\\Dan\\Projects\\Web\\Discord-History-Tracker\\lib",
|
|
||||||
"author": {
|
|
||||||
"name": "Mihai Bazon",
|
|
||||||
"email": "mihai.bazon@gmail.com",
|
|
||||||
"url": "http://lisperator.net/"
|
|
||||||
},
|
|
||||||
"bin": {
|
|
||||||
"uglifyjs": "bin/uglifyjs"
|
|
||||||
},
|
|
||||||
"bugs": {
|
|
||||||
"url": "https://github.com/mishoo/UglifyJS/issues"
|
|
||||||
},
|
|
||||||
"bundleDependencies": false,
|
|
||||||
"deprecated": false,
|
|
||||||
"description": "JavaScript parser, mangler/compressor and beautifier toolkit",
|
|
||||||
"devDependencies": {
|
|
||||||
"acorn": "~8.2.1",
|
|
||||||
"semver": "~6.3.0"
|
|
||||||
},
|
|
||||||
"engines": {
|
|
||||||
"node": ">=0.8.0"
|
|
||||||
},
|
|
||||||
"files": [
|
|
||||||
"bin",
|
|
||||||
"lib",
|
|
||||||
"tools",
|
|
||||||
"LICENSE"
|
|
||||||
],
|
|
||||||
"homepage": "https://github.com/mishoo/UglifyJS#readme",
|
|
||||||
"keywords": [
|
|
||||||
"cli",
|
|
||||||
"compress",
|
|
||||||
"compressor",
|
|
||||||
"ecma",
|
|
||||||
"ecmascript",
|
|
||||||
"es",
|
|
||||||
"es5",
|
|
||||||
"javascript",
|
|
||||||
"js",
|
|
||||||
"jsmin",
|
|
||||||
"min",
|
|
||||||
"minification",
|
|
||||||
"minifier",
|
|
||||||
"minify",
|
|
||||||
"optimize",
|
|
||||||
"optimizer",
|
|
||||||
"pack",
|
|
||||||
"packer",
|
|
||||||
"parse",
|
|
||||||
"parser",
|
|
||||||
"uglifier",
|
|
||||||
"uglify"
|
|
||||||
],
|
|
||||||
"license": "BSD-2-Clause",
|
|
||||||
"main": "tools/node.js",
|
|
||||||
"maintainers": [
|
|
||||||
{
|
|
||||||
"name": "Alex Lam",
|
|
||||||
"email": "alexlamsl@gmail.com"
|
|
||||||
},
|
|
||||||
{
|
|
||||||
"name": "Mihai Bazon",
|
|
||||||
"email": "mihai.bazon@gmail.com",
|
|
||||||
"url": "http://lisperator.net/"
|
|
||||||
}
|
|
||||||
],
|
|
||||||
"name": "uglify-js",
|
|
||||||
"repository": {
|
|
||||||
"type": "git",
|
|
||||||
"url": "git+https://github.com/mishoo/UglifyJS.git"
|
|
||||||
},
|
|
||||||
"scripts": {
|
|
||||||
"test": "node test/compress.js && node test/mocha.js"
|
|
||||||
},
|
|
||||||
"version": "3.13.9"
|
|
||||||
}
|
|
456
lib/node_modules/uglify-js/tools/domprops.html
generated
vendored
456
lib/node_modules/uglify-js/tools/domprops.html
generated
vendored
@ -1,456 +0,0 @@
|
|||||||
<!doctype html>
|
|
||||||
<html>
|
|
||||||
<body>
|
|
||||||
<script>
|
|
||||||
!function(G) {
|
|
||||||
var domprops = [];
|
|
||||||
var objs = [ G ];
|
|
||||||
var tagNames = [
|
|
||||||
"a",
|
|
||||||
"abbr",
|
|
||||||
"acronym",
|
|
||||||
"address",
|
|
||||||
"applet",
|
|
||||||
"area",
|
|
||||||
"article",
|
|
||||||
"aside",
|
|
||||||
"audio",
|
|
||||||
"b",
|
|
||||||
"base",
|
|
||||||
"basefont",
|
|
||||||
"bdi",
|
|
||||||
"bdo",
|
|
||||||
"bgsound",
|
|
||||||
"big",
|
|
||||||
"blink",
|
|
||||||
"blockquote",
|
|
||||||
"body",
|
|
||||||
"br",
|
|
||||||
"button",
|
|
||||||
"canvas",
|
|
||||||
"caption",
|
|
||||||
"center",
|
|
||||||
"checked",
|
|
||||||
"cite",
|
|
||||||
"code",
|
|
||||||
"col",
|
|
||||||
"colgroup",
|
|
||||||
"command",
|
|
||||||
"comment",
|
|
||||||
"compact",
|
|
||||||
"content",
|
|
||||||
"data",
|
|
||||||
"datalist",
|
|
||||||
"dd",
|
|
||||||
"declare",
|
|
||||||
"defer",
|
|
||||||
"del",
|
|
||||||
"details",
|
|
||||||
"dfn",
|
|
||||||
"dialog",
|
|
||||||
"dir",
|
|
||||||
"disabled",
|
|
||||||
"div",
|
|
||||||
"dl",
|
|
||||||
"dt",
|
|
||||||
"element",
|
|
||||||
"em",
|
|
||||||
"embed",
|
|
||||||
"fieldset",
|
|
||||||
"figcaption",
|
|
||||||
"figure",
|
|
||||||
"font",
|
|
||||||
"footer",
|
|
||||||
"form",
|
|
||||||
"frame",
|
|
||||||
"frameset",
|
|
||||||
"h1",
|
|
||||||
"h2",
|
|
||||||
"h3",
|
|
||||||
"h4",
|
|
||||||
"h5",
|
|
||||||
"h6",
|
|
||||||
"head",
|
|
||||||
"header",
|
|
||||||
"hgroup",
|
|
||||||
"hr",
|
|
||||||
"html",
|
|
||||||
"i",
|
|
||||||
"iframe",
|
|
||||||
"image",
|
|
||||||
"img",
|
|
||||||
"input",
|
|
||||||
"ins",
|
|
||||||
"isindex",
|
|
||||||
"ismap",
|
|
||||||
"kbd",
|
|
||||||
"keygen",
|
|
||||||
"label",
|
|
||||||
"legend",
|
|
||||||
"li",
|
|
||||||
"link",
|
|
||||||
"listing",
|
|
||||||
"main",
|
|
||||||
"map",
|
|
||||||
"mark",
|
|
||||||
"marquee",
|
|
||||||
"math",
|
|
||||||
"menu",
|
|
||||||
"menuitem",
|
|
||||||
"meta",
|
|
||||||
"meter",
|
|
||||||
"multicol",
|
|
||||||
"multiple",
|
|
||||||
"nav",
|
|
||||||
"nextid",
|
|
||||||
"nobr",
|
|
||||||
"noembed",
|
|
||||||
"noframes",
|
|
||||||
"nohref",
|
|
||||||
"noresize",
|
|
||||||
"noscript",
|
|
||||||
"noshade",
|
|
||||||
"nowrap",
|
|
||||||
"object",
|
|
||||||
"ol",
|
|
||||||
"optgroup",
|
|
||||||
"option",
|
|
||||||
"output",
|
|
||||||
"p",
|
|
||||||
"param",
|
|
||||||
"picture",
|
|
||||||
"plaintext",
|
|
||||||
"pre",
|
|
||||||
"progress",
|
|
||||||
"q",
|
|
||||||
"rb",
|
|
||||||
"readonly",
|
|
||||||
"rp",
|
|
||||||
"rt",
|
|
||||||
"rtc",
|
|
||||||
"ruby",
|
|
||||||
"s",
|
|
||||||
"samp",
|
|
||||||
"script",
|
|
||||||
"section",
|
|
||||||
"select",
|
|
||||||
"selected",
|
|
||||||
"shadow",
|
|
||||||
"slot",
|
|
||||||
"small",
|
|
||||||
"source",
|
|
||||||
"spacer",
|
|
||||||
"span",
|
|
||||||
"strike",
|
|
||||||
"strong",
|
|
||||||
"style",
|
|
||||||
"sub",
|
|
||||||
"summary",
|
|
||||||
"sup",
|
|
||||||
"svg",
|
|
||||||
"table",
|
|
||||||
"tbody",
|
|
||||||
"td",
|
|
||||||
"template",
|
|
||||||
"textarea",
|
|
||||||
"tfoot",
|
|
||||||
"th",
|
|
||||||
"thead",
|
|
||||||
"time",
|
|
||||||
"title",
|
|
||||||
"tr",
|
|
||||||
"track",
|
|
||||||
"tt",
|
|
||||||
"u",
|
|
||||||
"ul",
|
|
||||||
"var",
|
|
||||||
"video",
|
|
||||||
"wbr",
|
|
||||||
"xmp",
|
|
||||||
"XXX",
|
|
||||||
];
|
|
||||||
for (var n = 0; n < tagNames.length; n++) {
|
|
||||||
add(document.createElement(tagNames[n]));
|
|
||||||
}
|
|
||||||
var nsNames = {
|
|
||||||
"http://www.w3.org/1998/Math/MathML": [
|
|
||||||
"annotation",
|
|
||||||
"annotation-xml",
|
|
||||||
"maction",
|
|
||||||
"maligngroup",
|
|
||||||
"malignmark",
|
|
||||||
"math",
|
|
||||||
"menclose",
|
|
||||||
"merror",
|
|
||||||
"mfenced",
|
|
||||||
"mfrac",
|
|
||||||
"mglyph",
|
|
||||||
"mi",
|
|
||||||
"mlabeledtr",
|
|
||||||
"mlongdiv",
|
|
||||||
"mmultiscripts",
|
|
||||||
"mn",
|
|
||||||
"mo",
|
|
||||||
"mover",
|
|
||||||
"mpadded",
|
|
||||||
"mphantom",
|
|
||||||
"mprescripts",
|
|
||||||
"mroot",
|
|
||||||
"mrow",
|
|
||||||
"ms",
|
|
||||||
"mscarries",
|
|
||||||
"mscarry",
|
|
||||||
"msgroup",
|
|
||||||
"msline",
|
|
||||||
"mspace",
|
|
||||||
"msqrt",
|
|
||||||
"msrow",
|
|
||||||
"mstack",
|
|
||||||
"mstyle",
|
|
||||||
"msub",
|
|
||||||
"msubsup",
|
|
||||||
"msup",
|
|
||||||
"mtable",
|
|
||||||
"mtd",
|
|
||||||
"mtext",
|
|
||||||
"mtr",
|
|
||||||
"munder",
|
|
||||||
"munderover",
|
|
||||||
"none",
|
|
||||||
"semantics",
|
|
||||||
],
|
|
||||||
"http://www.w3.org/2000/svg": [
|
|
||||||
"a",
|
|
||||||
"altGlyph",
|
|
||||||
"altGlyphDef",
|
|
||||||
"altGlyphItem",
|
|
||||||
"animate",
|
|
||||||
"animateColor",
|
|
||||||
"animateMotion",
|
|
||||||
"animateTransform",
|
|
||||||
"circle",
|
|
||||||
"clipPath",
|
|
||||||
"color-profile",
|
|
||||||
"cursor",
|
|
||||||
"defs",
|
|
||||||
"desc",
|
|
||||||
"discard",
|
|
||||||
"ellipse",
|
|
||||||
"feBlend",
|
|
||||||
"feColorMatrix",
|
|
||||||
"feComponentTransfer",
|
|
||||||
"feComposite",
|
|
||||||
"feConvolveMatrix",
|
|
||||||
"feDiffuseLighting",
|
|
||||||
"feDisplacementMap",
|
|
||||||
"feDistantLight",
|
|
||||||
"feDropShadow",
|
|
||||||
"feFlood",
|
|
||||||
"feFuncA",
|
|
||||||
"feFuncB",
|
|
||||||
"feFuncG",
|
|
||||||
"feFuncR",
|
|
||||||
"feGaussianBlur",
|
|
||||||
"feImage",
|
|
||||||
"feMerge",
|
|
||||||
"feMergeNode",
|
|
||||||
"feMorphology",
|
|
||||||
"feOffset",
|
|
||||||
"fePointLight",
|
|
||||||
"feSpecularLighting",
|
|
||||||
"feSpotLight",
|
|
||||||
"feTile",
|
|
||||||
"feTurbulence",
|
|
||||||
"filter",
|
|
||||||
"font",
|
|
||||||
"font-face",
|
|
||||||
"font-face-format",
|
|
||||||
"font-face-name",
|
|
||||||
"font-face-src",
|
|
||||||
"font-face-uri",
|
|
||||||
"foreignObject",
|
|
||||||
"g",
|
|
||||||
"glyph",
|
|
||||||
"glyphRef",
|
|
||||||
"hatch",
|
|
||||||
"hatchpath",
|
|
||||||
"hkern",
|
|
||||||
"image",
|
|
||||||
"line",
|
|
||||||
"linearGradient",
|
|
||||||
"marker",
|
|
||||||
"mask",
|
|
||||||
"mesh",
|
|
||||||
"meshgradient",
|
|
||||||
"meshpatch",
|
|
||||||
"meshrow",
|
|
||||||
"metadata",
|
|
||||||
"missing-glyph",
|
|
||||||
"mpath",
|
|
||||||
"path",
|
|
||||||
"pattern",
|
|
||||||
"polygon",
|
|
||||||
"polyline",
|
|
||||||
"radialGradient",
|
|
||||||
"rect",
|
|
||||||
"script",
|
|
||||||
"set",
|
|
||||||
"solidcolor",
|
|
||||||
"stop",
|
|
||||||
"style",
|
|
||||||
"svg",
|
|
||||||
"switch",
|
|
||||||
"symbol",
|
|
||||||
"text",
|
|
||||||
"textPath",
|
|
||||||
"title",
|
|
||||||
"tref",
|
|
||||||
"tspan",
|
|
||||||
"unknown",
|
|
||||||
"use",
|
|
||||||
"view",
|
|
||||||
"vkern",
|
|
||||||
],
|
|
||||||
};
|
|
||||||
if (document.createElementNS) for (var ns in nsNames) {
|
|
||||||
for (var n = 0; n < nsNames[ns].length; n++) {
|
|
||||||
add(document.createElementNS(ns, nsNames[ns][n]));
|
|
||||||
}
|
|
||||||
}
|
|
||||||
var skips = [
|
|
||||||
G.alert,
|
|
||||||
G.back,
|
|
||||||
G.blur,
|
|
||||||
G.captureEvents,
|
|
||||||
G.clearImmediate,
|
|
||||||
G.clearInterval,
|
|
||||||
G.clearTimeout,
|
|
||||||
G.close,
|
|
||||||
G.confirm,
|
|
||||||
G.console,
|
|
||||||
G.dump,
|
|
||||||
G.fetch,
|
|
||||||
G.find,
|
|
||||||
G.focus,
|
|
||||||
G.forward,
|
|
||||||
G.getAttention,
|
|
||||||
G.history,
|
|
||||||
G.home,
|
|
||||||
G.location,
|
|
||||||
G.moveBy,
|
|
||||||
G.moveTo,
|
|
||||||
G.navigator,
|
|
||||||
G.open,
|
|
||||||
G.openDialog,
|
|
||||||
G.print,
|
|
||||||
G.process,
|
|
||||||
G.prompt,
|
|
||||||
G.resizeBy,
|
|
||||||
G.resizeTo,
|
|
||||||
G.setImmediate,
|
|
||||||
G.setInterval,
|
|
||||||
G.setTimeout,
|
|
||||||
G.showModalDialog,
|
|
||||||
G.sizeToContent,
|
|
||||||
G.stop,
|
|
||||||
];
|
|
||||||
var types = [];
|
|
||||||
var interfaces = [
|
|
||||||
"beforeunloadevent",
|
|
||||||
"compositionevent",
|
|
||||||
"customevent",
|
|
||||||
"devicemotionevent",
|
|
||||||
"deviceorientationevent",
|
|
||||||
"dragevent",
|
|
||||||
"event",
|
|
||||||
"events",
|
|
||||||
"focusevent",
|
|
||||||
"hashchangeevent",
|
|
||||||
"htmlevents",
|
|
||||||
"keyboardevent",
|
|
||||||
"messageevent",
|
|
||||||
"mouseevent",
|
|
||||||
"mouseevents",
|
|
||||||
"storageevent",
|
|
||||||
"svgevents",
|
|
||||||
"textevent",
|
|
||||||
"touchevent",
|
|
||||||
"uievent",
|
|
||||||
"uievents",
|
|
||||||
];
|
|
||||||
var i = 0, full = false;
|
|
||||||
var addEvent = document.createEvent ? function(type) {
|
|
||||||
if (~indexOf(types, type)) return;
|
|
||||||
types.push(type);
|
|
||||||
for (var j = 0; j < interfaces.length; j++) try {
|
|
||||||
var event = document.createEvent(interfaces[j]);
|
|
||||||
event.initEvent(type, true, true);
|
|
||||||
add(event);
|
|
||||||
} catch (e) {}
|
|
||||||
} : function() {};
|
|
||||||
var scanProperties = Object.getOwnPropertyNames ? function(o, fn) {
|
|
||||||
var names = Object.getOwnPropertyNames(o);
|
|
||||||
names.forEach(fn);
|
|
||||||
for (var k in o) if (!~indexOf(names, k)) fn(k);
|
|
||||||
} : function(o, fn) {
|
|
||||||
for (var k in o) fn(k);
|
|
||||||
};
|
|
||||||
setTimeout(function next() {
|
|
||||||
for (var j = 10; --j >= 0 && i < objs.length; i++) {
|
|
||||||
var o = objs[i];
|
|
||||||
var skip = ~indexOf(skips, o);
|
|
||||||
try {
|
|
||||||
scanProperties(o, function(k) {
|
|
||||||
if (!~indexOf(domprops, k)) domprops.push(k);
|
|
||||||
if (/^on/.test(k)) addEvent(k.slice(2));
|
|
||||||
if (!full) try {
|
|
||||||
add(o[k]);
|
|
||||||
} catch (e) {}
|
|
||||||
});
|
|
||||||
} catch (e) {}
|
|
||||||
if (skip || full) continue;
|
|
||||||
try {
|
|
||||||
add(o.__proto__);
|
|
||||||
} catch (e) {}
|
|
||||||
try {
|
|
||||||
add(o.prototype);
|
|
||||||
} catch (e) {}
|
|
||||||
try {
|
|
||||||
add(new o());
|
|
||||||
} catch (e) {}
|
|
||||||
try {
|
|
||||||
add(o());
|
|
||||||
} catch (e) {}
|
|
||||||
}
|
|
||||||
if (!full && objs.length > 20000) {
|
|
||||||
alert(objs.length);
|
|
||||||
full = true;
|
|
||||||
}
|
|
||||||
if (i < objs.length) {
|
|
||||||
setTimeout(next, 0);
|
|
||||||
} else {
|
|
||||||
document.write('<pre>[\n "' + domprops.sort().join('",\n "').replace(/&/g, "&").replace(/</g, "<") + '"\n]</pre>');
|
|
||||||
}
|
|
||||||
}, 0);
|
|
||||||
|
|
||||||
function add(o) {
|
|
||||||
if (o) switch (typeof o) {
|
|
||||||
case "function":
|
|
||||||
case "object":
|
|
||||||
if (!~indexOf(objs, o)) objs.push(o);
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
function indexOf(list, value) {
|
|
||||||
var j = list.length;
|
|
||||||
while (--j >= 0) {
|
|
||||||
if (list[j] === value) break;
|
|
||||||
}
|
|
||||||
return j;
|
|
||||||
}
|
|
||||||
}(function() {
|
|
||||||
return this;
|
|
||||||
}());
|
|
||||||
</script>
|
|
||||||
</body>
|
|
||||||
</html>
|
|
8325
lib/node_modules/uglify-js/tools/domprops.json
generated
vendored
8325
lib/node_modules/uglify-js/tools/domprops.json
generated
vendored
File diff suppressed because it is too large
Load Diff
8
lib/node_modules/uglify-js/tools/exports.js
generated
vendored
8
lib/node_modules/uglify-js/tools/exports.js
generated
vendored
@ -1,8 +0,0 @@
|
|||||||
exports["Dictionary"] = Dictionary;
|
|
||||||
exports["is_statement"] = is_statement;
|
|
||||||
exports["List"] = List;
|
|
||||||
exports["minify"] = minify;
|
|
||||||
exports["parse"] = parse;
|
|
||||||
exports["push_uniq"] = push_uniq;
|
|
||||||
exports["TreeTransformer"] = TreeTransformer;
|
|
||||||
exports["TreeWalker"] = TreeWalker;
|
|
110
lib/node_modules/uglify-js/tools/node.js
generated
vendored
110
lib/node_modules/uglify-js/tools/node.js
generated
vendored
@ -1,110 +0,0 @@
|
|||||||
var fs = require("fs");
|
|
||||||
|
|
||||||
exports.FILES = [
|
|
||||||
require.resolve("../lib/utils.js"),
|
|
||||||
require.resolve("../lib/ast.js"),
|
|
||||||
require.resolve("../lib/transform.js"),
|
|
||||||
require.resolve("../lib/parse.js"),
|
|
||||||
require.resolve("../lib/scope.js"),
|
|
||||||
require.resolve("../lib/compress.js"),
|
|
||||||
require.resolve("../lib/output.js"),
|
|
||||||
require.resolve("../lib/sourcemap.js"),
|
|
||||||
require.resolve("../lib/mozilla-ast.js"),
|
|
||||||
require.resolve("../lib/propmangle.js"),
|
|
||||||
require.resolve("../lib/minify.js"),
|
|
||||||
require.resolve("./exports.js"),
|
|
||||||
];
|
|
||||||
|
|
||||||
new Function("exports", function() {
|
|
||||||
var code = exports.FILES.map(function(file) {
|
|
||||||
return fs.readFileSync(file, "utf8");
|
|
||||||
});
|
|
||||||
code.push("exports.describe_ast = " + describe_ast.toString());
|
|
||||||
return code.join("\n\n");
|
|
||||||
}())(exports);
|
|
||||||
|
|
||||||
function to_comment(value) {
|
|
||||||
if (typeof value != "string") value = JSON.stringify(value, function(key, value) {
|
|
||||||
return typeof value == "function" ? "<[ " + value + " ]>" : value;
|
|
||||||
}, 2);
|
|
||||||
return "// " + value.replace(/\n/g, "\n// ");
|
|
||||||
}
|
|
||||||
|
|
||||||
if (+process.env["UGLIFY_BUG_REPORT"]) exports.minify = function(files, options) {
|
|
||||||
if (typeof options == "undefined") options = "<<undefined>>";
|
|
||||||
var code = [
|
|
||||||
"// UGLIFY_BUG_REPORT",
|
|
||||||
to_comment(options),
|
|
||||||
];
|
|
||||||
if (typeof files == "string") {
|
|
||||||
code.push("");
|
|
||||||
code.push("//-------------------------------------------------------------")
|
|
||||||
code.push("// INPUT CODE", files);
|
|
||||||
} else for (var name in files) {
|
|
||||||
code.push("");
|
|
||||||
code.push("//-------------------------------------------------------------")
|
|
||||||
code.push(to_comment(name), files[name]);
|
|
||||||
}
|
|
||||||
if (options.sourceMap && options.sourceMap.url) {
|
|
||||||
code.push("");
|
|
||||||
code.push("//# sourceMappingURL=data:application/json;charset=utf-8;base64,eyJ2ZXJzaW9uIjozLCJzb3VyY2VzIjpbXSwibmFtZXMiOltdLCJtYXBwaW5ncyI6IiJ9");
|
|
||||||
}
|
|
||||||
var result = { code: code.join("\n") };
|
|
||||||
if (options.sourceMap) result.map = '{"version":3,"sources":[],"names":[],"mappings":""}';
|
|
||||||
return result;
|
|
||||||
};
|
|
||||||
|
|
||||||
function describe_ast() {
|
|
||||||
var out = OutputStream({ beautify: true });
|
|
||||||
doitem(AST_Node);
|
|
||||||
return out.get() + "\n";
|
|
||||||
|
|
||||||
function doitem(ctor) {
|
|
||||||
out.print("AST_" + ctor.TYPE);
|
|
||||||
var props = ctor.SELF_PROPS.filter(function(prop) {
|
|
||||||
return !/^\$/.test(prop);
|
|
||||||
});
|
|
||||||
if (props.length > 0) {
|
|
||||||
out.space();
|
|
||||||
out.with_parens(function() {
|
|
||||||
props.forEach(function(prop, i) {
|
|
||||||
if (i) out.space();
|
|
||||||
out.print(prop);
|
|
||||||
});
|
|
||||||
});
|
|
||||||
}
|
|
||||||
if (ctor.documentation) {
|
|
||||||
out.space();
|
|
||||||
out.print_string(ctor.documentation);
|
|
||||||
}
|
|
||||||
if (ctor.SUBCLASSES.length > 0) {
|
|
||||||
out.space();
|
|
||||||
out.with_block(function() {
|
|
||||||
ctor.SUBCLASSES.sort(function(a, b) {
|
|
||||||
return a.TYPE < b.TYPE ? -1 : 1;
|
|
||||||
}).forEach(function(ctor, i) {
|
|
||||||
out.indent();
|
|
||||||
doitem(ctor);
|
|
||||||
out.newline();
|
|
||||||
});
|
|
||||||
});
|
|
||||||
}
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
function infer_options(options) {
|
|
||||||
var result = exports.minify("", options);
|
|
||||||
return result.error && result.error.defs;
|
|
||||||
}
|
|
||||||
|
|
||||||
exports.default_options = function() {
|
|
||||||
var defs = infer_options({ 0: 0 });
|
|
||||||
Object.keys(defs).forEach(function(component) {
|
|
||||||
var options = {};
|
|
||||||
options[component] = { 0: 0 };
|
|
||||||
if (options = infer_options(options)) {
|
|
||||||
defs[component] = options;
|
|
||||||
}
|
|
||||||
});
|
|
||||||
return defs;
|
|
||||||
};
|
|
22
lib/node_modules/uglify-js/tools/tty.js
generated
vendored
22
lib/node_modules/uglify-js/tools/tty.js
generated
vendored
@ -1,22 +0,0 @@
|
|||||||
// workaround for tty output truncation on Node.js
|
|
||||||
try {
|
|
||||||
// prevent buffer overflow and other asynchronous bugs
|
|
||||||
process.stdout._handle.setBlocking(true);
|
|
||||||
process.stderr._handle.setBlocking(true);
|
|
||||||
} catch (e) {
|
|
||||||
// ensure output buffers are flushed before process termination
|
|
||||||
var exit = process.exit;
|
|
||||||
process.exit = function() {
|
|
||||||
var args = [].slice.call(arguments);
|
|
||||||
process.once("uncaughtException", function() {
|
|
||||||
(function callback() {
|
|
||||||
if (process.stdout.bufferSize || process.stderr.bufferSize) {
|
|
||||||
setTimeout(callback, 1);
|
|
||||||
} else {
|
|
||||||
exit.apply(process, args);
|
|
||||||
}
|
|
||||||
})();
|
|
||||||
});
|
|
||||||
throw exit;
|
|
||||||
};
|
|
||||||
}
|
|
@ -1,7 +0,0 @@
|
|||||||
@IF EXIST "%~dp0\node.exe" (
|
|
||||||
"%~dp0\node.exe" "%~dp0\node_modules\uglify-js\bin\uglifyjs" %*
|
|
||||||
) ELSE (
|
|
||||||
@SETLOCAL
|
|
||||||
@SET PATHEXT=%PATHEXT:;.JS;=;%
|
|
||||||
node "%~dp0\node_modules\uglify-js\bin\uglifyjs" %*
|
|
||||||
)
|
|
Loading…
Reference in New Issue
Block a user