MultiTreeMap: A TreeMap that allows duplicate keys to be entered.
Supports the java.util.Collections interface and an enhanced Iterator.
Implemented by using a Red-Black Tree.
MPerf will generate structures (not really a hash) to lookup some data, similar to gperf. It works on large key-sets. It will only fail, if there are duplicate keys. It's fast.
Structure Doctor is a little utility that goes through Java source code and finds possible structural flaws, such as too big methods, duplicate code, duplicate class hierarchies etc... Flaw reports are generated in HTML.
same is a tool to find duplicate lines in multiple text files. Very useful to find and fix copy-and-paste programming. It has been designed to be simple, portable, and fast.
A few simple refactoring tools developed according to the KISS principle. The focus is to refactor C++ code but almost any programming language should work. Tools: Rename, Detect duplicate code
...
- it uses the hardware paging system for immediate error detection (most other memory checkers look for modified memory in no mans land)
- it is very fast compared to other hardware memory checkers because it makes fewer changes to the paging tables
- it can track the original release location when debugging duplicate free problems
- it is designed for large scale integration with the ability to call user defined fail functions