astl - npm Package Compare versions

Comparing version 0.0.12 to 0.0.13

algorithm/binary_search.ts

@@ -0,0 +0,0 @@ import { Pair } from "../utility/Pair";

algorithm/heap.ts

@@ -0,0 +0,0 @@ import { advance, distance } from "../iterator/global";

algorithm/index.ts

@@ -0,0 +0,0 @@ export * from "./binary_search";

algorithm/iterations.ts

@@ -0,0 +0,0 @@ import { Pair } from "../utility/Pair";

algorithm/mathematics.ts

@@ -0,0 +0,0 @@ import { Pair } from "../utility/Pair";

algorithm/merge.ts

@@ -0,0 +0,0 @@ import { Vector } from "../container/Vector";

algorithm/modifiers.ts

@@ -0,0 +0,0 @@ import { advance } from "../iterator/global";

algorithm/partition.ts

@@ -0,0 +0,0 @@ import { Pair } from "../utility/Pair";

algorithm/random.ts

@@ -0,0 +0,0 @@ import { Vector } from "../container/Vector";

algorithm/sorting.ts

@@ -0,0 +0,0 @@ import { Vector } from "../container/Vector";

CODE_OF_CONDUCT.md

@@ -0,0 +0,0 @@ # Contributor Covenant Code of Conduct

container/Deque.ts

@@ -8,3 +8,2 @@ import { Vector } from "./Vector";
 
-import { IForwardIterator } from "../iterator/IForwardIterator";
 import { Repeater } from "../internal/iterator/disposable/Repeater";
@@ -26,6 +25,6 @@ import { distance } from "../iterator/global";
         this.matrix_.push_back(new Vector());
-        this.matrix_.back().reserve(Deque.MIN_ROW_CAPACITY);
+        this.matrix_.back().reserve(MIN_ROW_CAPACITY);
 
         this.size_ = 0;
-        this.capacity_ = Deque.ROW_SIZE * Deque.MIN_ROW_CAPACITY;
+        this.capacity_ = ROW_SIZE * MIN_ROW_CAPACITY;
     }
@@ -54,3 +53,3 @@
         this.matrix_.push_back(new Vector());
-        this.matrix_.back().reserve(Deque.MIN_ROW_CAPACITY);
+        this.matrix_.back().reserve(MIN_ROW_CAPACITY);
 
@@ -68,12 +67,19 @@ this.size_ = 0;
 
