brpandey/interval_tree brpandey/interval_tree

  • Stars
    star
    11
  • Rank 1,694,829 (Top 34 %)
  • Language
    Elixir
  • License
    MIT License
  • Created over 7 years ago
  • Updated almost 7 years ago
Twitter logo Share LinkedIn logo Share Facebook logo Share
brpandey/interval_tree
github

brpandey

Reviews

There are no reviews yet. Be the first to send feedback to the community and the maintainers!

Repository Details

Interval tree with self-balancing AVL tree

More Repositories

1

merkel

A dynamic, merkle binary hash tree
Elixir
17
star
2

hangman

Plays hangman word games using Elixir/Erlang OTP. Supports parallel play using CPU cores concurrently.
Elixir
3
star
3

piranha

Tour boat booking application using Maru web framework and Erlang Mnesia
Elixir
3
star
4

snowflake

Distributed system to generate unique 64 bit integer ids in Elixir using the original Twitter Snowflake algorithm
Elixir
3
star
5

basic_paxos

Implements Basic-Paxos consensus algorithm with tests
Elixir
2
star
6

neuron_dance

Simple deep learning API for implementing neural nets written in Rust with Dense Layers, CSV and MNIST dataset types, L2 regularization and Adam Optimizer and common activation functions like Relu, Sigmoid, Softmax, Tanh. Only uses ndarray for linear algebra functionality
Rust
2
star
7

lru_cache

Simple cache providing least recently used cache entry ejection when cache becomes full. Uses gb_trees as priority queue
Elixir
1
star
8

chat

Text chat using Tokio with various locks and message channels. Modes are client/server broadcast and peer<-->peer. Uses TCP
Rust
1
star
9

paint_picker_with_channels

Fun little web app that uses Elm to select paint cans over Phoenix web socket channels and stores selections in the DB
Elm
1
star
10

radix_trie

A simple space-optimized trie written in Rust
Rust
1
star