Changeset - r395:d916b8995e22
« 394:1bab3a
396:b04e43 »
gravatar
alpar (Alpar Juttner)
alpar@cs.elte.hu
Rename markToBottom() to dirtyTopButOne() + better doc (#174)
0 1 0
default
1 file changed with 17 insertions and 19 deletions:
lemon/elevator.h
17
19
↑ Collapse diff ↑
lemon/elevator.h
Show white space 6 line context
... ... 
@@ -382,10 +382,9 @@
382 382 

			




	383
	
	
		
    ///Mark the node as it did not reach the max level


			




	
	383
	
		
    ///Move an inactive item to the top but one level (in a dirty way).


			




	384
	384
	
		

			




	385
	
	
		
    ///Mark the node as it did not reach the max level. It sets the


			




	386
	
	
		
    ///level to the under the max level value. The node will be never


			




	387
	
	
		
    ///more activated because the push operation from the maximum


			




	388
	
	
		
    ///level is forbidden in the push-relabel algorithms. The node


			




	389
	
	
		
    ///should be lifted previously to the top level.


			




	390
	
	
		
    void markToBottom(Item i) {


			




	
	385
	
		
    ///This function moves an inactive item to the top but one level.


			




	
	386
	
		
    ///It makes the underlying datastructure corrupt, so use is only if


			




	
	387
	
		
    ///you really know what it is for.


			




	
	388
	
		
    ///\pre The item is on the top level.


			




	
	389
	
		
    void dirtyTopButOne(Item i) {


			




	391
	390
	
		
      _level[i] = _max_level - 1;


			




	...
	...
	
		
@@ -393,5 +392,5 @@


			




	393
	392
	
		

			




	394
	
	
		
    ///Lift all nodes on and above a level to the top (and deactivate them).


			




	
	393
	
		
    ///Lift all items on and above a level to the top (and deactivate them).


			




	395
	394
	
		

			




	396
	
	
		
    ///This function lifts all nodes on and above level \c l to \c


			




	
	395
	
		
    ///This function lifts all items on and above level \c l to \c


			




	397
	396
	
		
    ///maxLevel(), and also deactivates them.


			




	...
	...
	
		
@@ -751,3 +750,3 @@


			




	751
	750
	
		
    ///Lift the item returned by highestActive() to the top level and


			




	752
	
	
		
    ///deactivates the node.


			




	
	751
	
		
    ///deactivates the item.


			




	753
	752
	
		
    ///


			




	...
	...
	
		
@@ -899,10 +898,9 @@


			




	899
	898
	
		

			




	900
	
	
		
    ///Mark the node as it did not reach the max level


			




	
	899
	
		
    ///Move an inactive item to the top but one level (in a dirty way).


			




	901
	900
	
		

			




	902
	
	
		
    ///Mark the node as it did not reach the max level. It sets the


			




	903
	
	
		
    ///level to the under the max level value. The node will be never


			




	904
	
	
		
    ///more activated because the push operation from the maximum


			




	905
	
	
		
    ///level is forbidden in the push-relabel algorithms. The node


			




	906
	
	
		
    ///should be lifted previously to the top level.


			




	907
	
	
		
    void markToBottom(Item i) {


			




	
	901
	
		
    ///This function moves an inactive item to the top but one level.


			




	
	902
	
		
    ///It makes the underlying datastructure corrupt, so use is only if


			




	
	903
	
		
    ///you really know what it is for.


			




	
	904
	
		
    ///\pre The item is on the top level.


			




	
	905
	
		
    void dirtyTopButOne(Item i) {


			




	908
	906
	
		
      _level.set(i, _max_level - 1);


			




	...
	...
	
		
@@ -910,5 +908,5 @@


			




	910
	908
	
		

			




	911
	
	
		
    ///Lift all nodes on and above a level to the top (and deactivate them).


			




	
	909
	
		
    ///Lift all items on and above a level to the top (and deactivate them).


			




	912
	910
	
		

			




	913
	
	
		
    ///This function lifts all nodes on and above level \c l to \c


			




	
	911
	
		
    ///This function lifts all items on and above level \c l to \c


			




	914
	912
	
		
    ///maxLevel(), and also deactivates them.


			




        

    






    
    



    


    

     
    
0 comments (0 inline)