Search Results for "linked list" - Page 3
Sort By:
Showing 111 open source projects for "linked list"
View related business solutions-
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.
-
Build Data Resilience - Take the Assessment TodayIs your recovery strategy as strong as you think? Take this quick self-assessment to check your recovery readiness and gain tailored insights. In only 2 minutes, you'll learn where you fall on the recovery readiness scale.
-
1
JavaMutex
Provides 100% pure Java mutual exclusion.
Freely redistributable open source 100% pure Java for mutual exclusion. Read-write and read-only reentrant lock, condition variable, atomic wraps for Boolean, Integer, Long, and Reference. Cell pool with optional locking, object exchanger, Intersect. -
2
Buckets
A complete, fully tested and documented data structure library
...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). -
3
treedb
on-disk memory library
...If you follow the tests/examples, you too can store dictionaries, trees, lists or whatever you can think of in disk-based memory, just an open() and mmap() away. Treedb comes with an AVL tree, doubly-linked-list and variable-entry sized-array implementations for you to use in your data structures. -
4
meta-treedb
on-disk memory library using meta-data
...If you follow the tests/examples, you too can store dictionaries, trees, lists or whatever you can think of in disk-based memory, just an open() and mmap() away. Meta-treedb comes with an AVL tree, doubly-linked-list and variable-entry-sized-array implementations for you to use in your data structures. So, what distinguishes meta-treedb from treedb? * "class" interfaces for treedb collections These are vtables (virtual function tables) that implement the interface. * faster compiles - only the "class" interfaces are visible to client code This is at the expense of a small performance hit... -
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.
-
5
SVN Externals Updater
Tool for SVN externals update of multiple repositories
A tool that allows management of SVN externals of multiple SVN repositories. If you have many SVN repositories that reference each other using SVN externals it is not simple to keep these externals updated. This tool allows you to manage the repositories using a graphical user interface that is simple to use. I created this tool for help in my own official work as I manage SVN repositories of the software developed by my company. There are quite a few repositories for the applications and... -
6
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. -
7
Primitive Type Data Structures
Data Structures for primitive data types
Implemented for int and long: - List (linked and array), - Set (tree and hash), - Map (tree and hash), - Concurrent Map (hash), - Hash map with RB tree that allows indexing by key and sort by value (used when iterating the value). There is also implementation of Map<int, Object> and Map<long, Object> (tree, hash and hash with tree on value) to allow the use of primitive keys with objects as value -
8
Google friendly InfiniteScroll. ASP MVC
Infinite scroll page
This project is to build a listing function from scratch in asp.net mvc that shows a long list of blogpost, which will be loaded into pools of N post at a time through infinity scrolland and at the same time is Google friendly. To make sure that search engines can crawl individual items linked from an infinite scroll page, make sure that you or your content management system produces a paginated series (component pages) to go along with your infinite scroll. -
9
imamLL
linked list for C prgramming language
ImamLL is a elegant linked list library for C programming language. It is designed to be efficient and programmers friendly by minimizing number of variables required for allocating memory from the heap. It is created in a hope that it will help developers to store arbitrary information in the programs easily. -
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
xorlisp
Bit level lambda continuations and nothing else - Queue automata
...It appears related to the church encoding of lambda where T chooses first parameter and F chooses second, of a pair. Continuations are nearly finished code and are represented as a pair of stack and queue. The stack is a linked list of pair of true or false and object pushed on the stack. The queue is also such a linked list but is paired oppositely so previous queue state goes on the left and next object queued on the right of the new pair, so when the queue is navigated in sequence of that astronomically long bitstring (thats exponential of reusing objects in the acyclicNet), the Nav32 (using linearForward and treeForward for random access) first sees the oldest object queued -
11
ckon
automatic build tool for ROOT data analysis software
ckon is a C++ program/tool which automatically takes care of compilation, dictionary generation and linking of programs and libraries developed for data analyses within the CERN ROOT analysis framework. This includes parsing include headers to figure out which libraries the main programs need to be linked to. It uses automake/autoconf to be platform independent and GNU install compliant. In addition, m4 macros are automatically downloaded and the according compiler flags included based on a list of boost libraries provided in the config file. -
12
Immutable Collections for Java
Immutable/Persistent Collections Library
...While collections are immutable they provide methods for adding and removing values by creating new modified copies of themselves. Each copy shares as much as possible of its structure with other copies to minimize memory consumption. The library includes a singly linked (cons/cddr style) list/stack, an integer trie based indexed list, a 2-3 tree based random access indexed list, a 2-3 tree based map, a hash trie based map, and hash and tree based sets, and sparse arrays. All collections provide immutable Cursor as well as standard Iterator classes for looping through all elements. A utility class provides functional style algorithmic processing of Cursors including foldLeft, foldRight, collect, select, and reject. ... -
13
libcutils
Some Useful C-Utilities
...The library provides fundamental data structures such as lists, hash-maps, strings and parsing functions for JSON or the typical dot-file based configuration data. The following list summarizes the currently supported functionality: * length delimited instead of NULL terminated strings * memory management based on reference counting * several list processing functions like iterators and map-reduce * support of [Ideal Hash Tries](http://infoscience.epfl.ch/record/64398/files/idealhashtrees.pdf) for highly efficient hash map data structures * parsers for [JSON](http://json.org) data and the text configuration files found in Unix system * doubly linked circular lists for reliable event queues * support for test and debugging of memory management problems such as memory leaks -
14
Czimps
A graphical user interface to many Image Processing Functions
...There are a lot of internal functions and tools, but the majority of the underlying functionality is due to public domain libraries which must be compiled separately and linked to this project. (see Image Magick, Open CV, VTK, MuParser, POV-Raytracer and CombineZ) It is impossible to list all of the uses for the software, the basic idea is that you develop or download a Function List which will solve some graphics problem when it is run. Function Lists are built from simple functions, in turn the settings and properties of these functions can be altered interactively. ... -
15
libcollections
a library that provides collections implementations for your C code
libcollections is a library that provides a reutilisable and comprehensive set of collections to your C code. Implemented so far: - linked list, - queue - stack To be implemented: - vector (arraylist) - red black tree - set - map -
16
WhyWaitForever Slideshow
Slideshow with variable display times and linked folders.
A simple, easy to extend, parameter driven and customisable Java application that displays JPEG images. An advanced end-user is required to install and amend parameters and create the file that contains the list of folders that contain the images. The application is started through a command window executing the Java run-time environment. Key "Esc" ends the application. Key "h" displays options. The application was developed to help people with memory loss as past images can provide... -
17
.... ======================================================================================= The goal of qLibc project is providing general purpose complete C/C++ library which includes all kinds of containers and general library routines. For example, it contains Doubly Linked List, List Table, Hash Table, Vector, Queue, Stack and more.
-
18
elise-ebay
Simulate ebay ecosystem - N clients bid on M items
...Classes use concurrent hash map, CAS counters, & Container<Bid>. Relative performance was determined for different Container<Bid> implementations. - impl1: blocking priority queue - impl2: blocking list + 1 peak value - impl3: concurrent linked queue+1 CAS peak value Uses Guice for Dependency Injection. Makes heavy use of generics for entities, keepers, factories, & DAOs. Performance Peaks - impl1: 1.6 M bids/sec - impl2: 2.5 M bids/sec - impl3: 2.,6 M+ bids/sec Throughput increased and jitter reduced by setting init capacity of maps to 1k. ... -
19
======================================================================================= OUR PROJECT HOME HAS BEEN MOVED TO https://github.com/wolkykim/qdecoder PLEASE CHECK OUT OUR NEW HOME FOR THE LATEST UPDATES. ======================================================================================= The goal of qDecoder project is providing complete but simple and versatile CGI library for C/C++ language. It supports GET/POST query parsing including File Uploading, Cookie handling and...
-
20
PhotoLink
Cross platform program for batching photos that are linked to a list.
Photolink is a cross platform program for batching photographs that are linked to a names list (stored as a text file). This is designed so that the batched images (normally smaller images than the orginal) can be imported into school information systems such as CMISS, Simms and ID databases so that the photos are linked with the names. Usually this is linked by ID numbers. This kind of software is used in photographic companys that take photos at schools and colleges. ... -
21
-
22
SGHLib C++ Library
A Fast and Useful C++ Library for Easier Handling of Windows API.
SGHLib Aims to be the Faster Library to Easily and Safely Access the Windows API and Other Non-Windows Extras. Contain your developments, big update incoming, which will remove all useless things, will bring more speed and templates and (maybe) a wiki. -
23
C Program Foundation
Suite of Linux libs: logger, collections, shared memory lib
Includes: Shared Memory Library Library intended to ease the communication task between the processes. The main idea is that a user can create one or more shared memory areas where the programs exchange data. They can be aware of data changes by making pools in a while loop. Every access to the shared zone is conditioned by acquiring a semaphore lock. Data in the memories can be easily saved to a file. Each method is thread safe so... -
24
Sowseed
Seed sowing database to keep track of heirloom organic seeds
...There is a need for seed growers to preserve many varieties of heirloom seeds in order to maintain biodiversity. Several small groups hooked into the same database can benefit from a collaborative effect ensuring the greatest range of rare seeds are sown. Entries can be linked together so if seedling thinning has been carried out the original planting of that seed can be accessed. The barcodes can be scanned by an Android phone and the details of the sowing recalled. The species list is user defined with the option of providing a url for each entry so the characteristics of the plant can be readily accessed. -
25
Developing Queue Message admin gui based tools for OpenMQ (GlassFish JMS) / Oracle WebLogic MQ. The name of tool is QBrowserV2. It aims to implement functionality such as New Message Create/Send, Delete Messages, Forward Messages, Subscribe TOPICs.
