Mike Hearn f336a89984 Patch 10 from Steves lazy parsing patchset. ... Customize Sha256Hash.hashCode() method to only use first n bytes of the backing array. This provides uniqueness to 256^n combinations. As hashcode is not required to be guaranteed unique this fulfills the contract and reduces hashing time. Use case is for applications that do a lot of mapping by Sha256Hash. Each put and get require several hashcode operations. Cached hashcode is already implemented in 8.patch. Similar changes to this yielded huge performance benefits in poolserverj. There is no point implementing a FastEquals version of equals given the bytes are essentially random and no byte is any more likely unique than another.		2011-10-14 12:39:11 +00:00
..
core	Patch 10 from Steves lazy parsing patchset.	2011-10-14 12:39:11 +00:00
discovery	Fix a typo bug in IrcDiscoveryTest. Patch from Nathan Baulch. Resolves issue 33.	2011-06-30 19:00:52 +00:00
store	Use RandomAccessFile in DiskBlockStore to fix corruption. Resolves issue 76	2011-09-06 20:40:15 +00:00