| ... | ... |
@@ -56,9 +56,9 @@ |
| 56 | 56 |
typedef int Value; |
| 57 | 57 |
|
| 58 | 58 |
private: |
| 59 | 59 |
|
| 60 |
typedef |
|
| 60 |
typedef Item *Vit; |
|
| 61 | 61 |
typedef typename ItemSetTraits<Graph,Item>::template Map<Vit>::Type VitMap; |
| 62 | 62 |
typedef typename ItemSetTraits<Graph,Item>::template Map<int>::Type IntMap; |
| 63 | 63 |
|
| 64 | 64 |
const Graph &_g; |
| ... | ... |
@@ -432,12 +432,12 @@ |
| 432 | 432 |
|
| 433 | 433 |
void initStart() |
| 434 | 434 |
{
|
| 435 | 435 |
_init_lev=0; |
| 436 |
_init_num=_items.begin(); |
|
| 437 |
_first[0]=_items.begin(); |
|
| 438 |
_last_active[0]=_items.begin()-1; |
|
| 439 |
Vit n=_items.begin(); |
|
| 436 |
_init_num=&_items[0]; |
|
| 437 |
_first[0]=&_items[0]; |
|
| 438 |
_last_active[0]=&_items[0]-1; |
|
| 439 |
Vit n=&_items[0]; |
|
| 440 | 440 |
for(typename ItemSetTraits<Graph,Item>::ItemIt i(_g);i!=INVALID;++i) |
| 441 | 441 |
{
|
| 442 | 442 |
*n=i; |
| 443 | 443 |
_where[i]=n; |
| ... | ... |
@@ -474,10 +474,10 @@ |
| 474 | 474 |
{
|
| 475 | 475 |
_first[_init_lev]=_init_num; |
| 476 | 476 |
_last_active[_init_lev]=_init_num-1; |
| 477 | 477 |
} |
| 478 |
_first[_max_level+1]=_items.begin()+_item_num; |
|
| 479 |
_last_active[_max_level+1]=_items.begin()+_item_num-1; |
|
| 478 |
_first[_max_level+1]=&_items[0]+_item_num; |
|
| 479 |
_last_active[_max_level+1]=&_items[0]+_item_num-1; |
|
| 480 | 480 |
_highest_active = -1; |
| 481 | 481 |
} |
| 482 | 482 |
|
| 483 | 483 |
///@} |
0 comments (0 inline)