3 مستودعات
Priority queues with a fixed maximum capacity that automatically eject lowest-priority elements.
Distinct from Priority Queues: Focuses on the capacity-limiting and ejection logic of bounded queues versus unbounded priority queues.
Explore 3 awesome GitHub repositories matching software engineering & architecture · Bounded. Refine with filters or upvote what's useful.
This project is a comprehensive collection of common computer science algorithms and data structures implemented in Swift. It serves as an educational reference and library for studying computational complexity, algorithmic logic, and data structure engineering through practical code examples. The repository provides a wide suite of data structure implementations, including various types of linked lists, heaps, hash tables, and an extensive range of hierarchical trees such as Red-Black, B-Tree, and Splay trees. It also covers diverse sorting and searching techniques, from basic bubble sort to
A priority queue that stores a fixed number of elements and ejects the lowest priority item when full.
Chance is a JavaScript library for generating random data, designed to produce realistic test data for automated tests and prototypes. It uses a Mersenne Twister pseudo-random number generator that accepts an optional seed value, enabling reproducible sequences of random values across multiple runs. The library provides a wide range of generators for common data types, including random integers, floats, booleans, characters, strings, and dates, all with configurable ranges and character pools. It can generate realistic geographic data like addresses, as well as financial data such as credit c
Produces random numbers within inclusive minimum and maximum bounds for integers, floats, and primes.
Just is a collection of JavaScript utility libraries designed for data manipulation, functional programming, performance optimization, statistical analysis, and string processing. It provides a set of tools for deep cloning, filtering, and transforming complex objects and arrays. The project is structured as a series of zero-dependency modules, allowing utilities to be used independently to minimize bundle size. It implements functional programming patterns including currying, piping, and partial application, and provides execution control through memoization, debouncing, and throttling. The
Provides utilities to generate random integers within specified inclusive minimum and maximum bounds.