Compare Suite can compare both - related and non-related files. "By keywords" comparison feature highlights common and unique keywords, allowing to compare non-related files. Word-by-word comparison compares files with a common ancestor. Folder comparison function allows to compare two folders and files within it. If you work with plain text, then you can edit compared documents, apply or decline changes. Finally, you can bring comparison details to simple or advanced structured report.


binary newsgroups

multi-threaded programming

java to binary

include-by trees

binary trash

binary files

ancient trees





ExamDiff Pro provides a simple means of performing visual text and binary file and folder comparisons in Windows. It's attractive, easy to use, and offers the tools you need to do the job quickly and thoroughly. It features a double-pane view that allows for side-by-side comparisons, with color-coded line numbers indicating whether each line is added, deleted, or changed. For folder comparisons, just double-click a file to jump to a side-by-side file comparison. You can easily and synchronize edit files either using the built-in editor, or the text editor of your choice by selecting one of the numerous toolbar buttons. ExamDiff Pro contains a substantial number of options to establish its behavioral characteristics. Other features include recursive comparisons, highlighting differences down to the level of words or characters, ability to compare binary files, custom text and HTML reports, search-and-replace (with regular expression support), shell-extension support, creation of directory snapshots for later comparison, word wrapping of long lines, full Unicode support, and custom color and font settings.

Compare Suite:

ExamDiff Pro:


A complete data structures/collection classes library, memory tracing, memory debugging, entry/exit tracing, exception handling, definable memory handlers, built-in threads support and much more. With: * Single, Double, and Circular Linked Lists * AVL Balanced and Threaded Binary Trees * Dynamic Hashing Tables * Stacks, Queues and Dequeues (using arrays or linked lists) * Sets (Pascal implementation, with union, difference, intersection, etc.) * Bags, Tables and Dictionaries * Priority Heaps (uses the MemSL multi-dimensional array allocator) * Priority Search Queue * Data Handling and User Defined Functions * Using Multiple MemSL Data Structures to Index the same Data * Portability * Memory Tracing/Debugging (C Only) * Runtime Memory Tracing/Debugging (C Only) * Definable Memory Handlers (C Only) * Error/Warning Message Handlers * Entry/Exit Source Code Tracing/Debugging * Runtime Entry/Exit Source Code Tracing/Debugging 



Copyright © Online App Box (, All rights reserved.