*** test program for CIdBList class
initial state:
----- begin
count: 0
current node : <none>
(blist
)
----- end
add one integer:
----- begin
count: 1
current node : 10
(blist
 10
)
----- end
add second and third integer:
----- begin
count: 3
current node : 20
(blist
 10
 20
 30
)
----- end
add children:
----- begin
count: 6
current node : 20
(blist
 10
 20
  40
  50
  60
 30
)
----- end
move next:
----- begin
count: 6
current node : 30
(blist
 10
 20
  40
  50
  60
 30
)
----- end
move prev and move child:
----- begin
count: 6
current node : 40
(blist
 10
 20
  40
  50
  60
 30
)
----- end
insert children:
----- begin
count: 7
current node : 35
(blist
 10
 20
  35
  40
  50
  60
 30
)
----- end
move to tail:
----- begin
count: 7
current node : 60
(blist
 10
 20
  35
  40
  50
  60
 30
)
----- end
move to head:
----- begin
count: 7
current node : 35
(blist
 10
 20
  35
  40
  50
  60
 30
)
----- end
remove:
----- begin
count: 6
current node : 40
(blist
 10
 20
  40
  50
  60
 30
)
----- end
move to root:
----- begin
count: 6
current node : 10
(blist
 10
 20
  40
  50
  60
 30
)
----- end
remove:
----- begin
count: 5
current node : 20
(blist
 20
  40
  50
  60
 30
)
----- end
remove all children:
----- begin
count: 2
current node : 20
(blist
 20
 30
)
----- end

bye
