Search Results for "test case"

NanoBoyAdvance is a cycle-accurate Game Boy Advance emulator that prioritizes precision and correctness in replicating original hardware behavior. It is designed to emulate the GBA at a very low level, including CPU timing, DMA operations, graphics processing, and memory behavior, ensuring that even edge cases and obscure hardware quirks are faithfully reproduced. The emulator achieves extremely high compatibility, passing multiple hardware test suites and accurately running games that rely...

This utility designed to erase all traces of (broken) connected USB devices - flash-drives, disks and CD-ROMs from computer registry of Windows XP, Windows 2003, Windows Vista, Windows 7, Windows 8, Windows 10 (32/64-bit versions). The utility has a test mode of operation, i.e. without actually removing data from the registry, and, just in case, creates a .reg-file to undo any changes. There is also a fully automatic mode.

...Requirements: * Network tap or L2 Managed Switch with option to mirror traffic to specified port * Windows XP 32-bit (or better) * .NET Framework 4.0 (or better) * WinPcap 4.1.3 (in archive) * Microsoft Visual C++ 2015 Runtime (x86) (in archive) If your gateway is powered by Windows, you can try to run this app and select Network Interface which is connected to Local Network. It should work but I did not test it. L2 switch in this case is not required. =============== Donation balance $0 ===============

nCine is a cross-platform 2D game engine that runs on PC (Linux, Windows, macOS), Android, Raspberry Pi, and the web (Emscripten). The project has been in active development since June 2011. Source code is released under the MIT license and is available on GitHub. Visit the donate page to discover different ways to support and sponsor the project. Join the Discord server and meet the community of developers, users and players. Indent with tabs (4 spaces) but use spaces for continuation line...

...Algorithm is simple and suitable for large file sets with few differences: basic set of duplicate candidates is determined by file size, then candidates are compared byte-wise. So for files which don't start to differ by growing at the tail it reduces read operations greatly compared to hash-based comparision (i.e. test case: 40GB of files, 16GB RAM, many differences: initial compare (uncached by OS) around 300sec, subsequent compare (relevant file parts cached by OS) ca. 2sec) Note: this program is not related to lsdup