stdmap - Efficient search for data in multiple hierarchical data structures in C++ -

hello have problem of searching data inside big map created. creating fsm framework. have several conditions should appended transitions (based on following conditions). condition should appended transition between 2 states s1 & s2, if state s1 found in set s1set , state s2 found in set s2set.

since have several conditions each it's pair of sets, created map able check.

std::map<std::set<int>, std::pair<std::set<statearch*>, std::set<statearch*> > > mapbypassconditions; 

the set of ints condition , pair of sets search s1 , s2.

however, feel inefficient because each transition in fsm have go through entire map , search s1 , s2 , check if need append condition it.

do guys have better ideas? perhaps better organization of map?

p.s. using c++98 framework bit old , not yet working newer versions