1
  
2
  
3
  
4
  
5
  
6
  
7
  
8
  
9
  
10
  
11
  
12
  
13
  
14
  
15
  
16
  
17
  
18
  
19
  
20
  
21
  
22
  
23
  
24
  
25
  
26
  
27
  
28
  
29
  
30
  
31
  
32
  
33
  
34
  
35
  
36
  
37
  
38
  
39
  
40
  
41
  
42
  
43
  
44
  
45
  
46
  
47
  
48
  
49
  
50
  
51
  
52
  
53
  
54
  
55
  
56
  
57
  
58
  
59
  
60
  
61
  
62
  
63
  
64
  
65
  
66
  
67
  
68
  
69
  
70
  
71
  
72
  
73
  
74
  
75
  
76
  
77
  
78
  
79
  
80
  
81
  
82
  
83
  
84
  
85
  
86
  
87
  
88
  
89
  
90
  
91
  
92
  
93
  
94
  
95
  
96
  
97
  
98
  
99
  
100
  
101
  
102
  
103
  
104
  
105
  
106
  
107
  
108
  
109
  
110
  
111
  
112
  
113
  
114
  
115
  
116
  
117
  
118
  
119
  
120
  
121
  
122
  
123
  
124
  
125
  
126
  
127
  
128
  
129
  
130
  
131
  
132
  
133
  
134
  
135
  
136
  
137
  
138
  
139
  
140
  
141
  
142
  
143
  
144
  
145
  
146
  
147
  
148
  
149
  
150
  
151
  
152
  
153
  
154
  
155
  
156
  
157
  
158
  
159
  
160
  
161
  
162
  
163
  
164
  
165
  
166
  
167
  
168
  
169
  
170
  
171
  
172
  
173
  
174
  
175
  
176
  
177
  
178
  
179
  
180
  
181
  
182
  
183
  
184
  
185
  
186
  
187
  
188
  
189
  
190
  
191
  
192
  
193
  
194
  
195
  
196
  
197
  
198
  
199
  
200
  
201
  
202
  
203
  
204
  
205
  
206
  
207
  
208
  
209
  
210
  
211
  
212
  
213
  
214
  
215
  
216
  
217
  
218
  
219
  
220
  
221
  
222
  
223
  
224
  
225
  
226
  
227
  
228
  
229
  
230
  
231
  
232
  
233
  
234
  
235
  
236
  
237
  
238
  
239
  
240
  
241
  
242
  
243
  
244
  
245
  
246
  
247
  
248
  
249
  
250
  
251
  
252
  
253
  
254
  
255
  
256
  
257
  
258
  
259
  
260
  
261
  
262
  
263
  
264
  
265
  
266
  
267
  
268
  
269
  
270
  
271
  
272
  
273
  
274
  
275
  
276
  
277
  
278
  
279
  
280
  
281
  
282
  
283
  
284
  
285
  
286
  
287
  
288
  
289
  
290
  
291
  
292
  
293
  
294
  
295
  
296
  
297
  
298
  
299
  
300
  
301
  
302
  
303
  
304
  
305
  
306
  
307
  
308
  
309
  
310
  
311
  
312
  
313
  
314
  
315
  
316
  
317
  
318
  
319
  
320
  
321
  
322
  
323
  
324
  
325
  
326
  
327
  
328
  
329
  
330
  
331
  
332
  
333
  
334
  
335
  
336
  
337
  
338
  
339
  
340
  
341
  
342
  
343
  
344
  
345
  
346
  
347
  
348
  
349
  
350
  
351
  
352
  
353
  
354
  
355
  
356
  
357
  
358
  
359
  
360
  
361
  
362
  
363
  
364
  
365
  
366
  
367
  
368
  
369
  
370
  
371
  
372
  
373
  
374
  
375
  
376
  
377
  
378
  
379
  
380
  
381
  
382
  
383
  
384
  
385
  
386
  
387
  
388
  
389
  
390
  
391
  
392
  
393
  
394
  
395
  
396
  
397
  
398
  
399
  
400
  
401
  
402
  
403
  
404
  
405
  
406
  
407
  
408
  
409
  
410
  
411
  
412
  
413
  
414
  
415
  
416
  
417
  
418
  
419
  
420
  
421
  
422
  
423
  
424
  
425
  
426
  
427
  
428
  
429
  
430
  
431
  
432
  
433
  
434
  
435
  
436
  
437
  
438
  
439
  
440
  
441
  
442
  
443
  
444
  
445
  
446
  
447
  
448
  
449
  
450
  
451
  
452
  
453
  
454
  
455
  
456
  
457
  
458
  
459
  
460
  
461
  
462
  
463
  
464
  
465
  
466
  
467
  
468
  
469
  
470
  
471
  
472
  
473
  
474
  
475
  
476
  
477
  
478
  
479
  
480
  
481
  
482
  
483
  
484
  
485
  
486
  
487
  
488
  
489
  
490
  
491
  
492
  
493
  
494
  
495
  
496
  
497
  
498
  
499
  
500
  
501
  
502
  
503
  
504
  
505
  
506
  
507
  
508
  
509
  
510
  
511
  
512
  
513
  
514
  
515
  
516
  
517
  
518
  
519
  
520
  
521
  
522
  
523
  
524
  
525
  
526
  
527
  
528
  
529
  
530
  
531
  
532
  
533
  
534
  
535
  
536
  
537
  
538
  
539
  
540
  
541
  
542
  
543
  
544
  
545
  
546
  
547
  
548
  
549
  
550
  
551
  
552
  
553
  
554
  
555
  
556
  
557
  
558
  
559
  
560
  
561
  
562
  
563
  
564
  
565
  
566
  
567
  
568
  
569
  
570
  
571
  
572
  
573
  
574
  
575
  
576
  
577
  
578
  
579
  
580
  
581
  
582
  
583
  
584
  
585
  
586
  
587
  
588
  
589
  
590
  
591
  
592
  
593
  
594
  
595
  
596
  
597
  
598
  
599
  
600
  
601
  
602
  
603
  
604
  
605
  
606
  
607
  
608
  
609
  
610
  
611
  
612
  
613
  
614
  
615
  
616
  
617
  
618
  
619
  
620
  
621
  
622
  
623
  
624
  
625
  
626
  
627
  
628
  
629
  
630
  
631
  
632
  
633
  
634
  
635
  
636
  
637
  
638
  
639
  
640
  
641
  
642
  
643
  
644
  
645
  
646
  
647
  
648
  
