Search Results
| Search type | Search syntax |
|---|---|
| Tags | [tag] |
| Exact | "words here" |
| Author |
user:1234 user:me (yours) |
| Score |
score:3 (3+) score:0 (none) |
| Answers |
answers:3 (3+) answers:0 (none) isaccepted:yes hasaccepted:no inquestion:1234 |
| Views | views:250 |
| Code | code:"if (foo != bar)" |
| Sections |
title:apples body:"apples oranges" |
| URL | url:"*.example.com" |
| Saves | in:saves |
| Status |
closed:yes duplicate:no migrated:no wiki:no |
| Types |
is:question is:answer |
| Exclude |
-[tag] -apples |
| For more details on advanced search visit our help page | |
Results tagged with lookup
Search options questions only
not deleted
user 36139
A lookup (table) is an array that replaces run-time computation with a simpler array indexing operation. The savings in terms of processing time can be significant, since retrieving a value from memory is often faster than undergoing an 'expensive' computation or input/output operation. Over time the definition has become less strict, any kind of searching with a key value can be considered a lookup.
35
votes
3
answers
17k
views
Multiple indexes over an in memory collection for faster search
RebuildIndexes();
}
public void RebuildIndexes()
{
if (_lookups.Count > 0)
{
_indexes = new Dictionary<string, ILookup<object, T>>();
foreach (var lookup …
- 453