| … | |
… | |
| 105 | if (cc->c2 == c2) return c1; |
105 | if (cc->c2 == c2) return c1; |
| 106 | cc = (*this)[cc->c1]; |
106 | cc = (*this)[cc->c1]; |
| 107 | } |
107 | } |
| 108 | |
108 | |
| 109 | // check to see whether this combination already exists otherwise |
109 | // check to see whether this combination already exists otherwise |
| 110 | for (cc = v.end (); cc-- > v.begin (); ) |
110 | for (cc = v.begin (); cc < v.end (); cc++) |
| 111 | if (cc->c1 == c1 && cc->c2 == c2) |
111 | if (cc->c1 == c1 && cc->c2 == c2) |
| 112 | return COMPOSE_LO + (cc - v.begin ()); |
112 | return COMPOSE_LO + (cc - v.begin ()); |
| 113 | |
113 | |
| 114 | // allocate a new combination |
114 | // allocate a new combination |
| 115 | if (v.size () == COMPOSE_HI - COMPOSE_LO + 1) |
115 | if (v.size () == COMPOSE_HI - COMPOSE_LO + 1) |
