[FEATURE] simple search engine

SimpleSearchEngine follows the KISS principle and therefor tries not to introduce new datastructures - everything is boilerplate OpenMS code.
Currently, it is intended to help in perfomance measurements on OpenMS data structures and can be used to quickly test new ideas (e.g. scoring functions). On a QExactive dataset it performed similar to XTandem while beeing slower.
There is obviously a lot of room for speed improvements and suggestions are welcome. Changes introduced along with this pull request resulted from changes to `AASequence::operator==` or `operator<=`.
not sure, but could this also be a bottleneck. as far as I understand your hyper score computation has runtime M*log(N) (+ the meta value access, which is quite expensive), where M is the size of your theoretical spectrum and N the size of you experimental spectrum. Using two iterators this should be manageable in M+N