ThmapConcurrent trie-hash map library
Stars: ✭ 51 (+18.6%)
SirixSirixDB is a temporal, evolutionary database system, which uses an accumulate only approach. It keeps the full history of each resource. Every commit stores a space-efficient snapshot through structural sharing. It is log-structured and never overwrites data. SirixDB uses a novel page-level versioning approach called sliding snapshot.
Stars: ✭ 638 (+1383.72%)
MinperfA Minimal Perfect Hash Function Library
Stars: ✭ 107 (+148.84%)
Blake2fastOptimized BLAKE2 hashing implementations in C#
Stars: ✭ 63 (+46.51%)
Hash EmbeddingsPyTorch implementation of Hash Embeddings (NIPS 2017). Submission to the NIPS Implementation Challenge.
Stars: ✭ 126 (+193.02%)
Parallel XxhashCompute xxHash hash codes for 8 keys in parallel
Stars: ✭ 36 (-16.28%)
HashnetCode release for "HashNet: Deep Learning to Hash by Continuation" (ICCV 2017)
Stars: ✭ 192 (+346.51%)
Crypto HashTiny hashing module that uses the native crypto API in Node.js and the browser
Stars: ✭ 501 (+1065.12%)
EternalA C++14 compile-time/constexpr map and hash map with minimal binary footprint
Stars: ✭ 93 (+116.28%)
Scala HashingFast non-cryptographic hash functions for Scala
Stars: ✭ 66 (+53.49%)
CuckoofilterSubstitute for bloom filter.
Stars: ✭ 270 (+527.91%)
Wyhash Rswyhash fast portable non-cryptographic hashing algorithm and random number generator in Rust
Stars: ✭ 44 (+2.33%)
Deep MihashCode for papers "Hashing with Mutual Information" (TPAMI 2019) and "Hashing with Binary Matrix Pursuit" (ECCV 2018)
Stars: ✭ 13 (-69.77%)
Merkletreejs🌱 Construct Merkle Trees and verify proofs in JavaScript.
Stars: ✭ 238 (+453.49%)
Lazy importerlibrary for importing functions from dlls in a hidden, reverse engineer unfriendly way
Stars: ✭ 544 (+1165.12%)
EasycryptAndroid cryptography library with SecureRandom patches.
Stars: ✭ 102 (+137.21%)
C Sharp Algorithms📚 📈 Plug-and-play class-library project of standard Data Structures and Algorithms in C#
Stars: ✭ 4,684 (+10793.02%)
InterviewbitCollection of Abhishek Agrawal's gists solutions for problems on https://www.interviewbit.com
Stars: ✭ 166 (+286.05%)
T1haOne of the fastest hash functions
Stars: ✭ 302 (+602.33%)
MementoFairly basic redis-like hashmap implementation on top of a epoll TCP server.
Stars: ✭ 74 (+72.09%)
Lazysodium AndroidAn Android implementation of the Libsodium cryptography library. For the lazy dev.
Stars: ✭ 69 (+60.47%)
AhashaHash is a non-cryptographic hashing algorithm that uses the AES hardware instruction
Stars: ✭ 251 (+483.72%)
Auth AdtAuthenticated Data Structures Generically
Stars: ✭ 150 (+248.84%)
ClhashC library implementing the ridiculously fast CLHash hashing function
Stars: ✭ 220 (+411.63%)
String HashGet the hash of a string
Stars: ✭ 56 (+30.23%)
SketchySketching Algorithms for Clojure (bloom filter, min-hash, hyper-loglog, count-min sketch)
Stars: ✭ 138 (+220.93%)
Farmhash.sharpPort of Google's farmhash algorithm to .NET
Stars: ✭ 52 (+20.93%)
Argon2 JvmArgon2 Binding for the JVM
Stars: ✭ 245 (+469.77%)
Password4jPassword4j is a user-friendly cryptographic library that supports Argon2, Bcrypt, Scrypt, PBKDF2 and various cryptographic hash functions.
Stars: ✭ 124 (+188.37%)
Node Argon2Node.js bindings for Argon2 hashing algorithm
Stars: ✭ 1,008 (+2244.19%)
UtilA collection of useful utility functions
Stars: ✭ 201 (+367.44%)
RhashmapRobin Hood hash map library
Stars: ✭ 33 (-23.26%)
Java Competitive ProgrammingI have written some important Algorithms and Data Structures in an efficient way in Java with proper references to time and space complexity. These Pre-cooked and well-tested codes help to implement larger hackathon problems in lesser time. DFS, BFS, LCA, All Pair Shortest Path, Longest Common Subsequence, Binary Search, Lower Bound Search, Maximal Matching, Matrix Exponentiation, Segment Tree, Sparse Table, Merge Sort, Miller Prime Test, Prims - Minimum Spanning Tree, BIT - Binary Index Tree, Two Pointers, BST - Binary Search Tree, Maximum Subarray Sum, Immutable Data Structures, Persistent Data Structurs - Persistent Trie, Dijkstra, Z - Function, Minimum Cost Maximal Matching, Heavy Light Decomposition, Knapsack, Suffix Array and LCP - Longest Common Prefix, Squre Root Decomposition, Kth Order Statics, Trie / Prefix Tree, LIS - Longest Increasing Subsequence, Hashing
Stars: ✭ 24 (-44.19%)
randomgenNumpy-compatible bit generators and add some random variate distributions missing from NumPy.
Stars: ✭ 82 (+90.7%)
Xxhash cppPort of the xxhash library to C++17.
Stars: ✭ 106 (+146.51%)
Name That Hash🔗 Don't know what type of hash it is? Name That Hash will name that hash type! 🤖 Identify MD5, SHA256 and 3000+ other hashes ☄ Comes with a neat web app 🔥
Stars: ✭ 540 (+1155.81%)
ShokoserverRepository for Shoko Server.
Stars: ✭ 184 (+327.91%)
Upash🔒Unified API for password hashing algorithms
Stars: ✭ 484 (+1025.58%)
Dsh tensorflowimplemement of DEEP SUPERVISED HASHING FOR FAST IMAGE RETRIEVAL_CVPR2016
Stars: ✭ 97 (+125.58%)
DeephashAn Open-Source Package for Deep Learning to Hash (DeepHash)
Stars: ✭ 417 (+869.77%)
LibdictC library of key-value data structures.
Stars: ✭ 234 (+444.19%)
Imagededup😎 Finding duplicate images made easy!
Stars: ✭ 3,910 (+8993.02%)
WebcryptoW3C Web Cryptography API for Node.js
Stars: ✭ 79 (+83.72%)
Deephash PapersMust-read papers on deep learning to hash (DeepHash)
Stars: ✭ 302 (+602.33%)
CyberchefThe Cyber Swiss Army Knife - a web app for encryption, encoding, compression and data analysis
Stars: ✭ 13,674 (+31700%)
Md5 SimdAccelerate aggregated MD5 hashing performance up to 8x for AVX512 and 4x for AVX2. Useful for server applications that need to compute many MD5 sums in parallel.
Stars: ✭ 71 (+65.12%)
crc32cFast CRC-32-Castagnoli implementation in Rust
Stars: ✭ 26 (-39.53%)
DamiengkitUseful utility classes and helpers from DamienG.com
Stars: ✭ 221 (+413.95%)
DagonAdvanced Hash Manipulation
Stars: ✭ 155 (+260.47%)
SsriStandard Subresource Integrity library for Node.js
Stars: ✭ 69 (+60.47%)