649
  
650
  
651
  
652
  
653
  
654
  
655
  
656
  
657
  
658
  
659
  
660
  
661
  
662
  
663
  
664
  
665
  
666
  
667
  
668
  
669
  
670
  
671
  
672
  
673
  
674
  
675
  
676
  
677
  
678
  
679
  
680
  
681
  
682
  
683
  
684
  
685
  
686
  
687
  
688
  
689
  
690
  
691
  
692
  
693
  
694
  
695
  
696
  
697
  
698
  
699
  
700
  
701
  
702
  
703
  
704
  
705
  
706
  
707
  
708
  
709
  
710
  
711
  
712
  
713
  
714
  
715
  
716
  
717
  
718
  
719
  
720
  
721
  
722
  
723
  
724
  
725
  
726
  
727
  
728
  
729
  
730
  
731
  
732
  
733
  
734
  
735
  
736
  
737
  
738
  
739
  
740
  
741
  
742
  
743
  
744
  
745
  
746
  
747
  
748
  
749
  
750
  
751
  
752
  
753
  
754
  
755
  
756
  
757
  
758
  
759
  
760
  
761
  
762
  
763
  
764
  
765
  
766
  
767
  
768
  
769
  
770
  
771
  
772
  
773
  
774
  
775
  
776
  
777
  
778
  
779
  
780
  
781
  
782
  
783
  
784
  
785
  
786
  
787
  
788
  
789
  
790
  
791
  
792
  
793
  
794
  
795
  
796
  
797
  
798
  
799
  
800
  
801
  
802
  
803
  
804
  
805
  
806
  
807
  
808
  
809
  
810
  
811
  
812
  
813
  
814
  
815
  
816
  
817
  
818
  
819
  
820
  
821
  
822
  
823
  
824
  
825
  
826
  
827
  
828
  
829
  
830
  
831
  
832
  
833
  
834
  
835
  
836
  
837
  
838
  
839
  
840
  
841
  
842
  
843
  
844
  
845
  
846
  
847
  
848
  
849
  
850
  
851
  
852
  
853
  
854
  
855
  
856
  
857
  
858
  
859
  
860
  
861
  
862
  
863
  
864
  
865
  
866
  
867
  
868
  
869
  
870
  
871
  
872
  
873
  
874
  
875
  
876
  
877
  
878
  
879
  
880
  
881
  
882
  
883
  
884
  
885
  
886
  
887
  
888
  
889
  
890
  
891
  
892
  
893
  
894
  
895
  
896
  
897
  
898
  
899
  
900
  
901
  
902
  
903
  
904
  
905
  
906
  
907
  
908
  
909
  
910
  
911
  
912
  
913
  
914
  
915
  
916
  
917
  
918
  
919
  
920
  
921
  
922
  
923
  
924
  
925
  
926
  
927
  
928
  
929
  
930
  
931
  
932
  
933
  
934
  
935
  
936
  
937
  
938
  
939
  
940
  
941
  
942
  
943
  
944
  
945
  
946
  
947
  
948
  
949
  
950
  
951
  
952
  
953
  
954
  
955
  
956
  
957
  
958
  
959
  
960
  
961
  
962
  
963
  
964
  
965
  
966
  
967
  
968
  
969
  
970
  
971
  
972
  
973
  
974
  
975
  
976
  
977
  
978
  
979
  
980
  
981
  
982
  
983
  
984
  
985
  
986
  
987
  
988
  
989
  
990
  
991
  
992
  
993
  
994
  
995
  
996
  
997
  
998
  
999
  
1000
  
1001
  
1002
  
1003
  
1004
  
1005
  
1006
  
1007
  
1008
  
1009
  
1010
  
1011
  
1012
  
1013
  
1014
  
1015
  
1016
  
1017
  
1018
  
1019
  
1020
  
1021
  
1022
  
1023
  
1024
  
1025
  
1026
  
1027
  
1028
  
1029
  
1030
  
1031
  
1032
  
1033
  
1034
  
1035
  
1036
  
1037
  
1038
  
1039
  
1040
  
1041
  
1042
  
1043
  
1044
  
1045
  
1046
  
1047
  
1048
  
1049
  
1050
  
1051
  
1052
  
1053
  
1054
  
1055
  
1056
  
1057
  
1058
  
1059
  
1060
  
1061
  
1062
  
1063
  
1064
  
1065
  
1066
  
1067
  
1068
  
1069
  
1070
  
1071
  
1072
  
1073
  
1074
  
1075
  
1076
  
1077
  
1078
  
1079
  
1080
  
1081
  
1082
  
1083
  
1084
  
1085
  
1086
  
1087
  
1088
  
1089
  
1090
  
1091
  
1092
  
1093
  
1094
  
1095
  
1096
  
1097
  
1098
  
1099
  
1100
  
1101
  
1102
  
1103
  
1104
  
1105
  
1106
  
1107
  
1108
  
1109
  
1110
  
1111
  
1112
  
1113
  
1114
  
1115
  
1116
  
1117
  
1118
  
1119
  
1120
  
1121
  
1122
  
1123
  
1124
  
1125
  
1126
  
1127
  
1128
  
1129
  
1130
  
1131
  
1132
  
1133
  
1134
  
1135
  
1136
  
1137
  
1138
  
1139
  
1140
  
1141
  
1142
  
1143
  
1144
  
1145
  
1146
  
1147
  
1148
  
1149
  
1150
  
1151
  
1152
  
1153
  
1154
  
1155
  
1156
  
1157
  
1158
  
1159
  
1160
  
1161
  
1162
  
1163
  
1164
  
1165
  
1166
  
1167
  
1168
  
1169
  
1170
  
1171
  
1172
  
1173
  
1174
  
1175
  
1176
  
1177
  
1178
  
1179
  
1180
  
1181
  
1182
  
1183
  
1184
  
1185
  
1186
  
1187
  
1188
  
1189
  
1190
  
1191
  
1192
  
1193
  
1194
  
1195
  
1196
  
1197
  
1198
  
1199
  
1200
  
1201
  
1202
  
1203
  
1204
  
1205
  
1206
  
1207
  
1208
  
1209
  
1210
  
1211
  
1212
  
1213
  
1214
  
1215
  
1216
  
1217
  
1218
  
1219
  
1220
  
1221
  
1222
  
1223
  
1224
  
1225
  
1226
  
1227
  
1228
  
1229
  
1230
  
1231
  
1232
  
1233
  
1234
  
1235
  
1236
  
