About Searching Methods

[cmglezpdev]

First, I want to add several methods to the Search class like:

• Search: Returns the position of the first occurrence of an element in the collection.
• Lower bound: Returns the lower limit of the collection.
• Upper bound: Returns the upper limit of the collection.
• Count: returns all positions when the element has an occurrence
• Other methods that you think

These methods would be implemented by all the subclasses that define the different search strategies.

I would also like to implement some methods like in javascript, where the search method receives not an item, but a condition function and be able to evaluate the elements of the collection based on the condition function.

Examples to this are the methods:

• some: Return True if at least one item satisfaces the condition
• filter: Return all the items that satisfaces the condition
• count: the same count method above, but with a function's condition
• Other methods that you think

I don't now if it's a good idea, but for that is that i created this discussion. I need your opinions

UPD: Also, if you have some ideas on how to implement binary search based on a condition function, that would be great. I think that it would be nice to abstract the search for a specific item to a search of one or multiple items based in a function. It would be very useful