Skip to content
#

b-tree

Here are 125 public repositories matching this topic...

GoDS (Go Data Structures). 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, Iterators, Enumerables, Sort, JSON

  • Updated Feb 19, 2022
  • Go
ecton
ecton commented Oct 16, 2021

Many times when reading data from disk, we read a length and immediately ask the OS to ensure a Vec can hold that much data, potentially resizing the Vec.

If there is an issue with the data on-disk, this could lead to attempting to allocate too much data. The subsequent read call will fail due to an EOF, if the allocation succeeds.

Before requesting a resize or reservation, we should check t

A library of cross platform C# data structures. Generic B-tree written in C#, which can be replaced with NoSQL database stored in the memory of discharge requirements in real-time (Firebase, Redis Cache, SAP HANA, Exadata, OLTP, etc.).

  • Updated May 2, 2017

🌲 A C++ implementation of all functionalities (insertion, deletion, search etc) of a 2-3 (two-three) Tree using Rotation, Split and Merge operations. (Please share if you find any bug in the code)

  • Updated Jan 17, 2021
  • C++

Improve this page

Add a description, image, and links to the b-tree topic page so that developers can more easily learn about it.

Curate this topic

Add this topic to your repo

To associate your repository with the b-tree topic, visit your repo's landing page and select "manage topics."

Learn more