Showing 9 open source projects for "hashmap"

View related business solutions
  • Ship Agents Faster Icon
    Ship Agents Faster

    Transform your applications and workflows into powerful agentic systems at global scale.

    Gemini Enterprise Agent Platform lets you rapidly build, scale, govern and optimize production-ready agents grounded in your organization's data. The platform enables developers to build custom or pre-built agents for virtually any use case. New customers get $300 in free credits.
    Get Started Free
  • Our Free Plans just got better! | Auth0 Icon
    Our Free Plans just got better! | Auth0

    With up to 25k MAUs and unlimited Okta connections, our Free Plan lets you focus on what you do best—building great apps.

    You 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.
    Try free now
  • 1
    DashMap

    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.
    Downloads: 0 This Week
    Last Update:
    See Project
  • 2
    go-datastructures

    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...
    Downloads: 0 This Week
    Last Update:
    See Project
  • 3
    hashmap

    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.
    Downloads: 0 This Week
    Last Update:
    See Project
  • 4
    Cyclops

    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). ...
    Downloads: 0 This Week
    Last Update:
    See Project
  • Enterprise-grade ITSM, for every business Icon
    Enterprise-grade ITSM, for every business

    Give your IT, operations, and business teams the ability to deliver exceptional services—without the complexity.

    Freshservice is an intuitive, AI-powered platform that helps IT, operations, and business teams deliver exceptional service without the usual complexity. Automate repetitive tasks, resolve issues faster, and provide seamless support across the organization. From managing incidents and assets to driving smarter decisions, Freshservice makes it easy to stay efficient and scale with confidence.
    Try it Free
  • 5
    GoDS

    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. ...
    Downloads: 0 This Week
    Last Update:
    See Project
  • 6
    sc

    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....
    Downloads: 0 This Week
    Last Update:
    See Project
  • 7
    SPARGEL

    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
    Downloads: 0 This Week
    Last Update:
    See Project
  • 8
    RoguePHP
    ...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
    Downloads: 0 This Week
    Last Update:
    See Project
  • 9
    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
    Downloads: 0 This Week
    Last Update:
    See Project
  • Full-stack observability with actually useful AI | Grafana Cloud Icon
    Full-stack observability with actually useful AI | Grafana Cloud

    Our generous forever free tier includes the full platform, including the AI Assistant, for 3 users with 10k metrics, 50GB logs, and 50GB traces.

    Built on open standards like Prometheus and OpenTelemetry, Grafana Cloud includes Kubernetes Monitoring, Application Observability, Incident Response, plus the AI-powered Grafana Assistant. Get started with our generous free tier today.
    Create free account
  • Previous
  • You're on page 1
  • Next
MongoDB Logo MongoDB