Search Results for "key value"
Sort By:
Showing 24 open source projects for "key value"
View related business solutions-
Fully Managed MySQL, PostgreSQL, and SQL ServerCloud SQL handles your database ops end to end, so you can focus on your app.
-
$300 in Free Credit Towards Top Cloud ServicesStart your project in minutes. After credits run out, 20+ products include free monthly usage. Only pay when you're ready to scale.
-
1
Multiplatform Settings
A Kotlin Multiplatform library for saving simple key-value data
This is a Kotlin library for Multiplatform apps so that common code can persist key-value data. -
2
RLax
Library of JAX-based building blocks for reinforcement learning agents
...The library implements tools for Bellman equations, return distributions, general value functions, and policy optimization in both continuous and discrete action spaces. It integrates seamlessly with DeepMind’s Haiku (for neural network definition) and Optax (for optimization), making it a key component in modular RL pipelines. -
3
Faraday
Simple, but flexible HTTP client library, with support for backends
Faraday is an HTTP client library abstraction layer that provides a common interface over many adapters (such as Net::HTTP) and embraces the concept of Rack middleware when processing the request/response cycle. You probably don't want to use Faraday directly in your project, as it will lack an actual client library to perform requests. Instead, you probably want to have a look at Awesome Faraday for a list of available adapters. The best starting point is the Faraday Website, with its... -
4
Computer Science Flash Cards
Mini website for testing both general CS knowledge and enforce coding
This repository collects concise flash cards that cover the core ideas of a traditional computer science curriculum with a focus on interview readiness. The cards distill topics like time and space complexity, classic data structures, algorithmic paradigms, operating systems, networking, and databases into short, testable prompts. They are designed for spaced-repetition style study so you can cycle frequently through fundamentals until recall feels automatic. Many cards point at canonical... -
Gemini 3 and 200+ AI Models on One PlatformBuild generative AI apps with Vertex AI. Switch between models without switching platforms.
-
5
Doctrine Collections
Collections abstraction library
Doctrine Collections is a library that contains classes for working with arrays of data. Doctrine Collections provides an interface named Doctrine\Common\Collections\Collection that resembles the nature of a regular PHP array. That is, it is essentially an ordered map that can also be used like a list. A Collection has an internal iterator just like a PHP array. In addition, a Collection can be iterated with external iterators, which is preferable. To use an external iterator simply use the... -
6
Backbone
Give your JS app some Backbone with models, views, and collections
Backbone is a lightweight JavaScript library (sometimes described as a micro-framework) created by Jeremy Ashkenas that adds structure to JavaScript-heavy applications by providing models, views, collections, events and routing tied to RESTful JSON services. Its main philosophy is to provide the minimal set of primitives to organise your client-side code — models for data, collections for groups of models, views for UI interactions, and routers for state/URL management — without prescribing... -
7
Emoji Mart
One component to pick them all
...You can use custom emojis by providing an array of categories and their emojis. Emojis also support multiple skin tones and can be GIFs or SVGs. You can use custom category icons by providing an object with the category name as key and the icon as value. Currently supported formats are svg string and src. First, you need to make sure data has been initialized. You need to call this only once per page load. Note that if you call init like this, you don’t necessarily need to include data in your Picker props. It doesn’t hurt either, it will noop. -
8
gokv
Simple key-value store abstraction and implementations for Go
Simple key-value store abstraction and implementations for Go. Redis, Consul, etcd, bbolt, BadgerDB, LevelDB, Memcached, DynamoDB, S3, PostgreSQL, MongoDB, CockroachDB, and many more. There are detailed descriptions of the methods in the docs and in the code. You should read them if you plan to write your own gokv.Store implementation or if you create a Go package with a method that takes a gokv.Store as a parameter, so you know exactly what happens in the background. -
9
Dynamic Arrays and Hashes (Delphi, C++)
Very fast classes for working with Dynamic Arrays in Delphi and C++
...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 it works. -
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.
-
10
Flutter Examples
Simple basic isolated apps, for budding flutter devs
flutter-examples is a repository of standalone example Flutter apps that demonstrate various features, integrations, and UI / functional behaviors in Flutter. It covers many use-cases (navigation, state, HTTP, dependency injection, Firebase, etc.) so that developers can clone, run, and inspect working code to learn how to implement those features. Please keep PR titles easy to read and descriptive of changes, this will make them easier to merge. Complete apps with multiple features. Examples... -
11
qLibc
qLibc is a simple and yet powerful C library
qLibc is currently one of the most functionally-complete, publicly-licensed C/C++ libraries. The goal of the qLibc project is to provide a simple and powerful general-purpose C/C++ library that includes all kinds of containers and general library routines. It provides a ready-made set of common container APIs with a consistent API look. -
12
Lnkdlst
Single sided linked list (kind of lib with test-code, C, C++ and java)
...Main list-linkage-change functions: append, insert, delete. - Examples: use of flexible variable ArgList (OnePointerArg, optional valid if not NULL, Argument-Type by ID-Number is easy to get), key-value pairs, build FIFO{queue}/LIFO{stack}, auto-list with max. Element-Size and chronological order. Use malloc{slower-but-easy} or fix (static) memory. - OAList01: Object-Kind of a predefined pre-reserved List with X Elements (with constant user-data size), with secur modify functions and option to use locks (POSIX: mutex). Supporting a BusyList and a IdleList for easy build of e.g. a FIFO without need of much time for mem-allocation... -
13
LevelDB
A fast key-value storage library
LevelDB is a library of persistent key values. Written at Google, it contains keys and values that are arbitrary byte arrays, ordered within the key value store according to a user-specified comparator function. LevelDB is not an SQL database and does not support SQL queries or indexes. It simply provides an ordered mapping from string keys to string values. Data is stored already sorted by key, though callers can override the sort order through a custom comparison function. ... -
14
FCUUID
iOS UUID / Universally Unique Identifiers library
iOS UUID library as alternative to the old good UDID and identifierForVendor. This library provides the simplest API to obtain universally unique identifiers with different levels of persistence. It's possible to retrieve the UUIDs created for all devices of the same user, in this way with a little bit of server-side help it's possible manage guest accounts across multiple devices easily. -
15
ArangoDB Interactive Tutorials
Repository for all ArangoDB interactive tutorial notebooks
Choose your favored cloud platform with ArangoGraph, a full-managed, scalable, and high-performance graph database service that delivers the added value of an integrated document store, full-text search engine, and geospatial capabilities. This unified solution offers seamless, hassle-free management of these diverse data models and types, relieving you of operational overhead and allowing you to focus on innovation and development. Run on ANY system. Plus, ArangoDB supports Kubernetes... -
16
go-cache
An in-memory key:value store/cache library for Go
go-cache is an in-memory key:value store/cache similar to memcached that is suitable for applications running on a single machine. Its major advantage is that, being essentially a thread-safe map[string]interface{} with expiration times, it doesn't need to serialize or transmit its contents over the network. Any object can be stored, for a given duration or forever, and the cache can be safely used by multiple goroutines. Although go-cache isn't meant to be used as a persistent datastore,... -
17
Buckets
A complete, fully tested and documented data structure library
...Binary search trees keep their elements in sorted order, so that lookup and other operations can use the principle of binary search. Dictionaries map keys to values, each key can map to at most one value. A heap is a binary tree that maintains the heap property. Every node is less than or equal to each of its children. A linked list is a sequence of items arranged one after another. A multi dictionary is a special kind of dictionary that holds multiple values against each key. In a priority queue, each element is associated with a "priority", and elements are dequeued in the highest-priority-first order (the elements with the highest priority are dequeued first). -
18
Java DSA extensions
Java datastructures and algorithms extensions
DSA extensions contains classes similar in purpose to the classes provided in java.util. Currently, it contains sortable Lists and Maps, as well as a balanced binary search tree and a binary array search algorithm. -
19
JHCaching
Lightweight LRU Caching library with persistence
LRU caching map is Least Recent Used Map, (see Wiki), meaning that a Key,Value pair is stored in the cache, with a "expireTime", but every time the Key is retrieved (get method) the expire time is extended. It is a simple POJO one jar library. With complete documentation with examples and javadoc. When the cache reaches is "maxSize" or a cleanup of the cache is performed (automatically by deamon thread dependent on the "LRUCachingMapConfiguration"), it is the keys with least recent used (lowest expire time) that is discarded first. ... -
20
B-Tree implemented in Common Lisp. Stores key/value pairs onto disk based data structure. Current implementation has been tested with SBCL. Project was originally at alien-consader.org but is now made available at SourceForge.
-
21
-
22
A Linux Library and GUI to control the Luxeed U7 LED Keyboard. Uses libusb 1.0 to communicate with the keyboard.
-
23
Java does not provide object properties concept. Tag4J is similar to object properties, but not exact, it is different in many aspects. Tag4J basically provides standard way to add / remove tags [Key-Value pairs] .
-
24
Multithreaded java client of redis (A persistent key-value database with built-in net interface written in ANSI-C for Posix systems) See http://code.google.com/p/redis/
- Previous
- You're on page 1
- Next
