-
Notifications
You must be signed in to change notification settings - Fork 1
Algorithms
On this page you can find an explanation of the text manipulation algorithms used in bibref.
For each book in the Bible edition, a linear search will be performed via std::string::find. Since the longest book consists of less than 175000 characters (LXX Psalms) and there is a maximum of 54 books (LXX), the speed is acceptable.
For the given passage, a linear search will be performed in the std::vector of verses. This is usually fast since the maximum number of verses is below 2600 (for LXX Psalms, and below 1600 for other books).
The search will be performed similarly to a passage lookup in the internal database.
For each book in the Bible edition, a linear search will be performed in the std::vector of tokens for the maximum given length to be searched, then each tokenset will be checked if all required tokens are present. Since the longest book consists of less than 35000 tokens (LXX Psalms) and there is a maximum of 54 books (LXX), the speed is acceptable.
The text is retrieved via its starting position and length, hence the operation is immediate.