Search Results for "hash data"
Sort By:
Showing 16 open source projects for "hash data"
View related business solutions-
Ship Agents FasterGemini 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.
-
Cut Data Warehouse Costs by 54%BigQuery delivers 54% lower TCO with exabyte scale and flexible pricing. Free migration tools handle the SQL translation automatically.
-
1
Algorithms & data structures project
A collection of algorithms and data structures
Algorithms is an educational collection of data structures and algorithms implemented primarily in Java. Its goal is to demonstrate common techniques through clear and elegant reference implementations. The repository covers trees, heaps, hash tables, graphs, dynamic programming, geometry, searching, sorting, strings, and many other topics. Complexity information is documented for many algorithms to help users understand performance characteristics. -
2
spaCy
Industrial-strength Natural Language Processing (NLP)
spaCy is a library built on the very latest research for advanced Natural Language Processing (NLP) in Python and Cython. Since its inception it was designed to be used for real world applications-- for building real products and gathering real insights. It comes with pretrained statistical models and word vectors, convolutional neural network models, easy deep learning integration and so much more. spaCy is the fastest syntactic parser in the world according to independent benchmarks, with... -
3
PSR-7
PSR-7 HTTP message library
This repository contains a full PSR-7 message implementation, several stream decorators, and some helpful functionality like query string parsing. This package comes with a number of stream implementations and stream decorators. Reads from multiple streams, one after the other. Provides a buffer stream that can be written to fill a buffer, and read from to remove bytes from the buffer. This stream returns a "hwm" metadata value that tells upstream consumers what the configured high water... -
4
The Generic Data Structures Library (GDSL) is a collection of routines for generic data structures manipulation. It is a portable and re-entrant library fully written from scratch in pure ANSI C. It is designed to offer for C programmers common data structures with powerful algorithms, and hidden implementation. Available structures are lists, queues, stacks, hash tables, binary trees, binary search trees, red-black trees, 2D arrays, permutations, heaps and interval heaps. ...
-
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.
-
5
Dynamic Arrays and Hashes (Delphi, C++)
Incredibly fast Dynamic Arrays classes written in Delphi and C++
(New version 1.05 is released) Dynamic Arrays is a set of useful incredibly fast classes for data manipulating in memory. Flexible memory control, functionality that standard containers do not have, fast operations (assembler implementation for x86 and x64 platforms). Available for Delphi all latest versions and for C++. Powerful Hash and Double Hash classes to work with pairs of values (key and value) and with values that have two keys (key1, key2, value). ... -
6
BTree implementation for Go
BTree provides a simple, ordered, in-memory data structure for Go
This package is a high-performance, in-memory B-tree for Go that implements an ordered set/map with efficient insert, delete, and range iteration. It’s parameterized by tree degree so callers can tune cache behavior and memory overhead for their workload. Instead of relying on Go’s built-in maps—which are hash-based and unordered—btree preserves sorted order and provides rich traversal APIs like ascending, descending, and range scans. The implementation favors minimal allocations and... -
7
cppcrypto
C++ cryptographic library (modern hash functions, ciphers, KDFs)
cppcrypto provides optimized implementations of cryptographic primitives. Hash functions: BLAKE, BLAKE2, Echo, Esch, Groestl, JH, Kupyna, MD5, SHA-1, SHA-2, SHA-3, SHAKE, Skein, SM3, Streebog, Whirlpool. Block ciphers: Anubis, Aria, Camellia, CAST-256, Kalyna, Kuznyechik, Mars, Serpent, Simon, SM4, Speck, Threefish, Twofish, and Rijndael (AES) with all block/key sizes. Stream ciphers: HC-128, HC-256, Salsa20, XSalsa20, ChaCha, XChaCha. Encryption modes: CBC, CTR. AEAD modes:... -
8
CityHash
Automatically exported from Google code CityHash
...The library emphasizes hashing performance and uniformity rather than cryptographic security, making it ideal for use in data structures like hash tables and distributed systems requiring rapid key lookups. CityHash has been rigorously tested using tools like SMHasher to ensure high-quality mixing and collision resistance across a wide range of inputs. Its speed and portability have made it a popular choice for developers needing dependable, lightweight hash functions. -
9
StructPie
A set of C libraries to implement data structures and algorithms
...In the "hash_table" directory, the hash table implementation uses linked lists. While in "HashBSTree" directory, a hash table with a binary tree in each index is implemented for faster lookup in large data. The stack, the tree and the hash table accept int, float and char* data type To look at the python library : https://github.com/mnoorfawi/struct-pie -
$300 Free Credits to Build on Google CloudPut your $300 in credit toward real workloads, then keep building with free monthly usage for 20+ products. No commitment and no charge until you upgrade.
-
10
algo
50 Code Implementations You Must Know About Data Structures
algo is an educational repository containing practical implementations of essential data structures and algorithms. It organizes roughly fifty core exercises by topic rather than presenting a single reusable software library. The material covers arrays, linked lists, stacks, queues, recursion, sorting, binary search, hash tables, strings, trees, heaps, and graphs. More advanced examples address backtracking, divide-and-conquer methods, dynamic programming, shortest paths, topological sorting, caches, and priority queues. ... -
11
Essentials
General purpose utilities and hash functions for Android and Java
Essentials is a lightweight collection of high-performance utility classes designed to enhance standard Java and Android development without introducing heavy dependencies. The library focuses on providing efficient data structures and helper utilities that often outperform equivalent components in the standard Java API. It is intentionally minimalistic and is not positioned as a full framework, but rather as a focused toolkit that fills common gaps developers encounter in everyday projects.... -
12
ssbc
Hand-torn wrapped vegetables website
ssbc is the source code repository for the Shousibaocai website, a Chinese project focused on DHT, torrent, magnet, and search engine technology. The project was open-sourced to support technical exchange and learning around distributed hash table crawling and search applications. Its history includes earlier Django-based work and a later Node.js rewrite. The repository includes crawler-related code under a spider directory, reflecting its emphasis on collecting and indexing distributed network data. It is more of a website and search technology project than a reusable library. ... -
13
ftdetector
File type detector library
This project is a tool to detect file types by signatures and mime types. It uses hash tables to make the detection of a file type as fast as possible. The signature and mime types lists are stored at simple user-friendly files. This file type detector supports a lot of formats (image, archive, text, documents, audio, video, fonts and others). It also includes Microsoft OLE compound file types. The detector's algorythm has special features to detect text file types like (HTML, XML, JSON,... -
14
sjcl
Stanford Javascript Crypto Library
The Stanford Javascript Crypto Library is a project by the Stanford Computer Security Lab to build a secure, powerful, fast, small, easy-to-use, cross-browser library for cryptography in Javascript. SJCL is small but powerful. The minified version of the library is under 6.4KB compressed, and yet it posts impressive speed results. SJCL is secure. It uses the industry-standard AES algorithm at 128, 192 or 256 bits; the SHA256 hash function; the HMAC authentication code; the PBKDF2 password... -
15
QDAC3.0
QDAC 3.0 is a VCL & FMX data access component
[IMPORTANT NOTICE] This project is moved to my self website.The new SVN urls : svn://www.qdac.cc/QDAC3 GIT url is: git://www.qdac.cc/QDAC3.git Please check out with the new urls. QDAC 3.0 is a new version of Quick Data Access Component.Compare with version 2,the new version is base on XE6 and support all OS with XE6:Win32/Win64/Mac OSX/iOS/Andriod. QDAC 3.0 Include follow sub components: QXml/QJson/QLog/QWorker/QSort/QExp/QDB etc. QDAC now is in progress. Follow is from QDAC... -
16
Immutable Collections for Java
Immutable/Persistent Collections Library
...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, and hash and tree based sets, and sparse arrays. All collections provide immutable Cursor as well as standard Iterator classes for looping through all elements. A utility class provides functional style algorithmic processing of Cursors including foldLeft, foldRight, collect, select, and reject. The 2-3 tree and integer trie classes are optimized for performance and can be used alongside java.util Collections when immutability is needed for safe data sharing.
- Previous
- You're on page 1
- Next