1237
  
1238
  
1239
  
1240
  
1241
  
1242
  
1243
  
1244
  
1245
  
1246
  
1247
  
1248
  
1249
  
1250
  
1251
  
1252
  
1253
  
1254
  
1255
  
1256
  
1257
  
1258
  
1259
  
1260
  
1261
  
1262
  
1263
  
1264
  
1265
  
1266
  
1267
  
1268
  
1269
  
1270
  
1271
  
1272
  
1273
  
1274
  
1275
  
1276
  
1277
  
1278
  
1279
  
1280
  
1281
  
1282
  
1283
  
1284
  
1285
  
1286
  
1287
  
1288
  
1289
  
1290
  
1291
  
1292
  
1293
  
1294
  
1295
  
1296
  
1297
  
1298
  
1299
  
1300
  
1301
  
1302
  
1303
  
1304
  
1305
  
1306
  
1307
  
1308
  
1309
  
1310
  
1311
  
1312
  
1313
  
1314
  
1315
  
1316
  
1317
  
1318
  
1319
  
1320
  
1321
  
1322
  
1323
  
1324
  
/* -*- c -*- 
|| This file is part of Pike. For copyright information see COPYRIGHT. 
|| Pike is distributed under GPL, LGPL and MPL. See the file COPYING 
|| for more information. 
*/ 
 
#include "global.h" 
 
#include "object.h" 
#include "svalue.h" 
#include "array.h" 
#include "pike_error.h" 
#include "interpret.h" 
#include "stralloc.h" 
#include "program.h" 
#include "pike_types.h" 
#include "pike_embed.h" 
 
#include "program_id.h" 
 
#include "module_support.h" 
#include "sequence.h" 
#include "circular_list.h" 
 
 
 
 
/*! @module ADT 
 */ 
 
 
DECLARATIONS 
 
/*! @class CircularList 
 *! This is an circular list implemented by an array. It has a constant time 
 *! complexity for pop and push. It has a limited max size but it can be 
 *! increased with the method allocate. 
 *! 
 */ 
 
PIKECLASS CircularList 
{ 
 
  CVAR int pos; 
  CVAR struct array *a; 
  CVAR int size; 
 
 
  //if there is more than one reference to this array copy it. 
 
  static inline void should_copy(void) 
  { 
    if (THIS->a->refs > 1) 
    { 
      free_array(THIS->a); 
      THIS->a = copy_array(THIS->a); 
    } 
  } 
 
 
  //convert an index in the circular list to the index in the underlaying array 
  //add the pos and take modulo of the size 
  static inline int circ2array(int index) 
    { 
      return (index+THIS->pos)%THIS->a->size; 
    } 
 
  //convert an index in the underlaying array to the array in the circular list 
  static inline int array2circ(int index) 
    { 
      return (index-THIS->pos)%THIS->a->size; 
    } 
 
 
 
/*! @decl mixed `[](int index) 
 *! Index operator 
 *! 
 *! @param index 
 *!   The index to get the value for, could be negative to index from the end. 
 *! 
 *! @returns 
 *!   The value at the index @[index] 
 *! 
 *! @throws 
 *!   An error if the index is out of range. 
 */ 
 
  PIKEFUN mixed `[](int index) { 
    struct svalue ind; 
    FIX_AND_CHECK_INDEX(index, THIS->size, 0); 
    SET_SVAL(ind, T_INT, NUMBER_NUMBER, integer, circ2array(index)); 
    simple_array_index_no_free(Pike_sp, THIS->a, &ind); 
    Pike_sp++; 
  } 
 
 
/*! @decl mixed `[]=(int index, mixed value) 
 *! Index assign operator. 
 *! Set the value at the index @[index] to be @[value] 
 *! 
 *! @param index 
 *!   The index to set 
 *! 
 *! @param value 
 *!   The new value 
 *! 
 *! @returns 
 *!   The new value at the index @[index] 
 *! 
 *! @throws 
 *!   An error if the index is out of range. 
 */ 
 
  PIKEFUN mixed `[]=(int index, mixed value) { 
    struct svalue ind; 
    FIX_AND_CHECK_INDEX(index, THIS->size, 0); 
    SET_SVAL(ind, T_INT, NUMBER_NUMBER, integer, circ2array(index)); 
    should_copy(); 
    simple_set_index(THIS->a, &ind, value); 
    pop_n_elems(args); 
  } 
 
 
/*! @decl CircularList `+(CircularList ... coll) 
 *! Addition operator 
 *! 
 *! Append the content of this CircularList and @@@[coll] and 
 *! return the results as a new @[CircularList]. 
 *! 
 *! @param coll 
 *!   The lists to append to this list 
 *! 
 *! @returns 
 *!   The result of the append as a new @[CircularList]. 
 */ 
 
 
  PIKEFUN object `+(object ... coll) 
  { 
    struct array *a; 
    struct CircularList_struct *tmpList; 
    int start=0; 
    int i; 
    ptrdiff_t sz = THIS->size; 
 
    for (i=0; i < args; i++) { 
      // FIXME: Ought to work on collection classes too 
      if (coll[i].u.object->prog == CircularList_program) 
      { 
        tmpList = OBJ2_CIRCULARLIST(coll[i].u.object); 
        sz += tmpList->size; 
      } 
      else 
      { 
        SIMPLE_ARG_TYPE_ERROR("`+",i+1,"ADT.CircularList"); 
      } 
    } 
 
    /* Allocate double the space, so that we can grow. */ 
    push_array(a = allocate_array_no_init(sz*2, 0)); 
 
    a->type_field = 0; 
 
    for (i = -1; i < args; i++) { 
      if (i >= 0) { 
        tmpList = OBJ2_CIRCULARLIST(coll[i].u.object); 
      } else { 
        tmpList = THIS; 
      } 
      a->type_field |= tmpList->a->type_field; 
 
      if (tmpList->pos + tmpList->size > tmpList->a->size) { 
        //if the list pass the end of the array do it in two parts 
        int tmp = tmpList->a->size - tmpList->pos; 
 
        assign_svalues_no_free(ITEM(a)+start, 
                               ITEM(tmpList->a) + tmpList->pos, 
                               tmp, 
                               tmpList->a->type_field); 
 
        assign_svalues_no_free(ITEM(a)+(tmp+start), 
                               ITEM(tmpList->a), 
                               tmpList->size-tmp, 
                               tmpList->a->type_field); 
      } else { 
        //just do it direct 
 
        assign_svalues_no_free(ITEM(a)+start, 
                               ITEM(tmpList->a) + tmpList->pos, 
                               tmpList->size, 
                               tmpList->a->type_field); 
      } 
      start += tmpList->size; 
    } 
 
    //put the added array in a CircularList and return it 
    { 
      struct object *o=clone_object(CircularList_program, 1); 
      OBJ2_CIRCULARLIST(o)->size = sz; 
 
      push_object(o); 
    } 
  } 
 
 
  /*! @decl int(0..1) _equal(mixed coll) 
   *! 
   *! @returns 
   *!   Returns @tt{true@} if the object @[coll] is a @[CircularList] 
   *!   and contains the same values in the same order. 
   */ 
 
 
  PIKEFUN int(0..1) _equal(mixed coll) 
  { 
    if (TYPEOF(*coll) == T_OBJECT && 
        coll->u.object->prog == CircularList_program) 
    { 
      struct CircularList_struct *list = OBJ2_CIRCULARLIST(coll->u.object); 
      struct processing curr; 
      INT32 e; 
      INT32 a_pos = THIS->pos; 
      INT32 b_pos = list->pos; 
      struct array *a = THIS->a; 
      struct array *b = list->a; 
 
      if(a == b) RETURN 1; 
      if(THIS->size != list->size) RETURN 0; 
      if(!THIS->size) RETURN 1; 
 
#ifdef PIKE_DEBUG 
      if(d_flag > 1) 
        { 
          array_check_type_field(a); 
          array_check_type_field(b); 
        } 
#endif 
 
      /* This could be done much better if I KNEW that 
       * the type fields didn't contain types that 
       * really aren't in the array 
       */ 
      if(!(a->type_field & b->type_field) && 
     !( (a->type_field | b->type_field) & BIT_OBJECT )) 
        RETURN 0; 
 
      curr.pointer_a = a; 
      curr.pointer_b = b; 
      curr.next = 0; 
 
 
      for(e=0; e<THIS->size; e++) 
      { 
        if (a_pos >= a->size) 
        { 
          a_pos=0; 
        } 
        if (b_pos >= b->size) 
        { 
          b_pos=0; 
        } 
        if(!low_is_equal(ITEM(a)+a_pos, ITEM(b)+b_pos, &curr)) 
          RETURN 0; 
        a_pos++; 
        b_pos++; 
      } 
      RETURN 1; 
    } 
    RETURN 0; 
  } 
 
  /*! @decl array _indices() 
   *! 
   *! @returns 
   *!   The indices in this list as an array. 
   */ 
 
  PIKEFUN array _indices() 
  { 
    ptrdiff_t size = THIS->size; 
    struct array *a; 
 
    a=allocate_array_no_init(size,0); 
    while(--size>=0) 
    { 
      ITEM(a)[size].u.integer = (INT_TYPE)size; 
    } 
    a->type_field = BIT_INT; 
    RETURN a; 
  } 
 
