Search Results for "binary search tree" - Page 19

ExplorerIndex is a Perl driven indexing script, that creates a sitemap, and/or/including a table of contents for specified files/directories. It produces a static or dynamic page with a Javascript tree control, html-template and cookie driven.

Project for code implementing the TigerTree cryptographic hash. TigerTree is calculated by applying the Tiger hash to 1024-byte blocks of a stream, then combining the interim values through a binary hash tree.

The Music File Finder (muff) is a shell program (bash) to search a directory tree for mp3 files whose filename matches some regular expression. Users are presented a list of matching filenames and can choose any of these file to be appended to a playlist

Replacehex is a command line search and replace utility that works with hex codes strings. It can operate on both binary and text files efficiently. A great tool to work on binary data files. First developed to replace mac addresses inside a pcap capture

A Generic Data Structures Library. A collection of data structures you're most likely to need. Written in ANSI C. Interface is basic, but powerful, and intuitive. Has AVL tree, binary heap, queue/linked list, and more. All platforms.

Lazyread auto-scrolls files or command output to the screen. Change scroll modes, scroll-speed, colors, pause, search, etc. Render text, HTML, PDF, gzip, tar, zip, ar, bzip2, MS-Word, nroff, binary, directories, .deb, .so, .rpm, piped output and more

A web based LDAP administration console to ease directory administrators daily tasks. Features a tree view, a search engine, edit/add/modify/delete operations, plus nifty features such as a batch mode, ACL wizard and more.

MultiSeek is an (OpenSource) multi-threaded search engine. It uses a simple config file format to define its operating parameters, and comes with 15 themes. MultiSeek is a single binary that operates as a CGI on any web server, and requires no database.

XML Tree is a dynamic, customizable tree-heirachy web-based interface. The information is all retrieved from a specified XML document and can therefore be syndicated easily.

Opsis is a Java applet designed to teach binary search tree algorithms. Opsis is not an animation program; rather, the system uses visual programming in an abstract way.

Text-Query-SQL is derived from the Text-Query module. Text-Query is a general purpose query parser and resolver. It is able to parse the AltaVista 'simple query' and 'advanced query' syntax. The syntax tree is then used to build a search query.

...It's design makes it easy to extend the computer player and human player interface. It currently has 6 different computer players ranging from completely random to tree search with Alpha-Beta pruning.

LdapEngine, which includes an easy, more natural way to search and manipulate a LDAP tree (especially compared to JNDI). The second part is a graphical LD

Binary Search Trees in Javascript. The reason binary-search trees are important is that the following operations can be implemented efficiently: - insert a key value - determine whether a key value is in the tree - remove a key value from the tree - print all of the key values in sorted order

This project has been moved to GitHub: https://github.com/jsc0218/MxTree.

The application searches binary dfm files in Delphi and C++ Builder. It can quickly search and find text within text files such as ASP and HTML and binary dfm files.

This is a very simple implementation of the genetic algorithm framework presented by John Holland, based on Goldberg book Genetic Algorithms in Search, Optimization and Machine Learning.

RSSE: Really Simple Search Engine is a C#.NET library, that allows indexing of RSS feeds for use in a search engine. RSSE provides semantic search, custom weight functions for keywords, and binary operators in search queries (AND, OR)...

The scope of this work is to create a framework for visualization and storage capabilities for attack trees. Attack trees are well known models to visualize attack scenarios and often used to evaluate potential threats on given environments with the eventual goal to be able to establish respective countermeasures. This work should provide a framework which helps security experts to model, store and search potential attack scenarios. Project of the masters course "Software Technology" at...

Sort and binary tree algorithms for education.

# Salamis Salamis is a small C++17 vector database prototype. It keeps vectors in memory for fast exact nearest-neighbor search and persists the collection to a physical binary store on disk. ## License Salamis is licensed under the GNU General Public License version 3.0 only. See [LICENSE](LICENSE) for the full license text. ## Features - In-memory vector map keyed by string ids - Physical binary backing file that reloads on startup - Exact `top-k` search with cosine similarity, L2 distance, or dot product - Cross-platform build and storage path handling for Linux and Windows - Snapshot writes through a temporary file followed by replacement - Dependency-free CMake build - Minimal CLI and unit tests - User and admin web consoles for distributed deployments - Management CLI for node inventory, shard ownership, and health checks ## Modules - `SalmisCore`: local in-memory vector store, search, and physical persistence - `SalmisCluster`: distributed shard own

Wa (word analysis) engine is a engine implementing common IA algorithms such as in-depth tree search using alpha-beta.