@@ -15,10 +15,7 @@ pub fn benchSTR(N: usize) !void {
15
15
var allocatorA = arena .allocator ();
16
16
defer arena .deinit ();
17
17
18
- const SL2 = SortedMap ([]const u8 , []const u8 , .set );
19
- var sL : SL2 = .{};
20
-
21
- try sL .init (allocatorG );
18
+ var sL = try SortedMap ([]const u8 , []const u8 , .set ).init (allocatorG );
22
19
defer sL .deinit ();
23
20
24
21
var keys = std .ArrayList ([]const u8 ).init (allocatorA );
@@ -87,7 +84,7 @@ pub fn benchSTR(N: usize) !void {
87
84
// Clear the sL
88
85
assert (sL .size == 98 );
89
86
try sL .clearRetainingCapacity ();
90
- arenaCacheSizeQuery (& sL .cache );
87
+ arenaCacheSizeQuery (& sL .cache_ () );
91
88
92
89
// ------------------ EXCHANGE -------------------//
93
90
// -- read 10, insert 40, remove 40, update 10 -- //
@@ -143,7 +140,7 @@ pub fn benchSTR(N: usize) !void {
143
140
// Clear the sL
144
141
assert (sL .size == 10 );
145
142
try sL .clearRetainingCapacity ();
146
- arenaCacheSizeQuery (& sL .cache );
143
+ arenaCacheSizeQuery (& sL .cache_ () );
147
144
148
145
// --------------- EXCHANGE HEAVY --------------//
149
146
// -- read 1, insert 98, remove 98, update 1 -- //
@@ -199,7 +196,7 @@ pub fn benchSTR(N: usize) !void {
199
196
// Clear the sL
200
197
assert (sL .size == 1 );
201
198
try sL .clearRetainingCapacity ();
202
- arenaCacheSizeQuery (& sL .cache );
199
+ arenaCacheSizeQuery (& sL .cache_ () );
203
200
204
201
// ---------------- RAPID GROW -----------------//
205
202
// -- read 5, insert 80, remove 5, update 10 -- //
@@ -251,29 +248,30 @@ pub fn benchSTR(N: usize) !void {
251
248
// Print stats //
252
249
// Test' individual stats
253
250
try writeStamps ("RG" , N , time );
254
- arenaCacheSizeQuery (& sL .cache );
251
+ arenaCacheSizeQuery (& sL .cache_ () );
255
252
256
253
// ---------------- CLONING -----------------//
257
254
// ------ obtain a clone of the graph ------ //
258
255
259
256
// Clear the time, re-start the timer
260
- time = 0 ;
261
- timer = try std .time .Timer .start ();
262
- start = timer .lap ();
257
+ // time = 0;
258
+ // timer = try std.time.Timer.start();
259
+ // start = timer.lap();
263
260
264
- var clone = try sL .clone ();
265
- defer clone .deinit ();
261
+ // var clone = try sL.clone();
262
+ // defer clone.deinit();
266
263
267
- end = timer .read ();
268
- time += end - | start ;
269
- aggregate += time ;
264
+ // end = timer.read();
265
+ // time += end -| start;
266
+ // aggregate += time;
270
267
271
- // Print stats //
272
- // Test' individual stats
273
- try writeStamps ("CLONE" , clone .size , time );
268
+ // // Print stats //
269
+ // // Test' individual stats
270
+ // try writeStamps("CLONE", clone.size, time);
274
271
275
272
// Aggregate stats
276
- try writeStamps ("aggregate" , N * 4 + clone .size , aggregate );
273
+ // try writeStamps("aggregate", N * 4 + clone.size, aggregate);
274
+ try writeStamps ("aggregate" , N * 4 , aggregate );
277
275
try stdout .print ("\n " , .{});
278
276
}
279
277
@@ -288,10 +286,7 @@ pub fn benchU64(N: usize) !void {
288
286
var allocatorA = arena .allocator ();
289
287
defer arena .deinit ();
290
288
291
- const SL = SortedMap (u64 , u64 , .set );
292
- var sL : SL = .{};
293
-
294
- try sL .init (allocatorG );
289
+ var sL = try SortedMap (u64 , u64 , .set ).init (allocatorG );
295
290
defer sL .deinit ();
296
291
297
292
// try sL.ensureTotalCapacity(N);
@@ -357,7 +352,7 @@ pub fn benchU64(N: usize) !void {
357
352
// Clear the sL
358
353
assert (sL .size == 98 );
359
354
try sL .clearRetainingCapacity ();
360
- arenaCacheSizeQuery (& sL .cache );
355
+ arenaCacheSizeQuery (& sL .cache_ () );
361
356
362
357
// ------------------ EXCHANGE -------------------//
363
358
// -- read 10, insert 40, remove 40, update 10 -- //
@@ -412,7 +407,7 @@ pub fn benchU64(N: usize) !void {
412
407
// Clear the sL
413
408
assert (sL .size == 10 );
414
409
try sL .clearRetainingCapacity ();
415
- arenaCacheSizeQuery (& sL .cache );
410
+ arenaCacheSizeQuery (& sL .cache_ () );
416
411
417
412
// --------------- EXCHANGE HEAVY --------------//
418
413
// -- read 1, insert 98, remove 98, update 1 -- //
@@ -467,7 +462,7 @@ pub fn benchU64(N: usize) !void {
467
462
// Clear the sL
468
463
assert (sL .size == 1 );
469
464
try sL .clearRetainingCapacity ();
470
- arenaCacheSizeQuery (& sL .cache );
465
+ arenaCacheSizeQuery (& sL .cache_ () );
471
466
472
467
// ---------------- RAPID GROW -----------------//
473
468
// -- read 5, insert 80, remove 5, update 10 -- //
@@ -518,29 +513,30 @@ pub fn benchU64(N: usize) !void {
518
513
// Print stats //
519
514
// Test' individual stats
520
515
try writeStamps ("RG" , N , time );
521
- arenaCacheSizeQuery (& sL .cache );
516
+ arenaCacheSizeQuery (& sL .cache_ () );
522
517
523
518
// ---------------- CLONING -----------------//
524
519
// ------ obtain a clone of the graph ------ //
525
520
526
521
// Clear the time, re-start the timer
527
- time = 0 ;
528
- timer = try std .time .Timer .start ();
529
- start = timer .lap ();
522
+ // time = 0;
523
+ // timer = try std.time.Timer.start();
524
+ // start = timer.lap();
530
525
531
- var clone = try sL .clone ();
532
- defer clone .deinit ();
526
+ // var clone = try sL.clone();
527
+ // defer clone.deinit();
533
528
534
- end = timer .read ();
535
- time += end - | start ;
536
- aggregate += time ;
529
+ // end = timer.read();
530
+ // time += end -| start;
531
+ // aggregate += time;
537
532
538
- // Print stats //
539
- // Test' individual stats
540
- try writeStamps ("CLONE" , clone .size , time );
533
+ // // Print stats //
534
+ // // Test' individual stats
535
+ // try writeStamps("CLONE", clone.size, time);
541
536
542
537
// Aggregate stats
543
- try writeStamps ("aggregate" , N * 4 + clone .size , aggregate );
538
+ // try writeStamps("aggregate", N * 4 + clone.size, aggregate);
539
+ try writeStamps ("aggregate" , N * 4 , aggregate );
544
540
try stdout .print ("\n " , .{});
545
541
}
546
542
0 commit comments