/*! @decl void _insert_element(int index, mixed value) 
 *! Insert an element in the list at the position @[index], the value 
 *! at the position @[index] and all above will have their index increased 
 *! by one. 
 *! 
 *! @param index 
 *!   The index to insert the value at. 
 *! 
 *! @param value 
 *!   The new value. 
 *! 
 *! @throws 
 *!   An error if the index is out of range. 
 *! 
 */ 
 
  PIKEFUN void _insert_element(int index, mixed value) 
  { 
    FIX_AND_CHECK_INDEX(index, THIS->size, 0); 
    should_copy(); 
    index = circ2array(index); 
    THIS->a = array_insert(THIS->a, value, index); 
    THIS->size++; 
 
  } 
 
/*! @decl mixed _remove_element(int index) 
 *!  Remove the values at index @[index] from the list. 
 *! 
 *! @param index 
 *!   The index to remove. 
 *! 
 *! @returns 
 *!   The removed value. 
 *! 
 *! @throws 
 *!   An error if the index is out of range. 
 */ 
 
  PIKEFUN mixed _remove_element(int index) 
  { 
    struct svalue s; 
 
    FIX_AND_CHECK_INDEX(index, THIS->size, 0); 
 
    index = circ2array(index); 
    s = *(THIS->a->item + index); 
    should_copy(); 
    THIS->a = array_remove(THIS->a, index); 
    THIS->size--; 
    push_svalue(&s); 
  } 
 
 
/*! @decl int _search(mixed value, void|int start) 
 *!   Search the list for a specific value. Return the index of the first 
 *!   value that is equal to @[value]. If no value was found @expr{UNDEFINED@} 
 *!   is returned instead 
 *! 
 *! @param value 
 *!   The value to find 
 *! 
 *! @param start 
 *!   If a start value is supplied it will start searching at the index 
 *!   @[start]. 
 *! 
 *! @returns 
 *!   Returns the index of the found value or @expr{UNDEFINED@}. 
 *! 
 *! @throws 
 *!   An error if the start is out of range. 
 */ 
 
  PIKEFUN int _search(mixed value, void|int start) 
  { 
    int s; 
    int retval; 
    if(start) 
    { 
      if (TYPEOF(*start) != PIKE_T_INT) 
      { 
        SIMPLE_ARG_TYPE_ERROR("_search",2,"int"); 
      } 
      if(start->u.integer <0 || start->u.integer>=THIS->size) { 
        if (THIS->a->size) { 
          Pike_error("Start %"PRINTPIKEINT"d is out of array range 0 - %d.\n", 
                     start->u.integer, 
                   THIS->size-1); 
        } else { 
          Pike_error("Attempt to index the empty array with %"PRINTPIKEINT"d.\n", 
                     start->u.integer); 
        } 
      } 
      s = circ2array(start->u.integer); 
      retval = array2circ(array_search(THIS->a, value, s)); 
    } 
    else 
    { 
      retval = array2circ(array_search(THIS->a,value,0)); 
    } 
    if (retval >= THIS->size || retval < 0) 
    { 
      retval = -1; 
    } 
    RETURN retval; 
 
  } 
 
