Search Results for "algorithms containers"
Sort By:
Showing 35 open source projects for "algorithms containers"
View related business solutions-
Gen AI apps are built with MongoDB AtlasMongoDB Atlas provides built-in vector search and a flexible document model so developers can build, scale, and run gen AI apps without stitching together multiple databases. From LLM integration to semantic search, Atlas simplifies your AI architecture—and it’s free to get started.
-
Our Free Plans just got better! | Auth0You asked, we delivered! Auth0 is excited to expand our Free and Paid plans to include more options so you can focus on building, deploying, and scaling applications without having to worry about your security. Auth0 now, thank yourself later.
-
1
EASTL
EASTL, Electronic Arts Standard Template Library
EASTL stands for Electronic Arts Standard Template Library. It is a C++ template library of containers, algorithms, and iterators useful for runtime and tool development across multiple platforms. It is a fairly extensive and robust implementation of such a library and has an emphasis on high performance above all other considerations. If you are familiar with the C++ STL or have worked with other templated container/algorithm libraries, you probably don't need to read this. ... -
2
Embedded Template Library (ETL)
Embedded Template Library
C++ is a great language to use for embedded applications and templates are a powerful aspect. The standard library can offer a great deal of well-tested functionality, but there are some parts of the standard library that do not fit well with deterministic behavior and limited resource requirements. These limitations usually preclude the use of dynamically allocated memory and containers with open-ended sizes. What is needed is a template library where the user can declare the size, or... -
3
SageMaker Spark
A Spark library for Amazon SageMaker
...These pipelines interleave native Spark ML stages and stages that interact with SageMaker training and model hosting. With SageMaker Spark, you can train on Amazon SageMaker from Spark DataFrames using Amazon-provided ML algorithms like K-Means clustering or XGBoost, and make predictions on DataFrames against SageMaker endpoints hosting your trained models, and, if you have your own ML algorithms built into SageMaker compatible Docker containers, you can use SageMaker Spark to train and infer on DataFrames with your own algorithms -- all at Spark scale. SageMaker Spark depends on hadoop-aws-2.8.1. ... -
4
dnd kit
Accessible and extensible drag & drop toolkit for React
...Exposes hooks such as use draggable and undroppable, and won't require you to re-architect your app or create additional wrapper DOM nodes. Customizable collision detection algorithms, multiple activators, draggable overlay, drag handles, auto-scrolling, constraints, and so much more. Lists, Grids, multiple containers, nested contexts, variable-sized items, virtualized lists, 2D Games, and more. The core of the library weighs around 10kb minified and has no external dependencies. It's built around built-in React state management and context, which keeps the library lean. ... -
Keep company data safe with Chrome EnterpriseMake AI work your way with Chrome Enterprise. Block unapproved sites and set custom data controls that align with your company's policies.
-
5
Dynamic Arrays and Hashes (Delphi, C++)
Very fast classes for working with Dynamic Arrays in Delphi and C++
(New version 1.04 is released) Dynamic Arrays is a set of useful very fast classes for data manipulating in memory. Flexible memory control, functionality that standard containers do not have, fast operations (assembler implementation for x86 and x64 platforms). Available for Delphi all latest versions and for C++. Powerful Hash and Double Hash classes to work with pairs of values (key and value) and with values that have two keys (key1, key2, value). Give it a try and let me know how... -
6
GoDS
Implementation of various data structures and algorithms in Go
GoDS, which means "Go Data Structures", is an implementation of various data structures and algorithms in Go. It provides a wide variety of containers (Sets, Lists, Stacks, Maps, Trees), sets (HashSet, TreeSet, LinkedHashSet), lists (ArrayList, SinglyLinkedList, DoublyLinkedList), stacks (LinkedListStack, ArrayStack), maps (HashMap, TreeMap, HashBidiMap, TreeBidiMap, LinkedHashMap), trees (RedBlackTree, AVLTree, BTree, BinaryHeap), comparators, and iterators. -
7
SageMaker MXNet Training Toolkit
Toolkit for running MXNet training scripts on SageMaker
...If you have your own algorithms built into SageMaker compatible Docker containers, you can train and host models using these as well. -
8
STXXL is an implementation of the C++ standard template library STL for external memory (out-of-core) computations, containers, and algorithms that can process huge volumes of data that only fit on disks.
-
9
ALEPH-w
Data structures and Algorithms library
...Dynamic linear hash tables are implemented too. The main algorithms on graphs are implemented in an easy way and with good performance features. Network Flow (maximum and min cost), cut points, topological sort, spanning trees, min paths. etc. The graphs are generic in the sense that they can contain data independent of the algorithm. Several containers of the C++ STL library are implemented with Aleph-w. -
Easy-to-use Business Software for the Waste Management Software IndustryDOP Software’s mission is to streamline waste and recycling business’ processes by providing them with dynamic, comprehensive software and services that increase productivity and quality of performance.
-
10
MyTinySTL
Achieve a tiny STL in C++11
This is a tinySTL based on C++11, which is my first project for practice. I use the Chinese documents and annotations for convenience, maybe there will be an English version later, but now I have no time to do that yet. Now I have released version 2.0.0. I have achieved the vast majority of the containers and functions of STL, and there may be some deficiencies and bugs. From version 2.x.x, the project will enter the stage of long-term maintenance, i.e., I probably will not add new content... -
11
cds
Concurrent Data Structure library
CDS (Concurrent Data Structures) is a C++ template library of lock-free and fine-grained lock-based algorithms. It contains a collection of concurrent data structures: queues, stacks, sets, maps, etc, and safe memory reclamation schema for concurrent containers - Hazard Pointer and user-space RCU. See doxygen doc http://libcds.sourceforge.net/doc/cds-api/index.html. The source code repo for libcds 2.x has been moved to https://github.com/khizmax/libcds -
12
LinAsm
Collection of fast and optimized assembly libraries for x86-64 Linux
LinAsm is collection of very fast and SIMD optimized assembly written libraries for x86-64 Linux. It implements many common and widely used algorithms for array manipulations: searching, sorting, arithmetic and vector operations, unit conversions; fast mathematical and statistic functions; numbers and time converting algorithms; finite impulse response (FIR) digital filters; spectrum analysis algorithms, Fast Hartley transformation; CPU cache friendly functions and extremely fast abstract... -
13
Spatial C++ Library
Library of generic, k-d tree multi-dimensional containers
...Additionally, Spatial's self-balancing kd-tree based containers, capable of object insertion and removal in fractional amortized time, prevent worst-case computational time on most operations. The latest release brings bug fixes and wide array of performance improvement across several algorithms. Nearest neighbor search, in particular, has been improved significantly. -
14
libcpr
Public domain backport of the core C++11 standard library to C.
Backport of C++11's std::string and std::vector to C. Other containers such as std::list, std::map, and std::set are in the works. -
15
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.
-
16
A generic implementation of STL containers and some STL algorithms. The main intent is no make this STL implementation to work with any kind of pointers defined by allocator classes, e.g. memory_mgr::offset_ptr.
-
17
Interval Container Library (ICL): An STL based generic library for computations on intervals, interval containers and cubes
-
18
fxSTL is a C++ container library. fxSTL stands for the Fixed Standard Template Library. fxSTL is not a replacement for the STL, but is rather an extension of the STL that provides implementations of fixed size containers.
-
19
iterator is developed to provide an easy way (at least I hope so) to iterate over nested collections of objects. It supports iteration with nesting level more than 2. It is developed in a way to be compliant with most stl containers and algorithms.
-
20
Open Macro Library is a library of highly reusable C macros providing a set of well-designed commonly needed functionality to C developers, like logging and debugging helpers, containers, sorting and other algorithms.
-
21
This small C package is made of an independent AVL tree library, and of an extension module for Python that builds upon it to provide objects of type 'avl_tree' in Python, which can behave as sorted containers or sequential lists.
-
22
One approach to constructing fast queues is to construct a mechanism for using shared memory appropriate containers in C++ as templates. There are three main components: the shared segment of memory, an allocator of memory chunks and the queue itself.
-
23
STLshm provides an C++ STL Allocator implementation for creating and using STL containers (and any other allocator aware types) in shared memory regions. It supports multiple shared region implementations.
-
24
CGL(C Generic Library) is a stl-like library written in pure C.It implements iterators, memory management,generic containers such as list,map, generic algorithms such as sort() and search(),and it can manipulate any types of data.
-
25
A portable C++ library of multi-threaded STL algorithms (transform, accumulate...) using standard containers and iostreams. Thread, mutex, spinlock are templatized. Close to Intel Threading Building Blocks, HPC++ or PSTL. Idea of A.Stepanov and M.Austen.
