bloomf

Simple Bloom Filter implmentation in Python


Keywords
data-structures, karumanchi
License
GPL-3.0
Install
pip install bloomf==0.3

Documentation

karumanchi

DS Problems from karumanchi

Latest Update

Push v0.1.15

Pathway

How do I find stuff in this repo?

Guide to run the C++ Algorithms

  • Clone this repo
  • Install MinGW on Windows and g++ on macOS & Unix-like.
  • Compile and run using:
$ g++ <FILENAME.cpp> -o <OUTPUT-BINARY-NAME>
$ "OUTPUT-BINARY-NAME" # on windows cmd (using "")
$ ./OUTPUT-BINARY-NAME # on macOS and Unix-like

Adding following flags in optional and depends on the users thugh are sugegsted to be used while developing-compiling locally:

  • -g - turn on debugging (so GDB gives more friendly output)
  • -Wall - turns on most warnings
  • -O or -O2 - turn on optimizations
  • -o <name> - name of the output file
  • -c - output an object file (.o)
  • -I<include path> - specify an include directory
  • -L<library path> - specify a lib directory
  • -l<library> - link with library lib.a

However, it is suggested that you use first, second, third and fourth (while compiling source files) for best results and local development.

Guide to run the JS Algorithms

  • Install Node.js
  • Clone this repo
  • Open the package.json file to find the appropriate command under scripts tag.
  • Run in a terminal in following fashion:
$ npm run <TAG-NAME-INSIDE-SCRIPTS>

# ex: to run stack.js in chapter 4
$ npm run stack

# OR, run directly via node
$ node js/stack.js

NOTE: Langauge formatting done automatically using VS Code IntelliSense. Better suggestions are welcome!

Directory Tree

Generated in Windows 10 using tree /F command in cmd //C tree terminal.

.
│   .babelrc
│   .editorconfig
│   .eslintignore
│   .eslintrc.json
│   .gitignore
│   .npmignore
│   .travis.yml
│   CMakeLists.txt
│   LICENSE
│   Makefile
│   package-lock.json
│   package.json
│   README.md
│
├───.vscode
│       compile_commands.json
│       c_cpp_properties.json
│       settings.json
│
├───bloom-filter
│   │   readme.md
│   │   requirements.txt
│   │   setup.py
│   │
│   ├───bloomf
│   │       main.py
│   │       test.py
│   │       __init__.py
│   │
│   └───dist
│          bloomf-0.1-py3-none-any.whl
│          bloomf-0.1.tar.gz
│          bloomf-0.2-py3-none-any.whl
│          bloomf-0.2.tar.gz
│
├───codechef
│   │   codechef.hpp
│   │   readme.md
│   │
│   └───arrays
│           CHN15A.cpp
│           CNOTE.cpp
│           COPS.cpp
│           FRGTNLNG.cpp
│           LECANDY.cpp
│           RAINBOWA.cpp
│           SALARY.cpp
│
├───codeforces
│       readme.md
│
├───external-sorting
│   │   kway.cpp
│   │   kwaymergesort.hpp
│   │
│   └───gfg
│           0
│           1
│           2
│           3
│           4
│           5
│           6
│           7
│           8
│           9
│           gfg.cpp
│           input.txt
│           output.txt
│
├───js
│       priority-queue.js
│       queue.js
│       readme.md
│       set.js
│       stack.js
│
├───main
│   │   headers.hpp
│   │
│   ├───ch1-introduction
│   │       readme.md
│   │
│   ├───ch2-recursion-and-backtracking
│   │       check-sorting-recursion.cpp
│   │       n-ary-strings.cpp
│   │       readme.md
│   │       tower-of-hanoi.cpp
│   │
│   ├───ch3-linked-lists
│   │       cycle.cpp
│   │       fractional-node.cpp
│   │       merge.cpp
│   │       nth-element-from-end.cpp
│   │       pairwise-reverse.cpp
│   │       palindrome.cpp
│   │       readme.md
│   │       reverse-kth.cpp
│   │       reverse-sll.cpp
│   │       sort.cpp
│   │       split-cll.cpp
│   │
│   ├───ch4-stacks
│   │       adjacentBigger.cpp
│   │       adjacentRepeat.cpp
│   │       growth.cpp
│   │       infix-to-postfix.cpp
│   │       postfix.cpp
│   │       readme.md
│   │       reverse.cpp
│   │       span.cpp
│   │       stack.cpp
│   │       symbol-parser.cpp
│   │
│   ├───ch5-queues
│   │       linked-list-queue.cpp
│   │       readme.md
│   │       simple-queue.cpp
│   │
│   ├───ch6-trees
│   │       array2bst.cpp
│   │       bst2dll.cpp
│   │       check-bst.cpp
│   │       count-tree.cpp
│   │       dll2bst.cpp
│   │       expression-tree.cpp
│   │       find-max.cpp
│   │       inorder-sucessor.cpp
│   │       kth-smallest.cpp
│   │       preorder-sucessor.cpp
│   │       ranger.cpp
│   │       readme.md
│   │       readme.txt
│   │       reverse-lca.cpp
│   │       threaded-tree.cpp
│   │       threaded-tree.txt
│   │
│   ├───ch7-priority-queues
│   │       fimd-max-in-min-heap.cpp
│   │       find-k.cpp
│   │       heap-sort.cpp
│   │       heap.hpp
│   │       median.cpp
│   │       pq.hpp
│   │       readme.md
│   │       stack.cpp
│   │
│   ├───ch8-disjoint-sets
│   │       adt.hpp
│   │       cities.cpp
│   │       readme.md
│   │
│   ├───ch10-sorting
│   │       bucket.cpp
│   │       check-repeat.cpp
│   │       counting.cpp
│   │       election.cpp
│   │       flagged-bubble.cpp
│   │       insertion.cpp
│   │       max.cpp
│   │       merge.cpp
│   │       mergeAB.cpp
│   │       quick.cpp
│   │       readme.md
│   │       shell.cpp
│   │       sort.hpp
│   │
│   ├───ch12-selection-algorithms
│   │       kth-smallest-2.cpp
│   │       kth-smallest.cpp
│   │       merge.cpp
│   │       readme.md
│   │
│   ├───ch13-symbol-tables
│   │       readme.md
│   │
│   ├───ch14-hashing
│   │       array-matching.cpp
│   │       delete-array.cpp
│   │       find-pairs.cpp
│   │       first-non-repeat.cpp
│   │       first-repeat.cpp
│   │       hash-pairs.cpp
│   │       readme.md
│   │       remove-duplicates.cpp
│   │       seperate-chaining.hpp
│   │       two-arrays.cpp
│   │
│   └───includes
│           cll.hpp
│           dll.hpp
│           queue.hpp
│           sll.hpp
│           stack.hpp
│           tree.hpp
│
├───misc
│       sparse-set.cpp
│       sparse-set.hpp
│
├───spoj
│       readme.md
│
├───src
│       commit.js
│       deploy.js
│       index.js
│       push.js
│
├───stl
│        stl.hpp
│
└───test
        index.js

License

© 2018 Sambhav Jain under GPL-v3.0