Search Results for "black"

...Instrumentation via compiler hooks or hardware/perf counters guides mutations toward previously unseen edges, while persistent mode keeps the target process alive to amortize startup costs. The tool integrates tightly with sanitizers and can attach to already running processes, making it convenient for both white-box and black-box fuzzing. When it finds a crash, honggfuzz captures detailed context, minimizes the input, and can pin reproducibility by controlling CPU affinity and resource limits. Its small footprint and straightforward CLI make it easy to drop into CI or long-running campaigns across many cores.

...Notable examples for Emoji fonts are Windows Segoe UI emoji and Google Noto font. This means that writing text that include emojis will result in lovely colorful emojis, rather than black and white representations. PDFHummus is a fast and free PDF Writing, Parsing and Modification library.

...It is designed to offer for C programmers common data structures with powerful algorithms, and hidden implementation. Available structures are lists, queues, stacks, hash tables, binary trees, binary search trees, red-black trees, 2D arrays, permutations, heaps and interval heaps. GDSL is free software distributed under the terms of the GNU General Public License.

Calimero is a lightweight, high-performance, old-school Win32 console application designed to enhance your Windows desktop in the simplest and most unobtrusive way. Main core features of Calimero are managing and displaying local images as desktop wallpaper and fetching/downloading pictures from the Internet, from sites like Picsum, Pexels, Reddit, and Danbooru.

...It contains the main data structures: single and double lists, special arrays (dynamic and of bits), many types of trees: multitrees, binary search trees, avl, red-black, randomized, treaps, splay and other interesting types. Several types of hash tables are implemented: separated chaining, open adressing with linear probing and double function hash; this last one has a garbage colector mechanism that allows to free deleted entries. Dynamic linear hash tables are implemented too. The main algorithms on graphs are implemented in an easy way and with good performance features. ...

Very simple struct storage system, AVL and red-black tree based database library - database engine. You can define indexes over C struct.