Search Results for "stack"

A suite of Ada 2012 generics to facilitate iterative and recursive parallelism for multicore systems and provide safer recursion for single and multicore systems. Generics include Ravenscar compatible versions for real-time systems. Also Includes paraffinalia, which is a set of useful generics for parallel quicksort, fast fourier transform, function integration, prefix sum, and Red-Black trees

A Ring-Buffer instance could be used with element types - char - long - long long - void* . Focus is on a hardened SW structure with buffer-instance-pointer check (not very fast but more secure). Some features are globally choosable on compile-time (e.g. switch multithread support off completely to have faster access). Note: User Interface is for Test and Tutor Code only.

Programming Navigation is not just a website, but a complete ecology with the goal of "helping everyone discover high-quality programming resources and improve learning efficiency". It contains multiple sub-projects, and the technology stack includes React, Java SpringBoot, Tencent Cloud Development, etc., all of which are open source for everyone to learn, so that you can easily develop beautiful information navigation websites! Most of the programming navigation websites are in disrepair and have good navigation, but they are limited in search and classification, and they do not have functions such as self-recommendation and liking, so they are not sustainable.

...The stack, the tree and the hash table accept int, float and char* data type To look at the python library : https://github.com/mnoorfawi/struct-pie

This work is some notes of learning and practicing data structures and algorithms. Part I is a brief introduction of basic data structures and algorithms, such as, linked lists, stack, queues, trees, sorting and etc. This book notes about learning data structure and algorithms. It was written in Simplified Chinese but other languages such as English and Traditional Chinese are also working in progress.

...The same code that is displayed next to the illustration is also decorated using babel-plugin-trace-execution and executed to record the context at every step. Literally the same source file. Going back and forth between function execution (and call stack when algorithm uses recursion) is effortless. So is pausing and resuming. This project uses styled-jsx, but takes the idea of CSS-in-JS even further. Sizing, positioning and transition offsets are computed by JS, all before elements hit the DOM.

Algorithms in Python is a collection of algorithm and data structure implementations (primarily in Python) meant to serve as both learning material and reference code for engineers. It includes code for graph algorithms, heap data structures, stacks, queues, and more — each implemented cleanly so learners can trace logic and adapt for their problems. The repository is particularly useful for people preparing for competitive programming, job interviews, or building a foundational...

Fast cython implementation of trie data structure for Python. Development is inactive, but moved to: http://github.com/martinkozak/cytrie.