Download all versions of hppcrt JAR files with all dependencies
hppcrt from group com.github.vsonnier (version 0.7.5)
High Performance Primitive Collections Realtime
(fork of HPPC of Carrotsearch)
Fundamental data structures (maps, sets, lists, stacks, queues, heaps, sorts) generated for
combinations of object and primitive types to conserve JVM memory and speed
up execution. The Realtime fork intend of extending collections while tweaking and optimizations to remove any dynamic allocations at runtime,
and low variance execution times.
Artifact hppcrt
Group com.github.vsonnier
Version 0.7.5
Last update 11. July 2017
Tags: dynamic combinations remove data existing runtime object from execution conserve nature times performance sets types primitive allocations collections lists fork speed whatever extend heaps variance intends memory structures tweaking obtain input realtime maps generated carrotsearch queues high fundamental sorts hppc
Organization not specified
URL Not specified
License not specified
Dependencies amount 0
Dependencies No dependencies
There are maybe transitive dependencies!
Group com.github.vsonnier
Version 0.7.5
Last update 11. July 2017
Tags: dynamic combinations remove data existing runtime object from execution conserve nature times performance sets types primitive allocations collections lists fork speed whatever extend heaps variance intends memory structures tweaking obtain input realtime maps generated carrotsearch queues high fundamental sorts hppc
Organization not specified
URL Not specified
License not specified
Dependencies amount 0
Dependencies No dependencies
There are maybe transitive dependencies!
hppcrt from group com.github.vsonnier (version 0.7.4)
High Performance Primitive Collections Realtime
(fork of HPPC of Carrotsearch)
Fundamental data structures (maps, sets, lists, stacks, queues, heaps, sorts) generated for
combinations of object and primitive types to conserve JVM memory and speed
up execution. The Realtime fork intend of extending collections while tweaking and optimizations to remove any dynamic allocations at runtime,
and low variance execution times.
Artifact hppcrt
Group com.github.vsonnier
Version 0.7.4
Last update 30. January 2016
Tags: dynamic combinations remove data existing runtime object from execution conserve nature times performance sets types primitive allocations collections lists fork speed whatever extend heaps variance intends memory structures tweaking obtain input realtime maps generated carrotsearch queues high fundamental sorts hppc
Organization not specified
URL Not specified
License not specified
Dependencies amount 0
Dependencies No dependencies
There are maybe transitive dependencies!
Group com.github.vsonnier
Version 0.7.4
Last update 30. January 2016
Tags: dynamic combinations remove data existing runtime object from execution conserve nature times performance sets types primitive allocations collections lists fork speed whatever extend heaps variance intends memory structures tweaking obtain input realtime maps generated carrotsearch queues high fundamental sorts hppc
Organization not specified
URL Not specified
License not specified
Dependencies amount 0
Dependencies No dependencies
There are maybe transitive dependencies!
hppcrt from group com.github.vsonnier (version 0.7.3)
High Performance Primitive Collections Realtime
(fork of HPPC of Carrotsearch)
Fundamental data structures (maps, sets, lists, stacks, queues, heaps, sorts) generated for
combinations of object and primitive types to conserve JVM memory and speed
up execution. The Realtime fork intend of extending collections while tweaking and optimizations to remove any dynamic allocations at runtime,
and low variance execution times.
Artifact hppcrt
Group com.github.vsonnier
Version 0.7.3
Last update 27. January 2016
Tags: dynamic combinations remove data existing runtime object from execution conserve nature times performance sets types primitive allocations collections lists fork speed whatever extend heaps variance intends memory structures tweaking obtain input realtime maps generated carrotsearch queues high fundamental sorts hppc
Organization not specified
URL Not specified
License not specified
Dependencies amount 0
Dependencies No dependencies
There are maybe transitive dependencies!
Group com.github.vsonnier
Version 0.7.3
Last update 27. January 2016
Tags: dynamic combinations remove data existing runtime object from execution conserve nature times performance sets types primitive allocations collections lists fork speed whatever extend heaps variance intends memory structures tweaking obtain input realtime maps generated carrotsearch queues high fundamental sorts hppc
Organization not specified
URL Not specified
License not specified
Dependencies amount 0
Dependencies No dependencies
There are maybe transitive dependencies!
hppcrt from group com.github.vsonnier (version 0.7.2)
High Performance Primitive Collections Realtime
(fork of HPPC of Carrotsearch)
Fundamental data structures (maps, sets, lists, stacks, queues, heaps, sorts) generated for
combinations of object and primitive types to conserve JVM memory and speed
up execution. The Realtime fork intend of extending collections while tweaking and optimizations to remove any dynamic allocations at runtime,
and low variance execution times.
Artifact hppcrt
Group com.github.vsonnier
Version 0.7.2
Last update 21. October 2015
Tags: dynamic combinations remove data existing runtime object from execution conserve nature times performance sets types primitive allocations collections lists fork speed whatever extend heaps variance intends memory structures tweaking obtain input realtime maps generated carrotsearch queues high fundamental sorts hppc
Organization not specified
URL Not specified
License not specified
Dependencies amount 0
Dependencies No dependencies
There are maybe transitive dependencies!
Group com.github.vsonnier
Version 0.7.2
Last update 21. October 2015
Tags: dynamic combinations remove data existing runtime object from execution conserve nature times performance sets types primitive allocations collections lists fork speed whatever extend heaps variance intends memory structures tweaking obtain input realtime maps generated carrotsearch queues high fundamental sorts hppc
Organization not specified
URL Not specified
License not specified
Dependencies amount 0
Dependencies No dependencies
There are maybe transitive dependencies!
hppcrt from group com.github.vsonnier (version 0.7.1)
High Performance Primitive Collections Realtime
(fork of HPPC of Carrotsearch)
Fundamental data structures (maps, sets, lists, stacks, queues, heaps, sorts) generated for
combinations of object and primitive types to conserve JVM memory and speed
up execution. The Realtime fork intend of extending collections while tweaking and optimizations to remove any dynamic allocations at runtime,
and low variance execution times.
Artifact hppcrt
Group com.github.vsonnier
Version 0.7.1
Last update 20. July 2015
Tags: dynamic combinations remove data existing runtime object from execution conserve nature times performance sets types primitive allocations collections lists fork speed whatever extend heaps variance intends memory structures tweaking obtain input realtime maps generated carrotsearch queues high fundamental sorts hppc
Organization not specified
URL Not specified
License not specified
Dependencies amount 0
Dependencies No dependencies
There are maybe transitive dependencies!
Group com.github.vsonnier
Version 0.7.1
Last update 20. July 2015
Tags: dynamic combinations remove data existing runtime object from execution conserve nature times performance sets types primitive allocations collections lists fork speed whatever extend heaps variance intends memory structures tweaking obtain input realtime maps generated carrotsearch queues high fundamental sorts hppc
Organization not specified
URL Not specified
License not specified
Dependencies amount 0
Dependencies No dependencies
There are maybe transitive dependencies!
hppcrt from group com.github.vsonnier (version 0.7.0)
High Performance Primitive Collections Realtime
(fork of HPPC of Carrotsearch)
Fundamental data structures (maps, sets, lists, stacks, queues, heaps, sorts) generated for
combinations of object and primitive types to conserve JVM memory and speed
up execution. The Realtime fork intend of extending collections while tweaking and optimizations to remove any dynamic allocations at runtime,
and low variance execution times.
Artifact hppcrt
Group com.github.vsonnier
Version 0.7.0
Last update 19. July 2015
Tags: dynamic combinations remove data existing runtime object from execution conserve nature times performance sets types primitive allocations collections lists fork speed whatever extend heaps variance intends memory structures tweaking obtain input realtime maps generated carrotsearch queues high fundamental sorts hppc
Organization not specified
URL Not specified
License not specified
Dependencies amount 0
Dependencies No dependencies
There are maybe transitive dependencies!
Group com.github.vsonnier
Version 0.7.0
Last update 19. July 2015
Tags: dynamic combinations remove data existing runtime object from execution conserve nature times performance sets types primitive allocations collections lists fork speed whatever extend heaps variance intends memory structures tweaking obtain input realtime maps generated carrotsearch queues high fundamental sorts hppc
Organization not specified
URL Not specified
License not specified
Dependencies amount 0
Dependencies No dependencies
There are maybe transitive dependencies!
hppcrt from group com.github.vsonnier (version 0.6.8)
High Performance Primitive Collections Realtime
(fork of HPPC of Carrotsearch)
Fundamental data structures (maps, sets, lists, stacks, queues, heaps, sorts) generated for
combinations of object and primitive types to conserve JVM memory and speed
up execution. The Realtime fork intend of extending collections while tweaking and optimizations to remove any dynamic allocations at runtime,
and low variance execution times.
Artifact hppcrt
Group com.github.vsonnier
Version 0.6.8
Last update 27. February 2015
Tags: dynamic combinations remove data runtime object execution while conserve times performance sets types optimizations primitive allocations collections lists fork speed heaps variance stacks memory structures tweaking realtime maps generated carrotsearch queues high fundamental intend sorts extending hppc
Organization not specified
URL Not specified
License not specified
Dependencies amount 0
Dependencies No dependencies
There are maybe transitive dependencies!
Group com.github.vsonnier
Version 0.6.8
Last update 27. February 2015
Tags: dynamic combinations remove data runtime object execution while conserve times performance sets types optimizations primitive allocations collections lists fork speed heaps variance stacks memory structures tweaking realtime maps generated carrotsearch queues high fundamental intend sorts extending hppc
Organization not specified
URL Not specified
License not specified
Dependencies amount 0
Dependencies No dependencies
There are maybe transitive dependencies!
hppcrt from group com.github.vsonnier (version 0.6.7)
High Performance Primitive Collections Realtime
(fork of HPPC of Carrotsearch)
Fundamental data structures (maps, sets, lists, stacks, queues, heaps, sorts) generated for
combinations of object and primitive types to conserve JVM memory and speed
up execution. The Realtime fork intend of extending collections while tweaking and optimizations to remove any dynamic allocations at runtime,
and low variance execution times.
Artifact hppcrt
Group com.github.vsonnier
Version 0.6.7
Last update 25. October 2014
Tags: dynamic combinations remove data runtime object execution while conserve times performance sets types optimizations primitive allocations collections lists fork speed heaps variance stacks memory structures tweaking realtime maps generated carrotsearch queues high fundamental intend sorts extending hppc
Organization not specified
URL Not specified
License not specified
Dependencies amount 0
Dependencies No dependencies
There are maybe transitive dependencies!
Group com.github.vsonnier
Version 0.6.7
Last update 25. October 2014
Tags: dynamic combinations remove data runtime object execution while conserve times performance sets types optimizations primitive allocations collections lists fork speed heaps variance stacks memory structures tweaking realtime maps generated carrotsearch queues high fundamental intend sorts extending hppc
Organization not specified
URL Not specified
License not specified
Dependencies amount 0
Dependencies No dependencies
There are maybe transitive dependencies!
hppcrt from group com.github.vsonnier (version 0.6.6)
High Performance Primitive Collections Realtime
(fork of HPPC of Carrotsearch)
Fundamental data structures (maps, sets, lists, stacks, queues, heaps, sorts) generated for
combinations of object and primitive types to conserve JVM memory and speed
up execution. The Realtime fork intend of extending collections while tweaking and optimizations to remove any dynamic allocations at runtime,
and low variance execution times.
Artifact hppcrt
Group com.github.vsonnier
Version 0.6.6
Last update 08. October 2014
Tags: dynamic combinations remove data runtime object execution while conserve times performance sets types optimizations primitive allocations collections lists fork speed heaps variance stacks memory structures tweaking realtime maps generated carrotsearch queues high fundamental intend sorts extending hppc
Organization not specified
URL Not specified
License not specified
Dependencies amount 0
Dependencies No dependencies
There are maybe transitive dependencies!
Group com.github.vsonnier
Version 0.6.6
Last update 08. October 2014
Tags: dynamic combinations remove data runtime object execution while conserve times performance sets types optimizations primitive allocations collections lists fork speed heaps variance stacks memory structures tweaking realtime maps generated carrotsearch queues high fundamental intend sorts extending hppc
Organization not specified
URL Not specified
License not specified
Dependencies amount 0
Dependencies No dependencies
There are maybe transitive dependencies!
hppcrt from group com.github.vsonnier (version 0.6.5)
High Performance Primitive Collections Realtime
(fork of HPPC of Carrotsearch)
Fundamental data structures (maps, sets, lists, stacks, queues, heaps, sorts) generated for
combinations of object and primitive types to conserve JVM memory and speed
up execution. The Realtime fork intend of extending collections while tweaking and optimizations to remove any dynamic allocations at runtime,
and low variance execution times.
Artifact hppcrt
Group com.github.vsonnier
Version 0.6.5
Last update 19. August 2014
Tags: dynamic combinations remove data runtime object execution while conserve times performance sets types optimizations primitive allocations collections lists fork speed heaps variance stacks memory structures tweaking realtime maps generated carrotsearch queues high fundamental intend sorts extending hppc
Organization not specified
URL Not specified
License not specified
Dependencies amount 0
Dependencies No dependencies
There are maybe transitive dependencies!
Group com.github.vsonnier
Version 0.6.5
Last update 19. August 2014
Tags: dynamic combinations remove data runtime object execution while conserve times performance sets types optimizations primitive allocations collections lists fork speed heaps variance stacks memory structures tweaking realtime maps generated carrotsearch queues high fundamental intend sorts extending hppc
Organization not specified
URL Not specified
License not specified
Dependencies amount 0
Dependencies No dependencies
There are maybe transitive dependencies!
Page 1 from 1 (items total 10)
© 2015 - 2024 Weber Informatics LLC | Privacy Policy