/*! @decl int _sizeof() 
 *! 
 *! @returns 
 *!   The number of elements in this list. 
 */ 
 
  PIKEFUN int _sizeof() 
  { 
    RETURN THIS->size; 
  } 
 
  /*! @decl array _values() 
   *! 
   *! @returns 
   *!   The values in this list as an array. 
   */ 
 
  PIKEFUN array _values() 
  { 
    struct array *a; 
    int end; 
    int tmp; 
 
    a=allocate_array_no_init(THIS->size, 0); 
    a->type_field = THIS->a->type_field; 
    end = circ2array(THIS->size); 
 
    if (end <= THIS->pos && THIS->size > 0) 
    { 
      //if the list pass the end of the array do it in two parts 
      tmp = THIS->a->size - THIS->pos; 
 
      assign_svalues_no_free(ITEM(a), ITEM(THIS->a) + THIS->pos, 
                             tmp, THIS->a->type_field); 
 
      assign_svalues_no_free(ITEM(a)+tmp, ITEM(THIS->a), 
                             THIS->size-tmp, THIS->a->type_field); 
    } 
    else 
    { 
      //just do it direct 
 
      assign_svalues_no_free(ITEM(a), ITEM(THIS->a) + THIS->pos, 
                             THIS->size, THIS->a->type_field); 
    } 
    RETURN a; 
  } 
 
 
/*! @decl void add(mixed value) 
 *!   Add a value at the front of the list 
 *! 
 *! @param value 
 *!   The value to add. 
 *! 
 *! @throws 
 *!   An error if the list is full. 
 */ 
 
  PIKEFUN void add(mixed value) 
  { 
    struct svalue ind; 
    if (THIS->size == THIS->a->size) 
    { 
      Pike_error("The list is full, could not add value, please allocate more space.\n"); 
    } 
    should_copy(); 
    THIS->pos--; 
    if (THIS->pos < 0) 
    { 
      THIS->pos=THIS->a->size-1; 
    } 
    SET_SVAL(ind, T_INT, NUMBER_NUMBER, integer, THIS->pos); 
    simple_set_index(THIS->a, &ind, value); 
    THIS->size++; 
  } 
 
  /*! @decl void allocate(int elements) 
   *! Increase the maxsize of the CircularlList. 
   *! 
   *! @param elements 
   *!       Add this number of new elements to the list. 
   */ 
 
  PIKEFUN void allocate(int elements) 
  { 
    INT32 size = THIS->a->size+elements; 
    INT32 endpos = THIS->a->size - THIS->pos; //distanse of pos from the end 
    if (elements <= 0) 
    { 
      Pike_error("Allocate expects a value larger than zero.\n"); 
    } 
    if(THIS->a->refs <= 1 && THIS->a->malloced_size >= size) 
    { 
      THIS->a->size = size; 
      if (THIS->size > 0) 
      { 
        memmove(ITEM(THIS->a)+(size-endpos), 
                ITEM(THIS->a)+(THIS->pos), 
                (endpos) * sizeof(struct svalue)); 
        THIS->pos = size-endpos; 
      } 
      while(elements) { 
        SET_SVAL(ITEM(THIS->a)[THIS->pos - elements], T_INT, NUMBER_NUMBER, 
                 integer, 0); 
        elements--; 
      } 
      THIS->a->type_field |= BIT_INT; 
    } 
    else 
    { 
      struct array *a; 
      a=allocate_array_no_init(size,  (THIS->a->size >> 1) + 4); 
      a->type_field = THIS->a->type_field; 
      if (THIS->size >0) 
      { 
        //copy from pos to end 
        assign_svalues_no_free(ITEM(a), 
                               ITEM(THIS->a)+(THIS->pos), 
                               endpos, 
                               THIS->a->type_field); 
        //copy from start to size 
        assign_svalues_no_free(ITEM(a)+endpos, 
                               ITEM(THIS->a), 
                               THIS->size-endpos, 
                               THIS->a->type_field); 
      } 
      free_array(THIS->a); 
      THIS->a=a; 
      THIS->pos=0; 
    } 
  } 
 
