Search Results for "random map"

.... A template in the form of $(variable) can be set in log_group_name or log_stream_name. variable can be a map key name in the log message. To access sub-values in the map use the form $(variable['subkey']). Also, it can be replaced with special values to insert the tag, ECS metadata, or a random string in the name. It can achieve higher throughput and will consume less CPU and memory.

Helps to develop and test event-based multi-threaded Java application. Because of method called as API-Evolution the Happy Java Library is fully downward compatible. The library contains following functionality: MultiLock, Parallel loops, Collections, Controllers, Generators, Delegates, Streams.

... the test suite from GCC for unordered_map. Which this map passes. Some bench: == 1 million int pushes == *open address: 275.852 ms *reserved openaddr: 110.268 ms std unordered: 277.544 ms == 100k random erasures == *openaddr: 8.70804 ms std unordered: 20.6305 ms == 1M iteration == *openaddr: 185.528 ms std unordered: 1010.53 ms == 50k finds in 1M == *openaddr: 4.24 ms std unordered: 10.44 ms

A very lightweight advanced terrain-rendering and 3D map rendering system. Minimal dependencies: OpenGL, SDL. It's distrib in 2-3 separate modules: 1. the C++ implementation of the terrain- and/or surface- rendering Algorithms I have developed: both a multithread and a non-multithread variant is relaeased. 2. Seme as at point 1. , but with a road-network rendering and collision-detection module I wrote before. It also adds some trees at the top of the terrain. (multitread vesion...

Library providing immutable/persistent collection classes for Java. While collections are immutable they provide methods for adding and removing values by creating new modified copies of themselves. Each copy shares as much as possible of its structure with other copies to minimize memory consumption. The library includes a singly linked (cons/cddr style) list/stack, an integer trie based indexed list, a 2-3 tree based random access indexed list, a 2-3 tree based map, a hash trie based map...

FlexGen is a flexible random map generation library for games and simulations. Maps are generated by randomly laying down map tiles so that their edges match. You can define map tiles however you want to determine what type of map is created.

Tool for testing Web Map Services. It allows to run general random tests of WMS and test based on user-like behaviour.

20 SkipList containers for C++ that work with STL. Combines set/map functionality with random access in logn time. One container is a multilist where you can order the same elements in a variety of different ways simultaneously.

Concurrent hash map and linked list implementation of the ConcurrentMap interface, with predictable iteration order. This implementation differs from ConcurrentHashMap in that it maintains a doubly-linked list running through all of its entries.

Random Java utility classes 1. Prefix Trie based data structure 2. An indexed map (indexed by keys or values). 3. Main class that provides start/stop functionality for standalone apps. 4. File io api's based based on callback design.