Search Results for "integer set library"
Sort By:
33 projects for "integer set library" with 2 filters applied:
-
$300 Free Credits for Your Google Cloud ProjectsLaunch your next project with $300 in free Google Cloud credits—no strings attached. Test, build, and deploy without risk. Use your credits across the entire Google Cloud platform to find what works best for your needs. After your credits are used, continue with always-free tier services. Only pay when you're ready to scale. Sign up in minutes and start exploring.
-
Ship Agents FasterGemini Enterprise Agent Platform lets you rapidly build, scale, govern and optimize production-ready agents grounded in your organization's data. The platform enables developers to build custom or pre-built agents for virtually any use case. New customers get $300 in free credits.
-
1
YAPF
A formatter for Python files
YAPF is a Python code formatter that automatically rewrites source to match a chosen style, using a clang-format–inspired algorithm to search for the “best” layout under your rules. Instead of relying on a fixed set of heuristics, it explores formatting decisions and chooses the lowest-cost result, aiming to produce code a human would write when following a style guide. You can run it as a command-line tool or call it as a library via FormatCode / FormatFile, making it easy to embed in editors, CI, and custom tooling. Styles are highly configurable: start from presets like pep8, google, yapf, or facebook, then override dozens of options in .style.yapf, setup.cfg, or pyproject.toml. ... -
2
CountBitsSet
minimal benchmark code for Counting Set Bits (ones) in an Integer
I was curious how much better the Algorithms, pointed out by BitTwiddling Hacks, perform than a simple Lookup Table approach... Now I think, perhaps my little investigation is interesting for others too... PS: the parallel counting Algo is about 35% faster on average on my computers than a simple LUT based solution. Also this shows nicely how different a human brain compatible solution is to a binary machine optimal solution :-) In the meantime I added other Algorithms beside... -
3
lpsolve
Mixed Integer Linear Programming (MILP) solver.
Mixed Integer Linear Programming (MILP) solver lp_solve solves pure linear, (mixed) integer/binary, semi-cont and special ordered sets (SOS) models.lp_solve is written in ANSI C and can be compiled on many different platforms like Linux and WINDOWS This project is moved to github: https://lp-solve.github.io/ -
4
libtdata
Libtdata is a C library implements trees, index allocation and bit ops
Libtdata is a small and portable C library implements a set of various search data structures, bit operations and index allocation. -
Secure File Transfer for Windows with Cerberus by RedwoodCerberus supports unlimited users and connections on a single IP, with built-in encryption, 2FA, and a browser-based web client — all deployable in under 15 minutes with a 25-day free trial.
-
5
NOMAD is a C++ code that implements the MADS algorithm (Mesh Adaptive Direct Search) for difficult blackbox optimization problems. Such problems occur when the functions to optimize are costly computer simulations with no derivatives.
-
6
Javascript Clipper
Boolean operations and offsetting library in Javascript
The Javascript Clipper library performs clipping and offsetting for both lines and polygons. All four boolean clipping operations are supported - intersection, union, difference and exclusive-or. Polygons can be of any shape including self-intersecting polygons. Javascript Clipper is a port of Angus Johnson's Clipper library: https://sourceforge.net/projects/polyclipping LIVE DEMO: http://jsclipper.sourceforge.net/6.4.2.2/main_demo.html LIVE DEMO... -
7
Opt4J
Modular Java framework for meta-heuristic optimization
Opt4J is an open source Java-based framework for evolutionary computation. It contains a set of (multi-objective) optimization algorithms such as evolutionary algorithms (including SPEA2 and NSGA2), differential evolution, particle swarm optimization, and simulated annealing. The benchmarks that are included comprise ZDT, DTLZ, WFG, and the knapsack problem. The goal of Opt4J is to simplify the evolutionary optimization of user-defined problems as well as the implementation of arbitrary... -
8
Bat2015
Bachelor of Science (Informatik)
...With a focus on the MILP methods we implement a load balancing and speed up the solving process in a multiplicative way. Sometimes we have super-linear speedup with a small set of hardware. With a splitting of problems, parallel computing and distributing the actual best solution to all running processes we solve CBP much faster than a sequential processing can do. -
9
New Terrain and 3D Map System
a very lightweight advanced terrain-rendering and 3D map rendering sys
A very lightweight advanced terrain-rendering and 3D map rendering system. Minimal dependencies: OpenGL, SDL. It's distrib in 2-3 separate modules: 1. the C++ implementation of the terrain- and/or surface- rendering Algorithms I have developed: both a multithread and a non-multithread variant is relaeased. 2. Seme as at point 1. , but with a road-network rendering and collision-detection module I wrote before. It also adds some trees at the top of the terrain. (multitread vesion not... -
Stop vibe-debugging.AppSignal's MCP server hands Claude, Cursor, or Zed your real errors, traces, and the deploy that shipped them. AI writes the fix; you review the diff.
-
10
Javascript-Voronoi
JS implementation of Fortune's algorithm to compute Voronoi cells
This repository implements Steven Fortune’s algorithm (sweep-line method) for generating Voronoi diagrams in JavaScript, providing a performant browser-side solution for computational geometry of planar point sets. With this library you can feed a set of sites (points) and compute their Voronoi cells – the partition of the plane into regions closest to each site – in O(n log n) time. It’s especially useful in web UIs, visualizations, interactive maps, and generative-art contexts where you need dynamic tessellations or diagrammatic layouts. The library exposes API functions for computing cells, retrieving neighbors, and drawing results into canvas or SVG. ... -
11
S-Match
S-Match is a semantic matching framework.
S-Match is a semantic matching framework. S-Match takes any two tree like structures (such as database schemas, classifications, lightweight ontologies) and returns a set of correspondences between those tree nodes which semantically correspond to one another. S-Match contains implementations of the semantic matching, minimal semantic matching and structure preserving semantic matching algorithms. S-Match applies as a solution in many fields, including: information integration,... -
12
CLAW is a C++ Library providing various tools in different domains, like a Tweener framework, Bézier curves manipulation, a map with multiple value types, a binary search tree container implemented as an AVL and an implementation of the sockets as std::stream. The library also includes a set of classes to easily load and write png, jpeg, gif files and other image formats.
-
13
Graphal
Graph algorithms interpreter, IDE, debugger, 3D visualizations.
Graphal is an interpreter of a programming language that is mainly oriented to graph algorithms. There is a command line interpreter and a graphical integrated development environment. The IDE contains text editor for programmers, compilation and script output, advanced debugger and visualization window. The progress of the interpreted and debugged graph algorithm can be displayed in 3D scene. -
14
The EXT Library is set of various useful classes, templates and macros that extend functionality provided by ISO C++ (ext sub-library), standard C and C++ library (lib), to abstract parts of Windows API (win) and access PE file resources (res).
-
15
webscool
Tcl library of packages focusing on functional principles
Individual collection of operational Tcl packages which employ functional programming principles including currying and lambda expressions. Also set and monad structures and algorithms from Knuth, and a Chu Space Calculator with an efficient implementation of the -o implication operator which enumerates the continuous functions from one space to another. -
16
20 SkipList containers for C++ that work with STL. Combines set/map functionality with random access in logn time. One container is a multilist where you can order the same elements in a variety of different ways simultaneously.
-
17
clibutils is collection of common data structures , This library supports any type, Following are the datastructures currently implemented. 1. Dynamic Array 2. Single Linked List 3. Heap 4. Map 4. Set.
-
18
EZvolve Foundation Classes
Data types and utility classes for use with evolutionary algorithms.
EZvolve Foundation Classes is a set of data types and utility classes for use with evolutionary algorithms. Currently implemented support for bit string encoding, populations, fitnesses, fitness functions, probabilities, and probability vectors. -
19
This library is a lightweight implementation of genetic algorithm, contains the most popular types of chromosomes and the basic algorithms for selection, elitism, crossing and mutation.
-
20
Spreadsort is a fast general-case in-place hybrid radix/comparison algorithm, which tends to be roughly twice as fast as std::sort. This library has calls to sort integers, floats, or strings, or other data types based upon integer, float, or string keys
-
21
A Java collections framework based on set theory, specifically, from Spivey's work on the Z notation (a formal specification language).
-
22
This library implements several locality sensitive hashing(LSH) based algorithms, including indexing data structure for high dimensional spaces and metric spaces, sketch constructions and set embedding algorithms.
-
23
Java library offering theory of sets/set theory functionality (complement, intersection, symetric difference, union, cartesian product and powerset). There's also an ant task/ant tasks included that provides the library's functionality
-
24
This is a fully STL-compliant C++ map/set/multimap/multiset implementation for g++ using an AVL tree instead of a Red-Black tree (that is present in current libstdc++).
-
25
SSEPlus is a SIMD function library. It provides optimized emulation for newer SSE instructions. It also provides a rich set of high performance routines for common operations such as arithmetic, bitwise logic, and data packing and unpacking.
