Search Results for "hashmap"
Sort By:
Showing 23 open source projects for "hashmap"
View related business solutions-
Our Free Plans just got better! | Auth0You asked, we delivered! Auth0 is excited to expand our Free and Paid plans to include more options so you can focus on building, deploying, and scaling applications without having to worry about your security. Auth0 now, thank yourself later.
-
Build Agents and Models on One PlatformGemini Enterprise Agent Platform is Google Cloud's comprehensive platform for developers to build, scale, govern, and optimize agents and models. Choose from Google's most advanced models and third-party models like Anthropic's Claude Model Family.
-
1
DashMap
Blazing fast concurrent HashMap for Rust
Blazingly fast concurrent map in Rust. DashMap is an implementation of a concurrent associative array/hashmap in Rust. DashMap tries to implement an easy-to-use API similar to std::collections::HashMap with some slight changes to handle concurrency. DashMap tries to be very simple to use and to be a direct replacement for RwLock<HashMap<K, V>>. To accomplish these goals, all methods take &self instead of modifying methods taking &mut self. -
2
Whirlwind
Ridiculously fast, fully asynchronous, sharded hashmap for Rust
Collection of thread-safe, asynchronous data structures. Whirlwind is a lightweight CSS framework focused on performance and simplicity, offering developers a minimal approach to styling web applications. -
3
DataScript
Immutable database and Datalog query engine for Clojure, ClojureScript
...You create a database on page load, put some data in it, track changes, do queries and forget about it when the user closes the page. DataScript databases are immutable and based on persistent data structures. In fact, they’re more like data structures than databases (think Hashmap). Unlike querying a real SQL DB, when you query DataScript, it all comes down to a Hashmap lookup. Or series of lookups. Or array iteration. There’s no particular overhead to it. You put a little data in it, it’s fast. You put in a lot of data, well, at least it has indexes. That should do better than you filtering an array by hand anyway. ... -
4
go-datastructures
A collection of useful, performant, and threadsafe Go datastructures
Go-datastructures is a collection of useful, performant, and threadsafe Go datastructures. Interval tree for collision in n-dimensional ranges. Implemented via a red-black augmented tree. Extra dimensions are handled in simultaneous inserts/queries to save space although this may result in suboptimal time complexity. Intersection determined using bit arrays. In a single dimension, inserts, deletes, and queries should be in O(log n) time. Bitarray used to detect existence without having to... -
AI-powered service management for IT and enterprise teamsGive your IT, operations, and business teams the ability to deliver exceptional services—without the complexity. Maximize operational efficiency with refreshingly simple, AI-powered Freshservice.
-
5
Class-Hashmap
Class Hashmap Code
This implementation uses a simple hash function that takes the modulus of the hash value with the size of the hashmap to get the index of the bucket where the key-value pair should be stored. It handles collisions by using a linked list to store multiple key-value pairs in the same bucket. The add method takes a key-value pair and adds it to the hashmap. If the bucket at the index returned by the hash function is empty, it creates a new linked list with the key-value pair. ... -
6
hashmap
A Golang lock-free thread-safe HashMap optimized for fastest access
A Golang lock-free thread-safe HashMap optimized for fastest read access. It is not a general-use HashMap and currently has slow write performance for write-heavy use. The minimal supported Golang version is 1.19 as it makes use of Generics and the new atomic package helpers. Reading from the hash map for numeric key types in a thread-safe way is faster than reading from a standard Golang map in an unsafe way and four times faster than Golang's sync.Map. -
7
Redix
A very simple pure key => value storage system that speaks Redis
redix is a very simple key => value storage engine that speaks redis and even more simpler and flexible. redis is very simple, sometimes we abuse it, so I decided to build a pure key-value storage system that introduces the core utilities for building any data structure you want based on the key => value model that is because I think that everything could be modeled easily using that model, so I decided to not to follow redis and all of its commands, you won’t find lpush, hset, sadd, … etc you will find a new way to do the same job but more easier and flexable, i.e, the well-known hset key field value command could be replaced with set key/field value, but sometimes you need to return a specific hashmap as key => value, but you run hget key field to get the key’s value and also it could be replaced with get key/field, but how could we replace hgetall key? I will say “it is easy”, let’s make the hget command work as a prefix scanner that scan the whole database. -
8
Cyclops
An advanced platform for writing functional applications in Java 8
Fast purely functional datastructures (Vector, Seq / List, LazySeq / LazyList, NonEmptyList, HashSet, TreeSet, TrieSet, HashMap, LinkedMap, MultiMap, TreeMap, BankersQueue, LazyString, Discrete Interval Encoded Tree, Zipper, Range, Tree, DifferenceList, HList, Dependent Map). Structural Pattern Matching API (deconstruct algebraic product and sum types). Improved type safety via the removal of unsafe APIs -- E.g. Unlike Optional, Option has no get method (which could throw a null pointer) -- New data structures do not support operations that would throw exceptions (you can't call head on an empty list for example). ... -
9
GoDS
Implementation of various data structures and algorithms in Go
...It provides a wide variety of containers (Sets, Lists, Stacks, Maps, Trees), sets (HashSet, TreeSet, LinkedHashSet), lists (ArrayList, SinglyLinkedList, DoublyLinkedList), stacks (LinkedListStack, ArrayStack), maps (HashMap, TreeMap, HashBidiMap, TreeBidiMap, LinkedHashMap), trees (RedBlackTree, AVLTree, BTree, BinaryHeap), comparators, and iterators. Containers are either ordered or unordered. All ordered containers provide stateful iterators and some of them allow enumerable functions. A list is a data structure that stores values and may have repeated values. ... -
Custom VMs From 1 to 96 vCPUs With 99.95% UptimeLive migration and automatic failover keep workloads online through maintenance. One free e2-micro VM every month.
-
10
sc
Common libraries and data structures for C
Portable, stand-alone C libraries and data structures. Each folder is stand-alone with a single header/source pair in it. There is no build for libraries, just copy files you want. e.g If you want the logger, copy sc_log.h and sc_log.c to your project. High performance & minimal memory usage. Portability between many operating systems and architectures. Tests with 100% branch coverage and multiple sanitizers. Drag & drop source code distribution. There is 100% branch coverage on Linux.... -
11
SSDB
A fast NoSQL database, an alternative to Redis
SSDB is a high performace key-value(key-string, key-zset, key-hashmap) NoSQL database, an alternative to Redis. SSDB is stable, production-ready and is widely used by many Internet companies including QIHU 360. LevelDB client-server support, written in C/C++. Designed to store collection data. Persistent key-value, key-zset, key-map('hashmap'), key-list storage. Redis clients are supported. Client API supports including C++, PHP, Python, Cpy, Java, nodejs, Ruby, Go(see all). ... -
12
jsbeans stands for "javascript beans". Each jsbean is indipendent, so you can use just the one you need. Some jsbeans: javascript HashMap, form's Validator, javascript Iterator, SmartInsert (for input's completion), javascript RSS reader ...
-
13
x.mq
Java message queue
'message queue' hecho en java (basado en una de mis plantillas para servidores e invirtiendo 3 tardes, literalmente) y almacenando todos los mensajes en memoria (HashMap + CopyOnWriteArrayList). -
14
Joove
best way to script java code
This is a lightweight library all in one file that has the spirit of Guava or ApacheCommons namely to write Java code more readable and less formal constraints This library and centered on a class "var" that is unique type for the management of lists HashMap tightens or other types of data through simple manipulations can be traced between them (eg. A string becomes an array after a split etc .. .). Here we will have a "var" that contains a string remains a "var" that contains an array so the programmer does not have to worry to optimize the process or make converioni to treat the data later With this library is approaching to a typical Java scripting language, though not in the manner of Groovy ie with the introduction of an alternative language but simply board using java native but with mini wrapper to its usefulness. -
15
Absolute Xml Framework for Java
A simple but very sophisticated XML solution for the Java developer
...Simplifying common Java XML coding using a rather sophisticated framework. This project is delivered as a JAR file You can find elements with XPATH statements A method provided that accepts a HashMap and adds this content to your xml. Two sample classes provided that give examples how to create different formats of XML even one with name value pairs A sample Netbeans Project is provided to provide sample code. A JavaDoc provides details of the methods exposed in the project We are busy writing a user manual to allow you to make your own XML format and manage it with the -
16
SPARGEL
An opensource Java graph library. Abandoned, ignore.
...This is achieved by extending graphs via properties in form of vertice and edge maps. Because these maps are an individual implementation depending on the graph datastructure used, they are more memory efficient than using a Java HashMap. Currently spargel is in its early stages, but will soon support more tasks. As now, implemented are: * Adjecency graph data structures * Algorithms: SSSP, APSP, Traversal, Min-Cut, Max-Flow, Many types of finding Components * Creating sub graphs, vertice and edge maps that use a function to implement their mapping. Spargel is released under GPLv3 -
17
I took a fork and ported to Lazarus The Delphi Containers library. I called it Containers library for Lazarus. DCL is a free library that provides ArrayList, LinkedList, Vector, HashMap, HashSet, ArraySet, Queue and Stack structures to Delphi/Kylix.It also provides algorithms like in STL (Apply, Found, CountObject, Copy, Generate, Fill, Reverse, Sort...).
-
18
Mvc Infraestructure
Serializable Data Transfer Object/Generic Dao for J2EE
Dto.java and others classes - for data transmission from/to view (with EL - Expression Language" ) layer to/from business and persistence layer in J2EE application. Dto extends from HashMap class of Java API for encapsulate any type of information by key type:key_i.key_ij.key_ijk....: Any component in any J2EE functional chain can access to DTO if they know the key key_i.key_ij.key_ijk.... for object access. This project helps to decouple the data, business logic and persistence logic allowing portability between different frameworks gently. -
19
...Basic Log4J style logging with detailed log formatters. Basic internationalization support with tight view integration. Simple Java style Collections (ArrayList, HashMap), Observers and reusable Constraint system. MySQL DB support with detailed query profiling and local / distributed cache support. Very fast abstraction layer and easy to integrate on any project. Includes Network cache locking. video tutorials: http://www.youtube.com/user/foneyop/videos
-
20
This library mocks the Java's Collections Framework. A total of 7 classes(ArrayList, HashMap, HashSet, TreeMap, TreeSet, LinkedHashMap, LinkedHashSet) are available. Organize your JavaScript data in a faster and efficient manner.
-
21
Phrame is a web development platform for PHP based on the design of Jakarta Struts. Phrame provides your basic Model-View-Controller architecture, and also takes a step further adding standard components such as: HashMap, ArrayList, Stack, etc...
-
22
DCLX is a free library that provides ArrayList, LinkedList, Vector, HashMap, HashSet, ArraySet, Queue and Stack structures to Delphi/Kylix. It also provides algorithms like in STL (Apply, Found, CountObject, Copy, Generate, Fill, Reverse, Sort...).
-
23
This MEGA ALPHA project (CURRENTLY) provides java tools for : XML file to org.w3c.dom.Document, Document to HashMap (recursive), HashMap to Document (recursive), Document to File or String, Document to XSLT to File or String
- Previous
- You're on page 1
- Next
