Improve performance by implementing sorting on Transformations

[Voiteh]

Each Container is now HashMap, it should be changed to some simpler implementation with HashMap for Hasher -> Transformer and sorted LinkedList of Mather -> Transformer.
After adding new Matcher -> Transformer to container, it should be resorted with priority (highest at the begging). Now finding algorithm would change, to perform iteration till first matching Transformation is found. This should improve performance as there would be no filtering every time Matcher is being searched for and sorting is moved to registration process.