Buckets is a complete, fully tested and documented data structure library written in pure JavaScript.
data-structures collections collection linked-list dictionary map multimap stack queue set bag binary-heap priority-queue binary-search binary-search-tree tree tree-structure buckets data structure linked list heap priority binary data-structure hashmapPerformant React Native image component. FastImage example app.
react-native image priority sdwebimage glide image-cache cocoapod cache cached fastimageIt is a complete, fully tested data structure library written in TypeScript. This project uses TypeScript Generics so you need TS 0.9 and above.
typescript generics data structures collections linked list dictionary default multi binary search tree key value stack queue set bag heap priority arrayImage component working similar with standard img tag and with the following props. This function is only required, when you want to customise intersection observer configuration.
lazyload lazyload-images images-lazy responsive-images animation placeholder priority hints intersectionobserver react images intersection-observer performanceHow to controll the running priority of the processes on my system? SetProcessPrio is a windows service capable of changing the priority of started processes. It has a GUI tool for configuration, but also can be configured directly from registry. Developed in C# with .NET 2...
placa priority processThe PriorityQueue from the RxJS library as a standalone module
priority queue rx rxjsMind-blowingly simple local resource management
semaphore semaphores resource resources management lock locks locking mutex priorityUseful for rate-limiting async operations. For example, when interacting with a REST API or when doing CPU/memory intensive tasks.Here we run only one promise at the time. For example, set concurrency to 4 to run four promises at the time.
promise queue enqueue limit limited concurrency throttle throat rate batch ratelimit priority priorityqueue fifo job task async await promises bluebirdYou cannot access the data in any other way: you must dequeue or peek. You can npm install js-priority-queue or bower install js-priority-queue. Alternatively, just download priority-queue.js from this directory.
priority queue bheap b-heap binary heap dequeue comparatorThe smallest and simplest binary heap priority queue in JavaScript. Inspired by js-priority-queue by Adam Hooper.
algorithm priority-queue binary-heap data-structure queue priority data-structuresSmall keyboard shortcut management for DOM-based applications. Keyboard Manager uses a simple queue, processed from newest to oldest, of listener functions to execute keyboard shortcuts. Keyboard event propagation stops when handled, but returning true from the listener will continue propagation to older listeners.
keyboard-shortcuts keyboard-manager dom typescript character reactjs keyboard shortcut manager event priority queueA simple priority queue data structure for Node.js and the browser. If you just want a pre-built file for using in the web, check the releases section.
heap priority queue priority-queue data-structureA pure Python scannerless LR/GLR parser. For more information see the docs.
parsing lr-parser lalr deterministic scannerless-lr priority non-deterministic glr-parsingI decided to trial these labels on the repo that's responsible for the JSON-Schema website, json-schema.org. While they mostly make sense, I quickly found that some labels are a little open to interpretation. The article outlines the reasoning why these new labels are better than the labels Github provides, however it doesn't include any explanation for each label, which is fine given the intention, and leaves teams to work out their own interpretations that suite their needs. If you're looking for some definitions, and maybe some examples, then hopefully my outline will give you a basis to work on. Feel free to take these and amend them as you wish.
github-labels priority organization management workflow triageSort items in a graph using a topological sort while resolving cycles with priority groups. However, even with priority groups you can still accidentally create cycles of dependencies in your graph.
graph adjacency-lists priority-list cycles sequencing sorting adjacency list tasks priority priorities sort dependencies topological topo sequencerThis is a map of items to their dependencies. Items can be any type as long as they are === to one another. This function gets called on every item in the graph. It should return a promise.
graph adjacency list tasks priority priorities sort dependencies topological topo sequencer task runnerAll pull requests are welcome, make sure to follow the contribution guidelines when you submit pull request.
rxjava rxjava2 rxandroid rxandroid2 rxjava-android rxjava-library rxjava-2 android android-library mindorks priority-queue priority priority-scheduler priority-schedulingPriority Nav Scroller is a plugin for the priority+ navigation pattern. When the navigation items don’t fit on screen they are hidden in a horizontal scrollable container with controls. The script is an ES6(ES2015) module but a compiled version is included in the build as index.js. You can also copy scripts/priority-nav-scroller.js into your own site if your build process can accomodate ES6 modules. Babel and Browserify are used in the demo site.
priority-nav-scroller priority-navigation scrolling navigation scroller priority+ priority responsiveA simple, customizable, and lightweight priority queue for promise based tasks. TaskEasy is built as an extension of a simple heap data structure. Tasks are queued by simply passing a task (function) to the .schedule method along with an array of arguments to be called as well as an object to describe the task's relative priority. The caller is returned a promise which will resolve once the scheduled task has ran. Priority determination is left up to the user via a function that accepts task priority object and returns a judgement.
queue lightweight in-memory task runner promise async worker job priority manager utilityGo implementation of CMS PhEDEx distributed, loosly coupled agents for CMS transfering data. The CMS experiment at the LHC proton-proton collider developed PhEDEx (Physics Experiment Data Export) service as reliable and scalable data management system to meet experiment requirements in Run I/II. Designed in 2004, and written mainly in Perl, it is still used today for managing multi-PB transfer loads per week, across a complex topology of dozen of Grid-compliant computing centres.
transfer-request agent-request tfc phedex priority cms
We have large collection of open source products. Follow the tags from
Tag Cloud >>
Open source products are scattered around the web. Please provide information
about the open source projects you own / you use.
Add Projects.