admin/javascript-obfuscator-javascript-obfuscator
1
0
Fork 0
mirror of https://github.com/javascript-obfuscator/javascript-obfuscator synced 2026-08-09 12:42:29 +00:00
Code Issues Packages Projects Releases Wiki Activity

Utility classes with state now are non-static

Browse Source
This commit is contained in:
sanex3339
2017-06-27 00:49:19 +03:00
parent 894c90863a
commit d21c5afa8a
93 changed files with 1699 additions and 999 deletions
Download Patch File Download Diff File Expand all files Collapse all files
test/unit-tests/node/node-appender/NodeAppender.spec.ts
+11 -19
View File
@@ -58,15 +58,20 @@ describe('NodeAppender', () => {
});
describe('appendNodeToOptimalBlockScope (blockScopeStackTraceData: IStackTraceData[], blockScopeNode: TNodeWithBlockStatement, nodeBodyStatements: TStatement[], index: number = 0): void', () => {
const inversifyContainerFacade: IInversifyContainerFacade = new InversifyContainerFacade({});
const stackTraceAnalyzer: IStackTraceAnalyzer = inversifyContainerFacade
.get<IStackTraceAnalyzer>(ServiceIdentifiers.IStackTraceAnalyzer);
let astTree: ESTree.Program,
let stackTraceAnalyzer: IStackTraceAnalyzer,
astTree: ESTree.Program,
expectedAstTree: ESTree.Program,
node: TStatement[],
stackTraceData: IStackTraceData[];
before(() => {
const inversifyContainerFacade: IInversifyContainerFacade = new InversifyContainerFacade();
inversifyContainerFacade.load({});
stackTraceAnalyzer = inversifyContainerFacade
.get<IStackTraceAnalyzer>(ServiceIdentifiers.IStackTraceAnalyzer);
});
beforeEach(() => {
node = convertCodeToStructure('/fixtures/simple-input.js');
});
@@ -145,7 +150,7 @@ describe('NodeAppender', () => {
stackTraceData,
astTree,
node,
NodeAppender.getRandomStackTraceIndex(stackTraceData.length)
stackTraceData.length - 1
);
});
@@ -157,19 +162,6 @@ describe('NodeAppender', () => {
});
});
describe('getRandomStackTraceIndex (stackTraceRootLength: number): number', () => {
it('should return random index between 0 and stack trace data root length', () => {
let index: number;
for (let i: number = 0; i < 100; i++) {
index = NodeAppender.getRandomStackTraceIndex(100);
assert.isAtLeast(index, 0);
assert.isAtMost(index, 100);
}
});
});
describe('insertNodeAtIndex (blockScopeNode: TNodeWithBlockStatement[], nodeBodyStatements: TStatement[], index: number): void', () => {
let astTree: ESTree.Program,
expectedAstTree: ESTree.Program,