The methods of the ParallelMultiSearcher class are listed below. For a complete list of ParallelMultiSearcher class members, see the ParallelMultiSearcher Members topic.
![]() | |
![]() | |
![]() | TODO: parallelize this one too |
![]() | |
![]() | Determines whether the specified Object is equal to the current Object. |
![]() | Overloaded. |
![]() | Overloaded. |
![]() | Serves as a hash function for a particular type, suitable for use in hashing algorithms and data structures like a hash table. |
![]() | Return the array of {@link Searchable}s this searches. |
![]() | |
![]() | Gets the Type of the current instance. |
![]() | |
![]() | |
![]() | Overloaded. A search implementation allowing sorting which spans a new thread for each Searchable, waits for each search to complete and merges the results back together. |
![]() | Overloaded. Returns documents matching queryand filter, sorted by sort. |
![]() | Call {@link #subSearcher} instead. |
![]() | Expert: Set the Similarity implementation used by this Searcher. |
![]() | Returns the document number of document nwithin its sub-index. |
![]() | Returns index of the searcher for document nin the array used to construct this searcher. |
![]() | Returns a String that represents the current Object. |
![]() | Allows an Object to attempt to free resources and perform other cleanup operations before the Object is reclaimed by garbage collection. |
![]() | Creates a shallow copy of the current Object. |
![]() | Create weight in multiple index scenario. Distributed query processing is done in the following steps: 1. rewrite query 2. extract necessary terms 3. collect dfs for these terms from the Searchables 4. create query weight using aggregate dfs. 5. distribute that weight to Searchables 6. merge results Steps 1-4 are done here, 5+6 in the search() methods |
![]() |