orbiter 62ac73a108 fixed bugs and deadlocks in core database indexing structures: ... - added new Array class that contains an abstraction of the java Arrrays class which replaces the home-brew quicksort algorithm. - the new class is about four times slower than the old one, but it works correct (the old one had errors) - fixed a synchronization problem git-svn-id: https://svn.berlios.de/svnroot/repos/yacy/trunk@7842 6c8d7289-2bf4-0310-a012-ef5d649a1542		2011-07-16 10:08:43 +00:00
..
BinSearch.java	- enhanced ybr ranking computation	2011-05-26 10:57:02 +00:00
BufferedObjectIndex.java	changed handling of RowSet element retrieval: until today all elements had been copied from the underlying byte[] arrays into a new Entry object that again had a copy of a portion of that byte[] in its own bye[]. There was an option to just refer to the underlying byte[] with a pointer but that was almost never used. This commit now changes an interface to the Row class where it is now necessary to tell if a copy is always required. Fortunately the copy is only needed in very rare cases. That means that this change should cause much less memory allocation; it is expected that this happens especially during search situations.	2011-07-15 08:38:10 +00:00
Cache.java	changed handling of RowSet element retrieval: until today all elements had been copied from the underlying byte[] arrays into a new Entry object that again had a copy of a portion of that byte[] in its own bye[]. There was an option to just refer to the underlying byte[] with a pointer but that was almost never used. This commit now changes an interface to the Row class where it is now necessary to tell if a copy is always required. Fortunately the copy is only needed in very rare cases. That means that this change should cause much less memory allocation; it is expected that this happens especially during search situations.	2011-07-15 08:38:10 +00:00
Column.java	always try to guess the size of a StringBuilder to prevent too many memory re-allocations	2011-03-09 09:29:05 +00:00
HandleMap.java	changed handling of RowSet element retrieval: until today all elements had been copied from the underlying byte[] arrays into a new Entry object that again had a copy of a portion of that byte[] in its own bye[]. There was an option to just refer to the underlying byte[] with a pointer but that was almost never used. This commit now changes an interface to the Row class where it is now necessary to tell if a copy is always required. Fortunately the copy is only needed in very rare cases. That means that this change should cause much less memory allocation; it is expected that this happens especially during search situations.	2011-07-15 08:38:10 +00:00
HandleSet.java	*) set SVN properties	2011-03-08 01:51:51 +00:00
Index.java	changed handling of RowSet element retrieval: until today all elements had been copied from the underlying byte[] arrays into a new Entry object that again had a copy of a portion of that byte[] in its own bye[]. There was an option to just refer to the underlying byte[] with a pointer but that was almost never used. This commit now changes an interface to the Row class where it is now necessary to tell if a copy is always required. Fortunately the copy is only needed in very rare cases. That means that this change should cause much less memory allocation; it is expected that this happens especially during search situations.	2011-07-15 08:38:10 +00:00
IndexTest.java	hack to reduce resource contention caused by massive UTF8 decodings which use java.nio resources:	2011-05-27 08:24:54 +00:00
RAMIndex.java	changed handling of RowSet element retrieval: until today all elements had been copied from the underlying byte[] arrays into a new Entry object that again had a copy of a portion of that byte[] in its own bye[]. There was an option to just refer to the underlying byte[] with a pointer but that was almost never used. This commit now changes an interface to the Row class where it is now necessary to tell if a copy is always required. Fortunately the copy is only needed in very rare cases. That means that this change should cause much less memory allocation; it is expected that this happens especially during search situations.	2011-07-15 08:38:10 +00:00
RAMIndexCluster.java	changed handling of RowSet element retrieval: until today all elements had been copied from the underlying byte[] arrays into a new Entry object that again had a copy of a portion of that byte[] in its own bye[]. There was an option to just refer to the underlying byte[] with a pointer but that was almost never used. This commit now changes an interface to the Row class where it is now necessary to tell if a copy is always required. Fortunately the copy is only needed in very rare cases. That means that this change should cause much less memory allocation; it is expected that this happens especially during search situations.	2011-07-15 08:38:10 +00:00
Row.java	fixed bugs and deadlocks in core database indexing structures:	2011-07-16 10:08:43 +00:00
RowCollection.java	fixed bugs and deadlocks in core database indexing structures:	2011-07-16 10:08:43 +00:00
RowSet.java	fixed bugs and deadlocks in core database indexing structures:	2011-07-16 10:08:43 +00:00
RowSpaceExceededException.java	*) set SVN properties	2011-03-08 01:51:51 +00:00