/*! @decl array cast(string type) 
 *! Cast operator. 
 *! 
 *! @param type 
 *!   Casts to this type. 
 *! 
 *!   Casts to the following types are supported: 
 *!   @string 
 *!     @value "array" 
 *!       Cast the content of this list to an array. 
 *!   @endstring 
 *! 
 *! @returns 
 *!   An array with the contents of this list. 
 */ 
 
  PIKEFUN array cast(string type) 
    flags ID_PROTECTED; 
  { 
    pop_n_elems(args); /* type as at least one more reference. */ 
    if (type == literal_array_string) 
    { 
      struct array *a; 
      int end; 
      int tmp; 
 
      a=allocate_array_no_init(THIS->size, 0); 
      a->type_field = THIS->a->type_field; 
      end = circ2array(THIS->size); 
 
      if (end < THIS->pos) 
      { 
        //if the list pass the end of the array do it in two parts 
        tmp = THIS->a->size - THIS->pos; 
 
        assign_svalues_no_free(ITEM(a), ITEM(THIS->a) + THIS->pos, 
                               tmp, THIS->a->type_field); 
 
        assign_svalues_no_free(ITEM(a)+tmp, ITEM(THIS->a), 
                               THIS->size-tmp, THIS->a->type_field); 
      } 
      else 
      { 
        //just do it direct 
 
        assign_svalues_no_free(ITEM(a), ITEM(THIS->a) + THIS->pos, 
                             THIS->size, THIS->a->type_field); 
      } 
      push_array(a); 
 
    } 
    else 
      push_undefined(); 
  } 
 
  /*! @decl void clear() 
   *!   Clear the contents of the list. 
   *! 
   */ 
 
  PIKEFUN void clear() 
  { 
    int oldsize; 
    should_copy(); 
    oldsize = THIS->a->size; 
    THIS->a = resize_array(THIS->a, 0); 
    THIS->a = resize_array(THIS->a, oldsize); 
    THIS->size =0; 
    THIS->pos  =0; 
  } 
 
  /*! @decl int delete_value(mixed value) 
   *!   Remove the first occurrence of the value @[value] from the list. 
   *! 
   *! @param value 
   *!   The value to remove from the list. 
   *! 
   *! @returns 
   *!   The index of the removed element or -1 if there was no value to 
   *!   remove. 
   */ 
 
  PIKEFUN int delete_value(mixed value) 
  { 
    INT32 index = array_search(THIS->a, value, THIS->pos); 
    INT32 pos = array2circ(index); 
    if (pos < THIS->size && index > -1) 
    { 
      should_copy(); 
      THIS->a = array_remove(THIS->a, index); 
      THIS->size--; 
      RETURN pos; 
    } 
    else 
    { 
      RETURN -1; 
    } 
  } 
 
  /*! @decl int(0..1) is_empty() 
   *! 
   *! @returns 
   *!   Returns @expr{1@} if the list is empty otherwise @expr{0@}. 
   */ 
 
  PIKEFUN int(0..1) is_empty() 
  { 
    RETURN !(THIS->size); 
  } 
 
  /*! @decl int max_size() 
   *! 
   *! @returns 
   *!   Returns the maximal size of this list. 
   */ 
 
  PIKEFUN int max_size() 
  { 
    RETURN THIS->a->size; 
  } 
 
  /*! @decl mixed peek_back() 
   *! 
   *! @returns 
   *!    The value at the back of the list but do not remove it from the list. 
   */ 
 
 PIKEFUN mixed peek_back() 
  { 
    struct svalue ind; 
    if (THIS->size <= 0) 
    { 
      Pike_error("Can not peek an empty list.\n"); 
    } 
    SET_SVAL(ind, T_INT, NUMBER_NUMBER, integer, circ2array(THIS->size-1)); 
    simple_array_index_no_free(Pike_sp, THIS->a, &ind); 
    Pike_sp++; 
  } 
 
  /*! @decl mixed peek_front() 
   *! 
   *! @returns 
   *!    The value at the front of the list but do not remove it from the list. 
   */ 
 
  PIKEFUN mixed peek_front() 
  { 
    struct svalue ind; 
    if (THIS->size == 0) 
    { 
      Pike_error("Can not peek an empty list.\n"); 
    } 
    SET_SVAL(ind, T_INT, NUMBER_NUMBER, integer, THIS->pos); 
    simple_array_index_no_free(Pike_sp, THIS->a, &ind); 
    Pike_sp++; 
  } 
 
  /*! @decl mixed pop_back() 
   *! 
   *! Remove the value at the back of the list and return it. 
   *! 
   *! @returns 
   *!    The value at the back of the list. 
   */ 
 
  PIKEFUN mixed pop_back() 
  { 
    struct svalue ind; 
    struct svalue zero; 
    if (THIS->size <= 0) 
    { 
      Pike_error("Can not pop an empty list.\n"); 
    } 
 
    should_copy(); 
    THIS->size--; 
    SET_SVAL(ind, T_INT, NUMBER_NUMBER, integer, circ2array(THIS->size)); 
    SET_SVAL(zero, T_INT, NUMBER_NUMBER, integer, 0); 
    simple_array_index_no_free(Pike_sp, THIS->a, &ind); 
    simple_set_index(THIS->a, &ind, &zero); 
    Pike_sp++; 
  } 
 
 
  /*! @decl mixed pop_front() 
   *! 
   *! Remove the value at the front of the list and return it. 
   *! 
   *! @returns 
   *!    The value at the front of the list. 
   */ 
 
  PIKEFUN mixed pop_front() 
  { 
    struct svalue ind; 
    struct svalue zero; 
    if (THIS->size == 0) 
    { 
      Pike_error("Can not pop an empty list.\n"); 
    } 
 
    should_copy(); 
    SET_SVAL(ind, T_INT, NUMBER_NUMBER, integer, THIS->pos); 
    SET_SVAL(zero, T_INT, NUMBER_NUMBER, integer, 0); 
    if (++THIS->pos >= THIS->a->size) 
    { 
      THIS->pos = 0; 
    } 
    THIS->size--; 
    simple_array_index_no_free(Pike_sp, THIS->a, &ind); 
    simple_set_index(THIS->a, &ind, &zero); 
    Pike_sp++; 
  } 
 
 
  /*! @decl void push_back(mixed value) 
   *! 
   *! Add a new value at the end of the list. 
   *! 
   *! @param value 
   *!    The value to add. 
   */ 
 
  PIKEFUN void push_back(mixed value) 
  { 
    struct svalue ind; 
    should_copy(); 
    if (THIS->size == THIS->a->size) 
    { 
      Pike_error("The list is full, could not add value, please allocate more memory.\n"); 
    } 
 
    SET_SVAL(ind, T_INT, NUMBER_NUMBER, integer, circ2array(THIS->size)); 
    THIS->size++; 
    simple_set_index(THIS->a, &ind, value); 
  } 
 
 
  /*! @decl void push_front(mixed value) 
   *! 
   *! Add a new value at the end of the list. 
   *! 
   *! @param value 
   *!    The value to add. 
   */ 
 
  PIKEFUN void push_front(mixed value) 
  { 
    struct svalue ind; 
    if (THIS->size == THIS->a->size) 
    { 
      Pike_error("The list is full, could not add value, please allocate more space.\n"); 
    } 
    should_copy(); 
    THIS->pos--; 
    if (THIS->pos < 0) 
    { 
      THIS->pos=THIS->a->size-1; 
    } 
    SET_SVAL(ind, T_INT, NUMBER_NUMBER, integer, THIS->pos); 
    simple_set_index(THIS->a, &ind, value); 
    THIS->size++; 
  } 
 
 
  /*! @decl void create(array|int arg) 
   *!   Creates a new @[CircularList] around the array arg or a new 
   *!   @[CircularList] with the maximum size of arg. 
   */ 
 
  PIKEFUN void create(array|int arg) 
  { 
    if (TYPEOF(*arg) == T_INT) 
    { 
      THIS->a =allocate_array_no_init(arg->u.integer, 0); 
      THIS->a->type_field = BIT_INT; 
    } 
    else if (TYPEOF(*arg) == T_ARRAY) 
    { 
      add_ref(THIS->a=arg->u.array); 
      THIS->size=THIS->a->size; 
    } 
  } 
 
  /*! @decl CircularListIterator _get_iterator(void|int ind) 
   *!   Create and initiate a new CircularListIterator that could be used 
   *!   to iterate over this list. 
   *! 
   *! @param ind 
   *!   If an @[ind] value is supplied the iterator will be positioned at 
   *!   that index. 
   *! 
   *! @returns 
   *!   An iterator. 
   */ 
 
 
 
  /*! @decl CircularListIterator first() 
   *!   Create and initiate a new CircularListIterator that could be used 
   *!   to iterate over this list. 
   *! 
   *! @returns 
   *!   An iterator positioned at the first element in the list. 
   */ 
 
 
  /*! @decl CircularListIterator last() 
   *!   Create and initiate a new CircularListIterator that could be used 
   *!   to iterate over this list. 
   *! 
   *! @returns 
   *!   An iterator positioned after the last element in the list. 
   */ 
 
 
  INIT 
  { 
    THIS->a=NULL; 
    THIS->pos=0; 
    THIS->size=0; 
  } 
 
  EXIT 
    gc_trivial; 
  { 
    if( THIS->a ) 
    { 
      free_array(THIS->a); 
      THIS->a = NULL; 
    } 
  } 
 
 
 
  /*! @class CircularListIterator 
   *!    This is the iterator for the CircularList. It implements the 
   *!    IndexIterator and the OutputIterator. 
   */ 
 
  PIKECLASS CircularListIterator 
  { 
    CVAR int pos; 
    CVAR struct CircularList_struct *list; 
    CVAR struct object *obj; 
 
 
  /*! @decl void create(object list, void|int start) 
   *!   Creates a new iterator for the CircularList @[list]. If @[start] is 
   *!   supplied it will try to position the iterator at @[start]. 
   *! 
   */ 
 
    PIKEFUN void create(object list, void|int start) 
    { 
 
      if (list->prog != CircularList_program) 
      { 
        SIMPLE_ARG_TYPE_ERROR("create",1,"ADT.CircularList"); 
      } 
      else 
      { 
        THIS->list = OBJ2_CIRCULARLIST(list); 
        add_ref(THIS->obj = list); 
        if (start) // if there was an start index supplied 
        { 
          THIS->pos=start->u.integer; 
          if (THIS->list->a && ((THIS->pos > THIS->list->size) 
                                   || (THIS->pos < 0))) 
          { 
              Pike_error("Index %d is out of array range 0 - %d.\n", 
                         THIS->pos, 
                         THIS->list->size); 
          } 
        } 
        else 
        { 
          THIS->pos = 0; 
        } 
      } 
    } 
 
    /*! @decl int index() 
     *! 
     *! @returns 
     *!    The index at the current position. 
     */ 
 
    PIKEFUN int index() 
    { 
      if(!THIS->list || 
         !THIS->list->a || 
         THIS->pos >= THIS->list->size) 
      { 
        push_undefined(); 
      } 
      else 
      { 
        RETURN THIS->pos; 
      } 
    } 
 
 
    /*! @decl mixed value() 
     *! 
     *! @returns 
     *!    The value at the current position. 
     */ 
 
    PIKEFUN mixed value() 
    { 
      if(!THIS->list || 
         !THIS->list->a || 
         THIS->pos >= THIS->list->size) 
      { 
        push_undefined(); 
      } 
      else 
      { 
        push_svalue(THIS->list->a->item + 
                    (THIS->pos+THIS->list->pos)%THIS->list->a->size); 
      } 
    } 
 
 
    /*! @decl CircularListIterator `+(int steps) 
     *!   Move the iterator @[steps] steps forward (negative value on @[steps] 
     *!   will cause the iterator to move backwards) and return the result 
     *!   as a new iterator. 
     *! @returns 
     *!    A new iterator positioned @[steps] steps forward. 
     */ 
 
    PIKEFUN object `+(int steps) 
    { 
      struct object *o=fast_clone_object(CircularList_CircularListIterator_program); 
      struct CircularList_CircularListIterator_struct *new; 
      new = OBJ2_CIRCULARLIST_CIRCULARLISTITERATOR(o); 
      new[0]=*THIS; 
      add_ref(THIS->obj); 
      new->pos+=steps; 
      if (new->pos < 0) 
      { 
        new->pos = 0; 
      } 
      else if (new->pos > new->list->size) 
      { 
        new->pos = new->list->size; 
      } 
      RETURN o; 
    } 
 
    /*! @decl CircularListIterator `+=(int steps) 
     *!   Move this iterator @[steps] steps forward (negative value on @[steps] 
     *!   will cause the iterator to move backwards) and return the result. 
     *! 
     *! @returns 
     *!    This iterator positioned @[steps] steps forward. 
     */ 
 
 
    PIKEFUN object `+=(int steps) 
    { 
      THIS->pos+=steps; 
      if (THIS->pos < 0) 
      { 
        THIS->pos = 0; 
      } 
      else if (THIS->pos > THIS->list->size) 
      { 
        THIS->pos = THIS->list->size; 
      } 
 
      REF_RETURN Pike_fp->current_object; 
    } 
 
 
 
    /*! @decl CircularListIterator `-(int steps) 
     *!   Move the iterator @[steps] steps backwards (negative value on 
     *!   @[steps] will cause the iterator to move forwards) and return 
     *!   the result as a new iterator. 
     *! @returns 
     *!    A new iterator positioned @[steps] steps backwards. 
     */ 
 
    PIKEFUN object `-(int steps) 
    { 
      struct object *o=fast_clone_object(CircularList_CircularListIterator_program); 
      struct CircularList_CircularListIterator_struct *new; 
      new = OBJ2_CIRCULARLIST_CIRCULARLISTITERATOR(o); 
      new[0]=*THIS; 
      add_ref(THIS->obj); 
      new->pos-=steps; 
      if (new->pos < 0) 
      { 
        new->pos = 0; 
      } 
      else if (new->pos > new->list->size) 
      { 
        new->pos = new->list->size; 
      } 
      RETURN o; 
    } 
 
 
    /*! @decl int(0..1) has_next(void|int steps) 
     *! @returns 
     *!    Returns @tt{true@} if it is possible to move @[steps] steps 
     *!    forwards, if @[steps] weren't supplied it check if it is 
     *!    possible to move one step forward. 
     */ 
 
    PIKEFUN int(0..1) has_next(void|int steps) 
    { 
      if (!steps) 
      { 
        RETURN (THIS->list && 
                (THIS->pos + 1) <= THIS->list->size); 
      } 
      else 
      { 
        RETURN (THIS->list && 
                (THIS->pos + steps->u.integer) >= 0 && 
                (THIS->pos + steps->u.integer) <= THIS->list->size); 
      } 
    } 
 
 
    /*! @decl int(0..1) has_previous(void|int steps) 
     *! @returns 
     *!    Returns @tt{true@} if it is possible to move @[steps] steps 
     *!    backwards, if @[steps] weren't supplied it check if it is 
     *!    possible to move one step backward. 
     */ 
 
    PIKEFUN int(0..1) has_previous(void|int steps) 
    { 
      if (!steps) 
      { 
        RETURN (THIS->list && 
                (THIS->pos) > 0); 
      } 
      else 
      { 
        RETURN (THIS->list && 
                (THIS->pos - steps->u.integer) >= 0 && 
                (THIS->pos - steps->u.integer) <= THIS->list->size); 
      } 
    } 
 
 
    /*! @decl int(0..1) `!() 
     *! @returns 
     *!    Returns @tt{false@} if the iterator has reached the end. 
     */ 
 
    PIKEFUN int(0..1) `!() 
    { 
      RETURN (THIS->list && 
              THIS->pos  == THIS->list->size); 
    } 
 
 
    /*! @decl int(0..1) _equal(mixed iter) 
     *!    Compare this iterator with another iterator. 
     *! 
     *! @param iter 
     *!    The iterator to compare with 
     *! @returns 
     *!    Returns @tt{true@} if both iterators iterates over the same 
     *!    objects and are positioned at the same spot. 
     */ 
 
    PIKEFUN int(0..1) _equal(mixed iter) 
    { 
      if (TYPEOF(*iter) == T_OBJECT && 
          iter->u.object->prog == CircularList_CircularListIterator_program) 
      { 
        struct CircularList_CircularListIterator_struct *i = 
          OBJ2_CIRCULARLIST_CIRCULARLISTITERATOR(iter->u.object); 
        RETURN (THIS->list == i->list && THIS->pos == i->pos); 
      } 
      else 
      { 
        RETURN 0; 
      } 
    } 
 
 
    /*! @decl int(0..1) `<(mixed iter) 
     *!    Less then operator 
     *! 
     *! @returns 
     *!    Returns @tt{true@} if this iterator has a lower index 
     *!    then @[iter]. 
     */ 
 
    PIKEFUN int(0..1) `<(mixed iter) 
    { 
      if (TYPEOF(*iter) == T_OBJECT && 
          iter->u.object->prog == CircularList_CircularListIterator_program) 
      { 
        struct CircularList_CircularListIterator_struct *i = 
          OBJ2_CIRCULARLIST_CIRCULARLISTITERATOR(iter->u.object); 
        RETURN (THIS->pos < i->pos); 
      } 
      else 
      { 
        SIMPLE_ARG_TYPE_ERROR("`<",1,"ADT.CircularList.CircularListIterator"); 
      } 
    } 
 
 
    /*! @decl int(0..1) `>(mixed iter) 
     *!    Greater then operator 
     *! 
     *! @returns 
     *!    Returns @tt{true@} if this iterator has a higher index 
     *!    then @[iter]. 
     */ 
 
 
    PIKEFUN int(0..1) `>(mixed iter) 
    { 
      if (TYPEOF(*iter) == T_OBJECT && 
          iter->u.object->prog == CircularList_CircularListIterator_program) 
      { 
        struct CircularList_CircularListIterator_struct *i = 
          OBJ2_CIRCULARLIST_CIRCULARLISTITERATOR(iter->u.object); 
        RETURN (THIS->pos > i->pos); 
      } 
      else 
      { 
        SIMPLE_ARG_TYPE_ERROR("`>",1,"ADT.CircularList.CircularListIterator"); 
      } 
    } 
 
    /*! @decl int distance(object iter) 
     *! 
     *! @param iter 
     *!    The iterator to measure the distance to. 
     *! @returns 
     *!    Returns distance between this iterator and @[iter]. 
     *! @throws 
     *!    An error if the two iterator could not be compared. 
     */ 
 
    PIKEFUN int distance(object iter) 
    { 
      if (iter->prog == CircularList_CircularListIterator_program) 
      { 
 
        struct CircularList_CircularListIterator_struct *i = 
          OBJ2_CIRCULARLIST_CIRCULARLISTITERATOR(iter); 
        RETURN (i->pos - THIS->pos); 
      } 
      else 
      { 
        SIMPLE_ARG_TYPE_ERROR("`-",1,"ADT.CircularList.CircularListIterator"); 
      } 
    } 
 
    /*! @decl CircularList get_collection() 
     *! 
     *! @returns 
     *!    Returns the CircularList this iterator currently iterates over. 
     */ 
 
 
    PIKEFUN object get_collection() 
    { 
      REF_RETURN THIS->obj; 
    } 
 
 
    /*! @decl mixed set_value(mixed val) 
     *!    Set the value at the current position. 
     *! 
     *! @param val 
     *!    The new value 
     *! @returns 
     *!    Returns the old value 
     */ 
 
 
    PIKEFUN mixed set_value(mixed val) 
    { 
      if (THIS->list && 
          THIS->pos < THIS->list->size) 
      { 
        struct svalue ind; 
        struct svalue retval; 
 
        //if there is someone else using the array but the list 
        if (THIS->list->a->refs > 1) 
        { 
          //copy it 
          free_array(THIS->list->a); 
          THIS->list->a = copy_array(THIS->list->a); 
        } 
 
        SET_SVAL(ind, T_INT, NUMBER_NUMBER, integer, 
                 (THIS->pos+THIS->list->pos)%THIS->list->a->size); 
        simple_array_index_no_free(&retval, THIS->list->a, &ind); 
        simple_set_index(THIS->list->a, &ind, val); 
        push_svalue(&retval); 
      } 
      else 
      { 
        push_undefined(); 
      } 
    } 
 
    INIT 
    { 
      THIS->list=0; 
      THIS->pos=0; 
      THIS->obj = NULL; 
    } 
 
    EXIT 
      gc_trivial; 
    { 
      if( THIS->obj ) 
      { 
        free_object(THIS->obj); 
        THIS->obj = NULL; 
      } 
    } 
 
  } 
 
  //End CircularListIterator 
  /*! @endclass 
  */ 
 
  PIKEFUN object _get_iterator(void|int ind) 
  { 
    ref_push_object(Pike_fp->current_object); 
    if (ind) 
    { 
      push_svalue(ind); 
    } 
    push_object(clone_object(CircularList_CircularListIterator_program, 
                             args+1)); 
  } 
 
 
 
  PIKEFUN object first() 
  { 
    ref_push_object(Pike_fp->current_object); 
    push_object(clone_object(CircularList_CircularListIterator_program, 1)); 
  } 
 
 
 
  PIKEFUN object last() 
  { 
    struct svalue ind; 
    SET_SVAL(ind, T_INT, NUMBER_NUMBER, integer, THIS_CIRCULARLIST->size); 
    ref_push_object(Pike_fp->current_object); 
    push_svalue(&ind); 
    push_object(clone_object(CircularList_CircularListIterator_program, 2)); 
  } 
 
 
} 
 
 
//End of CircularList 
/*! @endclass 
  */ 
 
/*! @endmodule 
 */ 
 
 
void pike_init_CircularList_module(void) 
{ 
  INIT; 
} 
 
void pike_exit_CircularList_module(void) 
{ 
  EXIT 
}