Search Results for "data collection algorithm"
Sort By:
Showing 487 open source projects for "data collection algorithm"
View related business solutions-
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.
-
Custom VMs From 1 to 96 vCPUs With 99.95% UptimeLive migration and automatic failover keep workloads online through maintenance. One free e2-micro VM every month.
-
1
Hello Algorithm
Animated illustrations, one-click data structure
Animated illustrations, one-click data structure and algorithm tutorials. This project aims to create an open source, free, novice-friendly introductory tutorial on data structures and algorithms. The whole book uses animated illustrations, the content is clear and easy to understand, and the learning curve is smooth, guiding beginners to explore the knowledge map of data structures and algorithms. -
2
Pythonic Data Structures and Algorithms
Minimal examples of data structures and algorithms in Python
The Pythonic Data Structures and Algorithms repository by keon is a hands-on collection of implementations of classical data structures and algorithms written in Python. It offers working, often well-commented code for many standard algorithmic problems — from sorting/searching to graph algorithms, dynamic programming, data structures, and more — making it a valuable resource for learning and reference. -
3
Swift Algorithm Club
Algorithms and data structures in Swift, with explanations
Swift Algorithm Club is a project that implements a broad collection of algorithms and data structures in the Swift programming language, with clear commentary and educational intent. Its purpose is not primarily to be a utility library, but rather to teach the how and why behind algorithms—readers can study implementations, complexity, and design choices in a Swift context. -
4
Dynamic Data
Reactive collections based on Rx.Net
...Dynamic data has been developed to remove the tedious code of dynamically maintaining collections. It has grown to become functionally very rich with at least 60 collection-based operations which amongst other things enable filtering, sorting, grouping, joining different sources, transforms, binding, pagination, data virtualization, expiration, disposal management plus more. -
$300 Free Credits to Build on Google CloudPut your $300 in credit toward real workloads, then keep building with free monthly usage for 20+ products. No commitment and no charge until you upgrade.
-
5
X's Recommendation Algorithm
Source code for the X Recommendation Algorithm
The Algorithm is Twitter’s open source release of the core ranking system that powers the platform’s home timeline. It provides transparency into how tweets are selected, prioritized, and surfaced to users, reflecting Twitter’s move toward openness in recommendation algorithms. The repository contains the recommendation pipeline, which incorporates signals such as engagement, relevance, and content features, and demonstrates how they combine to form ranked outputs. -
6
Spring Data REST
Simplifies building hypermedia-driven REST web services
Spring Data REST is part of the umbrella Spring Data project and makes it easy to build hypermedia-driven REST web services on top of Spring Data repositories. Spring Data REST builds on top of Spring Data repositories, analyzes your application’s domain model and exposes hypermedia-driven HTTP resources for aggregates contained in the model. -
7
JavaScript Algo and Data Structures
Algorithms and data structures implemented in JavaScript
javascript-algorithms is an open source repository by Oleksii Trekhleb that provides implementations of algorithms and data structures in JavaScript. Each algorithm includes explanations, complexity analysis, and references for further reading, making it both a coding resource and a study guide. The repository covers topics such as sorting, searching, graph algorithms, cryptography, and data structures like linked lists, stacks, and queues. It is designed to help developers understand algorithm fundamentals and practice problem-solving with JavaScript. ... -
8
Algorithms & data structures project
A collection of algorithms and data structures
Algorithms is an educational collection of data structures and algorithms implemented primarily in Java. Its goal is to demonstrate common techniques through clear and elegant reference implementations. The repository covers trees, heaps, hash tables, graphs, dynamic programming, geometry, searching, sorting, strings, and many other topics. Complexity information is documented for many algorithms to help users understand performance characteristics. -
9
Spring Data Redis
Provides support to increase developer productivity in Java
Provides support to increase developer productivity in Java when using Redis, a key-value store. Uses familiar Spring concepts such as a template class for core API usage and lightweight repository-style data access. The primary goal of the Spring Data project is to make it easier to build Spring-powered applications that use new data access technologies such as non-relational databases, map-reduce frameworks, and cloud-based data services. Connection package as low-level abstraction across... -
MongoDB Atlas runs apps anywhereMongoDB Atlas gives you the freedom to build and run modern applications anywhere—across AWS, Azure, and Google Cloud. With global availability in over 115 regions, Atlas lets you deploy close to your users, meet compliance needs, and scale with confidence across any geography.
-
10
X For You Feed Algorithm
Algorithm powering the For You feed on X
X For You Feed Algorithm is the open-sourced core recommendation system that powers the For You feed on X (the social network formerly known as Twitter), and it represents one of the first times a major social platform has published production-level ranking code for public review and experimentation. The repository contains the full pipeline that ingests user engagement and content candidate data, processes it through retrieval, hydration, filtering, scoring, and selection layers, and ultimately ranks posts to show what appears in a user’s feed. ... -
11
go-algorithms
Algorithms and data structures for golang
...Because the code focuses on clarity over heavy abstraction, it is especially useful for students and developers studying algorithmic fundamentals. Overall, go-algorithms serves as a practical reference and study companion for Go programmers building a strong foundation in data structures and algorithm design. -
12
Zstandard
Zstandard - Fast real-time compression algorithm
Zstandard is a fast compression algorithm, providing high compression ratios. It also offers a special mode for small data, called dictionary compression. The reference library offers a very wide range of speed / compression trade-off, and is backed by an extremely fast decoder (see benchmarks below). Zstandard library is provided as open source software using a BSD license. -
13
Immutable.js
Immutable collections for JavaScript
Immutable.js offers a collection of Persistent Immutable data structures for JavaScript. Immutable data is unchangeable once created, which makes application development so much simpler. There’s no defensive copying, and you get advanced memoization and change detection techniques with simple logic. Persistent data gives you a mutative API, one that doesn’t update data in-place but always produces new and updated data. -
14
CodeGuide
This repository is a collection of the author, Xiao Fuge
CodeGuide is a curated collection of Java development resources built from years of real-world engineering experience by the author, who has worked extensively in large-scale internet companies. The project serves as a structured and comprehensive learning path for developers who want to strengthen their understanding of Java fundamentals and core programming practices. It includes detailed explanations of design patterns, source code analysis, frameworks, algorithms, and real-world project... -
15
Zipkin
Distributed tracing system to gather timing data
Zipkin is a distributed tracing system. It helps gather timing data needed to troubleshoot latency problems in service architectures. Features include both the collection and lookup of this data. If you have a trace ID in a log file, you can jump directly to it. Otherwise, you can query based on attributes such as service, operation name, tags and duration. Some interesting data will be summarized for you, such as the percentage of time spent in a service, and whether or not operations failed. ... -
16
Deepchecks
Test Suites for validating ML models & data
Deepchecks is the leading tool for testing and for validating your machine learning models and data, and it enables doing so with minimal effort. Deepchecks accompany you through various validation and testing needs such as verifying your data’s integrity, inspecting its distributions, validating data splits, evaluating your model and comparing between different models. While you’re in the research phase, and want to validate your data, find potential methodological problems, and/or validate your model and evaluate it. ... -
17
IGListKit
A data-driven UICollectionView framework for building fast lists
IGListKit uses an algorithm adapted from a paper titled A technique for isolating differences between files by Paul Heckel. This algorithm uses a technique known as the longest common subsequence to find a minimal diff between collections in linear time O(n). It finds all inserts, deletes, updates, and moves between arrays of data. A working range is a range of section controllers who aren’t yet visible, but are near the screen. -
18
Hacks
A collection of hacks and one-off scripts
Hacks is a collection of experimental scripts, utilities, and one-off tools created to solve specific problems in security research, data processing, and automation. Rather than being a single cohesive application, it serves as a repository of practical command-line tools that can be used independently or combined into workflows. The scripts cover a wide range of tasks, including URL manipulation, parameter replacement, data extraction, and reconnaissance automation. ... -
19
lockfree
A collection of lock-free data structures written in standard C++11
lockfree is a collection of lock-free data structures written in standard C++11 and suitable for all platforms - from deeply embedded to HPC. Lock-free data structures are data structures that are thread and interrupt-safe for concurrent use without having to use mutual exclusion mechanisms. They are most useful for inter-process communication and often scale much better than lock-based structures with the number of operations and threads. -
20
CPlusPlusThings
Collection of various C++ code samples, utilities, patterns
CPlusPlusThings is a repository collecting various C++ code samples, utilities, patterns, and small example projects. It is less a polished product and more a learning/reference collection of snippets and usages of C++ idioms, data structures, algorithms, utilities, and perhaps tricks or meta-programming exercises. (No prominent README or detailed docs were available from my quick search.) Example implementations of data structures and algorithms. Organized as a learning repository (rather than a production framework). ... -
21
Go Recipes
Collection of handy tools for Go projects
Visualize the distribution of code coverage in your project. This helps to identify code areas with high and low coverage. Useful when you have a large project with lots of files and packages. This 2D image-hash of your project should be more representative than a single number. For each module, the node representing the greatest version (i.e., the version chosen by Go's minimal version selection algorithm) is colored green. Other nodes, which aren't in the final build list, are colored grey... -
22
Laravel Fractal
An easy to use Fractal wrapper built for Laravel and Lumen
The package provides a nice and easy wrapper around Fractal for use in your Laravel applications. If you don't know what Fractal does, take a peek at their intro. Shortly said, Fractal is very useful to transform data before using it in an API. Transforming right from a Laravel collection is particularly useful for Eloquent results. You can transform directly from a Laravel collection as well. There's also a very short syntax available to quickly transform data. Lovers of facades will be glad to know that a facade is provided. You can add methods to the Fractal class using Laravel's Macroable trait. ... -
23
OmniTools
Self-hosted collection of powerful web-based tools for everyday tasks
OmniTools is a self-hosted web application that bundles a large collection of everyday utilities into a single clean interface you can run on your own infrastructure. It’s designed to replace the random assortment of “free online tools” people use for quick tasks, while avoiding ads, tracking, and the need to upload sensitive files to unknown servers. A key design choice is that file processing happens entirely on the client side, meaning your data stays in your browser instead of being sent to the backend. ... -
24
Corcel
Use WordPress backend with Laravel or any PHP application
A collection of Model classes that allows you to get data directly from a WordPress database. Corcel is a collection of PHP classes built on top of Eloquent ORM (from Laravel framework), that provides a fluent interface to connect and get data directly from a WordPress database. You can use WordPress as the backend (administration panel) or CMS, for inserting posts, custom types, etc, and any other PHP app in the other side querying those data (as a Model layer). ... -
25
xxHash
Extremely fast non-cryptographic hash algorithm
...Code is highly portable, and hashes are identical across all platforms (little / big endian). Performance on large data is only one part of the picture. Hashing is also very useful in constructions like hash tables and bloom filters. In these use cases, it's frequent to hash a lot of small data (starting at a few bytes). Algorithm's performance can be very different for such scenarios, since parts of the algorithm, such as initialization or finalization, become fixed cost. ...
