Search Results for "binary tree"

ANTLR (ANother Tool for Language Recognition) is a powerful parser generator for reading, processing, executing, or translating structured text or binary files. It's widely used to build languages, tools, and frameworks. From a grammar, ANTLR generates a parser that can build and walk parse trees. It’s widely used in academia and industry to build all sorts of languages, tools, and frameworks. Twitter search uses ANTLR for query parsing, with over 2 billion queries a day. The languages for...

Create zip files, extract zip files, replace text in files, search in files using expressions, stream text editor, instant command line ftp and http server, send folder via network, copy folder excluding sub folders and files, find duplicate files, run a command on all files of a folder, split and join large files, make md5 checksum lists of files, remove tab characters, convert CR/LF, list newest or biggest files of a folder, compare folders, treesize, show first or last lines of a file,...

An note taking program with WebDAV sync capabilities. It works on a local (and WebDAV) directory and shows the items (text/image/binary) in a tree view. Any changes are reflected in the file system directly. Features: - group notes and images in a tree structure (using folders) - can work on any directory on your machine - technically works like a file browser with inline text editing - synchronizes with any WebDAV server (optionally using SSL/TLS) - allows one-way and two-way synchronization - allows to encrypt your files locally and remote using AES256 - multi language support You can obtain the full source code at: https://crispy-cow.de/git/CrispySyncNote.git Latest changes: 2.1.0: Updated for Java 9 and up 2.0.2: Added more UI translation, updated greek language (thanks to geogeo) 2.0.1: Bugfix: Sync state is now copied when duplicating workspace due to change in encryption settings

binreplace is a command line tool to search and replace binary sequences in a file. It can be very powerful when used together with grep and sed. It uses prefix tree internally to search. It's efficient even with millions of search terms.