- Timestamp:
- Jul 25, 2025, 3:29:48 PM (2 months ago)
- Branches:
- master
- Children:
- 1eea589f, 29c6a7d
- Parents:
- 7640ff5
- File:
-
- 1 edited
Legend:
- Unmodified
- Added
- Removed
-
doc/theses/mike_brooks_MMath/benchmarks/list/observation.c
r7640ff5 r7806f91 61 61 printSuccs(leash - 1); 62 62 } 63 static void explore(int here ) {63 static void explore(int here, unsigned int leash) { 64 64 bobs_seek(here); 65 65 if (!bobs_hasCurrent()) { … … 68 68 } 69 69 bobs_movePrev(); 70 printPreds( 2);70 printPreds(leash); 71 71 72 72 bobs_seek(here); … … 75 75 76 76 bobs_moveNext(); 77 printSuccs( 2);77 printSuccs(leash); 78 78 } 79 79 static void exploreRange(int validFrom, int validTo) { … … 95 95 } 96 96 97 explore(listFirstmost); 97 printf(" v%d..%d ", listFirstmost, listLastmost); 98 99 explore(listFirstmost, 6); 98 100 printf(" ..."); 99 if (gapsize > 5) {100 explore(midpoint);101 printf(" ...");102 }103 explore(listLastmost );101 // if (gapsize > 5) { 102 // explore(midpoint); 103 // printf(" ..."); 104 // } 105 explore(listLastmost, 6); 104 106 } 105 107 … … 108 110 printf("%8zd + ? (rolling over)\n", bobs_ops_completed); 109 111 } else { 110 printf("%8zd + %6d/2 + %6d/2 ", bobs_ops_completed, bobs_prog_inserting, bobs_prog_removing);112 printf("%8zd + %6d/2 + %6d/2, %6d@e %6d_u", bobs_ops_completed, bobs_prog_inserting, bobs_prog_removing, bobs_prog_removing_end, *bobs_prog_rem_pos); 111 113 112 114 int validFrom, validTo; … … 114 116 case stack: 115 117 validFrom = 0; 116 validTo = MIN((signed)bobs_prog_inserting-1, (signed)NumNodes - (signed) bobs_prog_removing- 1);118 validTo = MIN((signed)bobs_prog_inserting-1, (signed)NumNodes - (signed)*bobs_prog_rem_pos - 1); 117 119 break; 118 120 case queue: 119 validFrom = (signed) bobs_prog_removing;121 validFrom = (signed)*bobs_prog_rem_pos; 120 122 validTo = (signed)bobs_prog_inserting-1; 121 123 break;
Note:
See TracChangeset
for help on using the changeset viewer.