Search Results for "random map"

smallpond is a lightweight distributed data processing framework built by DeepSeek, designed to scale DuckDB workloads over clusters using their 3FS (Fire-Flyer File System) backend. The idea is to preserve DuckDB’s fast analytics engine but lift it from single-node to multi-node settings, giving you the ability to operate on large datasets (e.g. petabyte scale) without moving to a heavyweight system like Spark. Users write Python-like code (via DataFrame APIs or SQL strings) to express...

...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 not...

oriDomi is a JavaScript library that visually "folds" DOM elements like paper, creating origami-style transitions using CSS transforms and JavaScript. Use your mouse or touch to manipulate the images on the website, or press the fold button to see a random effect. Create an OriDomi instance by passing your target element to the constructor. When creating a new OriDomi composition, you can pass a map of options as the second argument.

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.

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.