orbiter 4bd65532da initialization of libraries concurrently (faster start-up) ... git-svn-id: https://svn.berlios.de/svnroot/repos/yacy/trunk@7510 6c8d7289-2bf4-0310-a012-ef5d649a1542		2011-02-22 10:57:38 +00:00
..
AccessTracker.java	- fixed document number limitation for crawls that restrict the number of documents per domain	2011-02-12 00:01:40 +00:00
ContentDomain.java	*) minor changes	2009-12-28 11:06:49 +00:00
DocumentIndex.java	- fixed document number limitation for crawls that restrict the number of documents per domain	2011-02-12 00:01:40 +00:00
IndexAbstracts.java
MediaSnippet.java	- fixed document number limitation for crawls that restrict the number of documents per domain	2011-02-12 00:01:40 +00:00
MetadataRepository.java	* add domaincheck (local/global/domainlist) to urlcleaner	2010-11-06 16:50:33 +00:00
QueryParams.java	modified auto-delete of search failure-words:	2011-01-22 09:46:00 +00:00
RankingProcess.java	replaced more double types with float	2011-02-02 00:22:00 +00:00
RankingProfile.java	- more abstraction (HashMap -> Map)	2010-06-01 13:02:11 +00:00
ReferenceOrder.java	- added a tag cloud to search results (using the topics)	2010-10-15 22:01:39 +00:00
ResultEntry.java	*) cleaning up the code a little bit	2010-11-28 02:57:31 +00:00
ResultFetcher.java	modified auto-delete of search failure-words:	2011-01-22 09:46:00 +00:00
SearchEvent.java	introduction of dht-burst modes: this can expand the number of target peers in some cases where a better heuristic is needed. The problematic cases are either when a muti-word search is made (still a hard case for our term-oriented DHT) or when a network operator wants that all robinson peers are asked. We therefore introduced two new network steering values that switch on more peers during the peer selection. Because the number of peers can now be very large, the number of maximum httpc connections was also increased.	2011-02-13 17:37:28 +00:00
SearchEventCache.java	introduction of dht-burst modes: this can expand the number of target peers in some cases where a better heuristic is needed. The problematic cases are either when a muti-word search is made (still a hard case for our term-oriented DHT) or when a network operator wants that all robinson peers are asked. We therefore introduced two new network steering values that switch on more peers during the peer selection. Because the number of peers can now be very large, the number of maximum httpc connections was also increased.	2011-02-13 17:37:28 +00:00
Segment.java	introduction of dht-burst modes: this can expand the number of target peers in some cases where a better heuristic is needed. The problematic cases are either when a muti-word search is made (still a hard case for our term-oriented DHT) or when a network operator wants that all robinson peers are asked. We therefore introduced two new network steering values that switch on more peers during the peer selection. Because the number of peers can now be very large, the number of maximum httpc connections was also increased.	2011-02-13 17:37:28 +00:00
Segments.java	- a collection of bug fixes and some redesign of the Scanner class	2010-12-16 23:37:21 +00:00
Switchboard.java	initialization of libraries concurrently (faster start-up)	2011-02-22 10:57:38 +00:00
SwitchboardConstants.java	new methods to open a browser	2011-02-14 16:15:14 +00:00
TextSnippet.java	- fixed document number limitation for crawls that restrict the number of documents per domain	2011-02-12 00:01:40 +00:00