Displaying 1 to 20 from 142 results

gods - GoDS (Go Data Structures)

Implementation of various data structures and algorithms in Go.Containers are either ordered or unordered. All ordered containers provide stateful iterators and some of them allow enumerable functions.

C-Sharp-Algorithms - A C# plug-and-play class-library project of standard Data Structures and Algorithms

A C# plug-and-play class-library project of standard Data Structures and Algorithms. It contains 35+ Data Structures and 30+ Algorithms designed as Object-Oriented isolated components. Even though this project started for educational purposes, the implemented Data Structures and Algorithms are standard, efficient, stable and tested.This project originally started out as an interview preparation project. However, after receiving a great amount of positive responses on reddit, and noticing excitement from a few GitHubers to contribute furthermore to it, the project took on a different meaning. So, I decided to keep maintaining it as a reference for data structures and algorithm implementations in C# as well as my own research side-project under these topics.

disc - :chart_with_upwards_trend: Visualise the module tree of browserify project bundles and track down bloat

Disc is a tool for analyzing the module tree of browserify project bundles. It's especially handy for catching large and/or duplicate modules which might be either bloating up your bundle or slowing down the build process.The demo included on disc's github page is the end result of running the tool on browserify's own code base.

webpack-common-shake - CommonJS Tree Shaker plugin for WebPack

Please file an issue if anything is broken.See common-shake for abstract bundler-independent implementation.

rbush - RBush — a high-performance JavaScript R-tree-based 2D spatial index for points and rectangles

RBush is a high-performance JavaScript library for 2D spatial indexing of points and rectangles. It's based on an optimized R-tree data structure with bulk insertion support. Spatial index is a special data structure for points and rectangles that allows you to perform queries like "all items within this bounding box" very efficiently (e.g. hundreds of times faster than looping over all items). It's most commonly used in maps and data visualizations.

jqTree - Tree widget for jQuery

JqTree is a tree widget. Read more in the documentation. The project is hosted on github, has a test suite.

dockviz - Visualizing Docker data

Follow @dockviz for updates. This command takes Docker image and container information and presents in different ways, to help you understand what's going on inside the system.

node-falafel - transform the ast on a recursive walk

Transform the ast on a recursive walk.This modules uses acorn to create an AST from source code.

node-findit - Walk a directory tree in node.js

Recursively walk directory trees. Think /usr/bin/find.Return an event emitter finder that performs a recursive walk starting at basedir.

ascii_art - Real-Time ASCII Art Rendering Library

ASCII Art is a single file C/C++ library that let you transform an input image or video frame into printable ASCII characters at real-time using a single decision tree. Real-time performance is achieved by using pixel intensity comparison inside internal nodes of the tree. For a general overview on how the algorithm works, check the bottom of the demo page.

lark - A modern parsing library for Python, implementing Earley & LALR(1) and an easy interface

Beginners: Lark is not just another parser. It can parse any grammar you throw at it, no matter how complicated or ambiguous, and do so efficiently. It also constructs a parse-tree for you, without additional code on your part. Experts: Lark lets you choose between Earley and LALR(1), to trade-off power and speed. It also contains a CYK parser and experimental features such as a contextual-lexer.

kotlin-99 - Ninety-Nine Problems in Kotlin

This an adaptation of Ninety-Nine Scala Problems by Phil Gold which itself is an adaptation of the Ninety-Nine Prolog Problems written by Werner Hett at the Berne University of Applied Sciences in Berne, Switzerland. Some problems have been altered to be more amenable to programming in Kotlin. You might want to do these problems if you want to learn Kotlin, are interested in the problems described below, or both. The main reason to prefer this to using websites like hackerrank.com and codewars.com is that there is no vendor lock-in and no hidden agenda pursued by the website owner.

C# .NET Generic Data structures Library

C# .NET Generic Data structures Library like Binary Tree, B-Tree, Red-Black tree implementation. Suggestions/Contributions welcome on what more can be provided in this project.

Config Tree for Umbraco

Config Tree for Umbraco, adds a new app-tree in the developer section, allowing the user to edit the config files directly.


EaseSettings is a library designed to allow easy usage of settings with a highly structured in treenode-form.

XNA Procedural LTrees

Creates natural-looking tree models for XNA in real-time. LTrees makes it easier for XNA game developers to create beautiful nature scenes.