+    @inline
+    public reserve(capacity: usize): void
+    {
+        if (this.capacity_ < CMath.max(capacity, ROW_SIZE * MIN_ROW_CAPACITY))
+            this._Reserve(capacity, this.size());
+    }
+
     private _Reserve(capacity: usize, limit: usize): void
     {
         // FIX CAPACITY
-        capacity = CMath.max(capacity, Deque.ROW_SIZE * Deque.MIN_ROW_CAPACITY);
+        capacity = CMath.max(capacity, ROW_SIZE * MIN_ROW_CAPACITY);
         const length: usize = this._Compute_row_size(capacity);
-        capacity = length * Deque.ROW_SIZE;
+        capacity = length * ROW_SIZE;
         
         // CREATE THE NEW MATRIX
         const matrix: Vector<Vector<T>> = new Vector();
-        matrix.reserve(Deque.ROW_SIZE);
+        matrix.reserve(ROW_SIZE);
         this._Insert_row(matrix.end(), length);
@@ -90,8 +96,2 @@
 
-    @inline
-    public static reserve<T>(deque: Deque<T>, capacity: usize): void
-    {
-        deque._Reserve(capacity, deque.size());
-    }
-
     private _Try_expand(plus: usize, limit: usize = this.size()): void
@@ -103,3 +103,3 @@ {
 
-        const capacity: usize = CMath.max(required, this.capacity() * 2);
+        const capacity: usize = CMath.max(required, this.capacity() * MAGNIFIER);
         this._Reserve(capacity, limit);
@@ -136,3 +136,3 @@ }
     {
-        const value: f64 = capacity / <f64>Deque.ROW_SIZE;
+        const value: f64 = capacity / <f64>ROW_SIZE;
         const ret: usize = <usize>Math.ceil(value);
@@ -247,3 +247,3 @@
         // ADD A NEW ROW IF REQUIRED
-        if (top.size() >= length && this.matrix_.size() < Deque.ROW_SIZE)
+        if (top.size() >= length && this.matrix_.size() < ROW_SIZE)
             top = this._Insert_row(this.matrix_.begin(), length);
@@ -265,3 +265,3 @@
         // ADD A NEW ROW IF REQUIRED
-        if (bottom.size() >= length && this.matrix_.size() < Deque.ROW_SIZE)
+        if (bottom.size() >= length && this.matrix_.size() < ROW_SIZE)
             bottom = this._Insert_row(this.matrix_.end(), length);
@@ -312,3 +312,3 @@
             const deque: Deque<T> = new Deque();
-            deque._Reserve(CMath.max(this.size() + plus, this.capacity() * 2), 0);
+            deque._Reserve(CMath.max(this.size() + plus, this.capacity() * MAGNIFIER), 0);
 
@@ -452,6 +452,2 @@ deque.insert_range(deque.end(), this.begin(), pos);
 {
-    export const ROW_SIZE: usize = 8;
-    export const MIN_ROW_CAPACITY: usize = 4;
-    export const MAGNIFIER: usize = 2;
-
     export class Iterator<T>
@@ -630,2 +626,6 @@ {
     }
-}
+}
+
+@inline const ROW_SIZE: usize = 8;
+@inline const MIN_ROW_CAPACITY: usize = 4;
+@inline const MAGNIFIER: usize = 2;

container/ForwardList.ts

@@ -0,0 +0,0 @@ import { IForwardIterator } from "../iterator/IForwardIterator";

container/HashMap.ts

@@ -0,0 +0,0 @@ import { MapElementList } from "../internal/container/associative/MapElementList";

container/HashMultiMap.ts

@@ -0,0 +0,0 @@ import { MapElementList } from "../internal/container/associative/MapElementList";

container/HashMultiSet.ts

@@ -0,0 +0,0 @@ import { SetElementList } from "../internal/container/associative/SetElementList";

container/HashSet.ts

@@ -0,0 +0,0 @@ import { SetElementList } from "../internal/container/associative/SetElementList";

container/index.ts

@@ -0,0 +0,0 @@ export * from "./Deque";

container/List.ts

@@ -0,0 +0,0 @@ import { IForwardIterator } from "../iterator/IForwardIterator";

container/PriorityQueue.ts

@@ -0,0 +0,0 @@ import { Vector } from "./Vector";

container/Queue.ts

@@ -0,0 +0,0 @@ import { List } from "./List";

container/Stack.ts

@@ -0,0 +0,0 @@ import { Vector } from "./Vector";

container/TreeMap.ts

@@ -0,0 +0,0 @@ import { MapElementList } from "../internal/container/associative/MapElementList";

container/TreeMultiMap.ts

@@ -0,0 +0,0 @@ import { MapElementList } from "../internal/container/associative/MapElementList";

container/TreeMultiSet.ts

@@ -0,0 +0,0 @@ import { SetElementList } from "../internal/container/associative/SetElementList";

container/TreeSet.ts

@@ -0,0 +0,0 @@ import { SetElementList } from "../internal/container/associative/SetElementList";

container/Vector.ts

@@ -0,0 +0,0 @@ import { VectorContainer } from "../internal/container/linear/VectorContainer";

container/VectorBoolean.ts

@@ -0,0 +0,0 @@ import { TreeMap } from "./TreeMap";

exception/DomainError.ts

@@ -0,0 +0,0 @@ import { LogicError } from "./LogicError";

exception/Exception.ts

@@ -0,0 +0,0 @@ export class Exception extends Error

exception/index.ts

@@ -0,0 +0,0 @@ export * from "./DomainError";

exception/InvalidArgument.ts

@@ -0,0 +0,0 @@ import { LogicError } from "./LogicError";

exception/LengthError.ts

@@ -0,0 +0,0 @@ import { LogicError } from "./LogicError";

exception/LogicError.ts

@@ -0,0 +0,0 @@ import { Exception } from "./Exception";

exception/OutOfRange.ts

@@ -0,0 +0,0 @@ import { LogicError } from "./LogicError";

exception/OverflowError.ts

@@ -0,0 +0,0 @@ import { RuntimeError } from "./RuntimeError";

exception/RangeError.ts

@@ -0,0 +0,0 @@ import { RuntimeError } from "./RuntimeError";

exception/RuntimeError.ts

@@ -0,0 +0,0 @@ import { Exception } from "./Exception";

exception/UnderflowError.ts

@@ -0,0 +0,0 @@ import { RuntimeError } from "./RuntimeError";

experimental/container/FlatMap.ts

@@ -0,0 +0,0 @@ import { MapElementVector } from "../../internal/container/associative/MapElementVector";

experimental/container/FlatMultiMap.ts

@@ -0,0 +0,0 @@ import { MapElementVector } from "../../internal/container/associative/MapElementVector";

experimental/container/FlatMultiSet.ts

@@ -0,0 +0,0 @@ import { SetElementVector } from "../../internal/container/associative/SetElementVector";

experimental/container/FlatSet.ts

@@ -0,0 +0,0 @@ import { SetElementVector } from "../../internal/container/associative/SetElementVector";

experimental/container/index.ts

@@ -0,0 +0,0 @@ export * from "./FlatMap";

experimental/index.ts

@@ -0,0 +0,0 @@ import * as experimental from "./module";

functional/comparators.ts

@@ -0,0 +0,0 @@ @inline

functional/hash.ts

@@ -1,20 +0,25 @@
-export function hash<T>(obj: T): usize
+export function hash<T>(key: T): usize
 {
-    if (isInteger(obj) || isFloat(obj) || isBoolean(obj))
-        return hash_by_string(obj);
-    else if (isString(obj))
-        return hash_string(<string>obj);
-    else if (isReference(obj))
-        return hash_by_string(changetype<usize>(obj));
+    if (isString<T>())
+        return hash_string(key);
+    else if (isReference<T>())
+    {
+        if (sizeof<T>() === 4) return hash32(<usize>changetype<u32>(key));
+        if (sizeof<T>() === 8) return hash64(<usize>changetype<u64>(key));
+    }
+    else if (isFloat<T>())
+    {
+        if (sizeof<T>() === 4) return hash32(<usize>reinterpret<u32>(f32(key)));
+        if (sizeof<T>() === 8) return hash64(<usize>reinterpret<u64>(f64(key)));
+    }
     else
-        return 0;
+    {
+        if (sizeof<T>() === 1) return hash8(usize(key));
+        if (sizeof<T>() === 2) return hash16(usize(key));
+        if (sizeof<T>() === 4) return hash32(usize(key));
+        if (sizeof<T>() === 8) return hash64(usize(key));
+    }
+    return 0;
 }
 
-@inline
-function hash_by_string<T extends IStringable>
-    (value: T): usize
-{
-    return hash_string(value.toString());
-}
-
 function hash_string(str: string): usize
@@ -31,8 +36,47 @@ {
 
-const INIT_VALUE: usize = 2166136261;
-const MULTIPLIER: usize = 16777619;
+function hash8(key: usize): usize
+{
+    return INIT_VALUE ^ key * MULTIPLIER;
+}
 
-interface IStringable
+function hash16(key: usize): usize
 {
-    toString(): string;
-}
+    let ret: usize = INIT_VALUE;
+    ret = (ret ^ ( key        & 0xff)) * MULTIPLIER;
+    ret = (ret ^ ( key >>  8        )) * MULTIPLIER;
+
+    return ret;
+}
+
+function hash32(key: usize): usize
+{
+    let ret: usize = INIT_VALUE;
+    ret = (ret ^ ( key        & 0xff)) * MULTIPLIER;
+    ret = (ret ^ ((key >>  8) & 0xff)) * MULTIPLIER;
+    ret = (ret ^ ((key >> 16) & 0xff)) * MULTIPLIER;
+    ret = (ret ^ ( key >> 24        )) * MULTIPLIER;
+
+    return ret;
+}
+
+function hash64(key: usize): usize
+{
+    // SEPARATE FOR 32 BITS SYSTEM
+    const x: usize = key;
+    const y: usize = (key >>> 32);
+
+    var ret = INIT_VALUE;
+    ret = (ret ^ ( x        & 0xff)) * MULTIPLIER;
+    ret = (ret ^ ((x >>  8) & 0xff)) * MULTIPLIER;
+    ret = (ret ^ ((x >> 16) & 0xff)) * MULTIPLIER;
+    ret = (ret ^ ( x >> 24        )) * MULTIPLIER;
+    ret = (ret ^ ( y        & 0xff)) * MULTIPLIER;
+    ret = (ret ^ ((y >>  8) & 0xff)) * MULTIPLIER;
+    ret = (ret ^ ((y >> 16) & 0xff)) * MULTIPLIER;
+    ret = (ret ^ ( y >> 24        )) * MULTIPLIER;
+
+    return ret;
+}
+
+@inline const INIT_VALUE: usize = 2166136261;
+@inline const MULTIPLIER: usize = 16777619;

functional/index.ts

 export * from "./comparators";
 export * from "./hash";
 export * from "./IPointer";

functional/IPointer.ts

@@ -0,0 +0,0 @@ export interface IPointer<T>

index.ts

@@ -0,0 +0,0 @@ import * as std from "./module";

internal/container/associative/IAssociativeContainer.ts

@@ -0,0 +0,0 @@ import { IContainer, IContainerIterator, IContainerReverseIterator } from "../linear/IContainer";

internal/container/associative/IHashContainer.ts

@@ -0,0 +0,0 @@ import { IContainer, IContainerIterator, IContainerReverseIterator } from "../linear/IContainer";

internal/container/associative/IHashMap.ts

@@ -0,0 +0,0 @@ import { IMapContainer } from "./IMapContainer";

internal/container/associative/IHashSet.ts

@@ -0,0 +0,0 @@ import { ISetContainer } from "./ISetContainer";

internal/container/associative/IMapContainer.ts

@@ -0,0 +0,0 @@ import { IContainer, IContainerIterator, IContainerReverseIterator } from "../linear/IContainer";

internal/container/associative/ISetContainer.ts

@@ -0,0 +0,0 @@ import { IContainer, IContainerIterator, IContainerReverseIterator } from "../linear/IContainer";

internal/container/associative/ITreeContainer.ts

@@ -0,0 +0,0 @@ import { IContainer, IContainerIterator, IContainerReverseIterator } from "../linear/IContainer";

internal/container/associative/ITreeMap.ts

@@ -0,0 +0,0 @@ import { IMapContainer, IMapContainerIterator, IMapContainerReverseIterator } from "./IMapContainer";

internal/container/associative/ITreeSet.ts

@@ -0,0 +0,0 @@ import { ISetContainer, ISetContainerIterator, ISetContainerReverseIterator } from "./ISetContainer";

internal/container/associative/MapElementList.ts

@@ -0,0 +0,0 @@ import { IMapContainer } from "./IMapContainer";

internal/container/associative/MapElementVector.ts

@@ -0,0 +0,0 @@ import { ITreeMap } from "./ITreeMap";

internal/container/associative/SetElementList.ts

@@ -0,0 +0,0 @@ import { ISetContainer } from "./ISetContainer";

internal/container/associative/SetElementVector.ts

@@ -0,0 +0,0 @@ import { ITreeSet } from "./ITreeSet";

internal/container/linear/IArrayContainer.ts

@@ -0,0 +0,0 @@ import { IContainer } from "./IContainer";

internal/container/linear/IContainer.ts

@@ -0,0 +0,0 @@ import { IReversableIterator } from "../../../iterator/IReversableIterator";

internal/container/linear/ILinearContainer.ts

@@ -0,0 +0,0 @@ import { IContainer, IContainerIterator, IContainerReverseIterator } from "./IContainer";

internal/container/linear/VectorContainer.ts

@@ -0,0 +0,0 @@ import { distance } from "../../../iterator/global";

internal/container/partial/IClear.ts

@@ -0,0 +0,0 @@ export declare interface IClear

internal/container/partial/IDeque.ts

@@ -0,0 +0,0 @@ import { IPushFront } from "./IPushFront";

internal/container/partial/IEmpty.ts

@@ -0,0 +0,0 @@ export declare interface IEmpty

internal/container/partial/IFront.ts

@@ -0,0 +0,0 @@ export declare interface IFront<T>

internal/container/partial/IInsert.ts

@@ -0,0 +0,0 @@ import { IPointer } from "../../../functional/IPointer";

internal/container/partial/IPushBack.ts

@@ -0,0 +0,0 @@ export declare interface IPushBack<T>

internal/container/partial/IPushFront.ts

@@ -0,0 +0,0 @@ export declare interface IPushFront<T>

internal/container/partial/ISize.ts

@@ -0,0 +0,0 @@ export declare interface ISize

internal/exception/ErrorGenerator.ts

@@ -0,0 +0,0 @@ import { OutOfRange } from "../../exception/OutOfRange";

internal/functional/SourcePointer.ts

@@ -0,0 +0,0 @@ export class SourcePointer<T extends object>

internal/hash/HashBuckets.ts

@@ -70,3 +70,3 @@ import { Vector } from "../../container/Vector";
         {
-            length = length / this.max_load_factor_;
+            length = <usize>(length / this.max_load_factor_);
             this.rehash(length);
@@ -73,0 +73,0 @@ }

internal/hash/IteratorHashBuckets.ts

@@ -0,0 +0,0 @@ import { HashBuckets } from "./HashBuckets";

internal/iterator/disposable/Repeater.ts

@@ -0,0 +0,0 @@ export class Repeater<T>

internal/iterator/ReverseIteratorBase.ts

@@ -0,0 +0,0 @@ import { IContainer, IContainerIterator, IContainerReverseIterator } from "../container/linear/IContainer";

internal/numeric/CMath.ts

@@ -0,0 +0,0 @@ import { Vector } from "../../container/Vector";

internal/tree/MultiIteratorTree.ts

@@ -0,0 +0,0 @@ import { MultiXTree } from "./MultiXTree";

internal/tree/MultiXTree.ts

@@ -116,2 +116,3 @@ import { XTreeNode } from "./XTreeNode";
         // RETURNS -> MATCHED OR NOT
+        // return matched !== null ? matched : ret;
         if (matched !== null)
@@ -118,0 +119,0 @@ return matched;

internal/tree/UniqueIteratorTree.ts

@@ -0,0 +0,0 @@ import { UniqueXTree } from "./UniqueXTree";

internal/tree/UniqueXTree.ts

@@ -0,0 +0,0 @@ import { XTreeNode } from "./XTreeNode";

internal/tree/XColor.ts

@@ -0,0 +0,0 @@ export const enum XColor

internal/tree/XTreeNode.ts

@@ -0,0 +0,0 @@ import { XColor } from "./XColor";

iterator/BackInsertIterator.ts

@@ -0,0 +0,0 @@ import { IPushBack } from "../internal/container/partial/IPushBack";

iterator/factory.ts

@@ -0,0 +0,0 @@ import { IPushBack } from "../internal/container/partial/IPushBack";

iterator/FrontInsertIterator.ts

@@ -0,0 +0,0 @@ import { IPushFront } from "../internal/container/partial/IPushFront";

iterator/global.ts

@@ -0,0 +0,0 @@ import { IEmpty } from "../internal/container/partial/IEmpty";

iterator/IBidirectionalIterator.ts

@@ -0,0 +0,0 @@ import { IForwardIterator } from "./IForwardIterator";

iterator/IForwardIterator.ts

@@ -0,0 +0,0 @@ import { IPointer } from "../functional/IPointer";

iterator/index.ts

@@ -0,0 +0,0 @@ export * from "./IBidirectionalIterator";

iterator/InsertIterator.ts

@@ -0,0 +0,0 @@ export class InsertIterator<ContainerT, IteratorT, T>

iterator/IRandomAccessIterator.ts

@@ -0,0 +0,0 @@ import { IBidirectionalIterator } from "./IBidirectionalIterator";

iterator/IReversableIterator.ts

@@ -0,0 +0,0 @@ import { IBidirectionalIterator } from "./IBidirectionalIterator";

iterator/IReverseIterator.ts

@@ -0,0 +0,0 @@ import { IBidirectionalIterator } from "./IBidirectionalIterator";

module.ts

@@ -0,0 +0,0 @@ export * from "./algorithm";

numeric/index.ts

@@ -0,0 +0,0 @@ export * from "./special_math";

numeric/operations.ts

@@ -0,0 +0,0 @@ import { BinaryPredicator } from "../internal/functional/BinaryPredicator";

numeric/operators.ts

@@ -0,0 +0,0 @@ /* ---------------------------------------------------------

numeric/special_math/bessels.ts

@@ -0,0 +0,0 @@ import { InvalidArgument } from "../../exception/InvalidArgument";

numeric/special_math/beta.ts

@@ -0,0 +0,0 @@ import { tgamma } from "./gamma";

numeric/special_math/ellints.ts

@@ -0,0 +0,0 @@ import { InvalidArgument } from "../../exception/InvalidArgument";

numeric/special_math/expint.ts

@@ -0,0 +0,0 @@ import { CMath } from "../../internal/numeric/CMath";

numeric/special_math/gamma.ts

@@ -0,0 +0,0 @@ export function tgamma(x: f64): f64

numeric/special_math/hermite.ts

@@ -0,0 +0,0 @@ import { Vector } from "../../container/Vector";

numeric/special_math/index.ts

@@ -0,0 +0,0 @@ export * from "./bessels";

numeric/special_math/laguerres.ts

@@ -0,0 +0,0 @@ import { Vector } from "../../container/Vector";

numeric/special_math/legendres.ts

@@ -0,0 +0,0 @@ import { Vector } from "../../container/Vector";

numeric/special_math/zeta.ts

@@ -45,2 +45,2 @@ import { tgamma } from "./gamma";
 
-const INFINITY: usize = 100 * 1000;
+@inline const INFINITY: usize = 100 * 1000;

package.json

@@ -9,3 +9,3 @@ {
   },
-  "version": "0.0.12",
+  "version": "0.0.13",
   "ascMain": "./index.ts",
@@ -12,0 +12,0 @@ "scripts": {

ranges/container/IBidirectionalContainer.ts

@@ -0,0 +0,0 @@ import { IForwardContainer } from "./IForwardContainer";

ranges/container/IForwardContainer.ts

@@ -0,0 +0,0 @@ import { IPointer } from "../../functional/IPointer";

ranges/container/IRandomAccessContainer.ts

@@ -0,0 +0,0 @@ import { IForwardContainer } from "./IForwardContainer";

README.md

@@ -0,0 +0,0 @@ # AssemblyScript Standard Template Library

utility/Entry.ts

@@ -0,0 +0,0 @@ export class Entry<Key, T>

utility/index.ts

 export * from "./IPair";
 export * from "./Pair";
 export * from "./Entry";

utility/IPair.ts

@@ -0,0 +0,0 @@ export interface IPair<First, Second>

utility/Pair.ts

@@ -0,0 +0,0 @@ export class Pair<First, Second>

New alerts

License Policy Violation

License

This package is not allowed per your license policy. Review the package's license to ensure compliance.

Found 1 instance in 1 package

Fixed alerts

License Policy Violation

License

This package is not allowed per your license policy. Review the package's license to ensure compliance.

Found 1 instance in 1 package

Improved metrics

Total package byte prevSize

342134

increased by3.91%

Lines of code

9585

increased by0.41%

No dependency changes