keywords:partitioning

murmur2-partitioner

This JS-script calculates the partition based on a key and the amount of partitions for a JS Kafka producer in way consistent to the default Java Kafka client

vuza

published version 1.0.0, 8 years ago4 dependents licensed under $ISC

2,356

nehoid

Advanced unique ID generation utility with multi-layer encoding, collision detection, and context-aware features

nehonix_inc

published version 2.0.0, 10 days ago1 dependents licensed under $MIT

390

k-medoids

Implementation of the k-mediods clustering algorithm

stewart-r

published version 1.0.7, 2 years ago2 dependents licensed under $MIT

258

rehiver

Super-charge your S3 hive partitioned based file operations with intelligent pattern matching, change detection, optimized data-fetching, and out-of-the-box time series support.

tmikeladze

published version 1.1.0, 21 days ago0 dependents licensed under $MIT

71

ring-election

Leader and followers algorithm to make partitioning easy.

pioardi

published version 1.1.0, 5 years ago0 dependents licensed under $MIT

37

insulation

Lightweight package to prevent unwanted imports between TS or JS folders.

electrovir

published version 4.1.1, 3 years ago0 dependents licensed under $MIT

32

ldm-partition

Largest differencing method

overengineered

published version 1.0.0, 2 years ago0 dependents licensed under $MIT

23

number-partitioner

Gernerates partitions for positive interger (https://en.wikipedia.org/wiki/Partition_(number_theory))

restuta

published version 0.1.1, 9 years ago0 dependents licensed under $ISC

21

partman-wizard

This utility will help you with partitioning your tables in PostgreSQL databases

mateuszsokola

published version 0.0.2, 9 months ago0 dependents licensed under $MIT

19

aufteilung

Implements Karmarkar-Karp Least Differencing Method of number partitioning

jonasstr

published version 1.1.1, 3 years ago0 dependents licensed under $MIT

16

@bemoje/arr-partition-index

Linear-time Partitioning. Runtime: O(n). Chooses a pivot and re-arrages the array so that everything on the left is <= pivot and everything on the right is > pivot