commit cf4258453e5aa5e1e1b5d807f962c9f1d1cedce6
parent 5d29d3f6a393584d8a7a39796af580d2e6132b4d
Author: walther chen <walther.chen@gmail.com>
Date:   Sun, 23 Mar 2025 20:43:18 +0700

update for c3 0.7.0 tmem() -> tmem

Diffstat:

Mba1b.c3 | 2+-


Mba1d.c3 | 2+-


Mba1f.c3 | 2+-


Mutil-frequency.c3 | 18+++++++++---------


4 files changed, 12 insertions(+), 12 deletions(-)

diff --git a/ba1b.c3 b/ba1b.c3
@@ -44,7 +44,7 @@ fn String[] frequent_words(String text, int k, Allocator alloc= allocator::heap(
 }
 
 fn void test_frequent_words() @test {
-	String[] words = frequent_words("ACGTTGCATGTCGCATGATGCATGAGAGCT", 4, tmem());
+	String[] words = frequent_words("ACGTTGCATGTCGCATGATGCATGAGAGCT", 4, tmem);
 	assert(words.len == 2);
 	assert(words.contains("CATG"));
 	assert(words.contains("GCAT"));
diff --git a/ba1d.c3 b/ba1d.c3
@@ -35,7 +35,7 @@ fn int[] pattern_matching(String pattern, String genome, Allocator alloc = alloc
 }
 
 fn void test_pattern_matching() @test {
-	assert(pattern_matching("ATAT", "GATATATGCATATACTT", tmem()) == {1, 3, 9});
+	assert(pattern_matching("ATAT", "GATATATGCATATACTT", tmem) == {1, 3, 9});
 }
 
 
diff --git a/ba1f.c3 b/ba1f.c3
@@ -50,5 +50,5 @@ fn ulong[] minimum_skew_idxs(String genome, Allocator alloc = allocator::heap())
 }
 
 fn void test_minimum_skew_idxs() @test {
-	assert(minimum_skew_idxs("TAAAGACTGCCGAGAGGCCAACACGAGTGCTAGAACGAGGGGCGTAAACGCGGGTCCGAT", tmem()) == {11, 24});
+	assert(minimum_skew_idxs("TAAAGACTGCCGAGAGGCCAACACGAGTGCTAGAACGAGGGGCGTAAACGCGGGTCCGAT", tmem) == {11, 24});
 }
diff --git a/util-frequency.c3 b/util-frequency.c3
@@ -23,7 +23,7 @@ fn String reverse_complement(String pattern, Allocator alloc = allocator::heap()
 }
 
 fn void test_reverse_complement() @test {
-	assert(reverse_complement("AAAACCCGGT", tmem()) == "ACCGGGTTTT");
+	assert(reverse_complement("AAAACCCGGT", tmem) == "ACCGGGTTTT");
 }
 
 alias FrequencyTable = HashMap{String, int};
@@ -60,7 +60,7 @@ fn String[] clump_finding(
 		clumps.tinit();
 		for (int i = 0; i <= genome.len - region_len; i += 1) {
 			@pool() {
-				FrequencyTable freq_map = frequency_table(genome[i:region_len], k, tmem());
+				FrequencyTable freq_map = frequency_table(genome[i:region_len], k, tmem);
 				freq_map.@each(; String kmer, int count) {
 					if (count >= clump_threshold) {
 						// TODO can probably just use a growable array on small inputs
@@ -77,7 +77,7 @@ fn String[] clump_finding(
 
 fn void test_clump_finding() @test {
     String input = "CGGACTCGACAGATGTGAAGAACGACAATGTGAAGACTCGACACGACAGAGTGAAGAGAAGAGGAAACATTGTAA";
-	assert(clump_finding(input, 5, 50, 4, tmem()) == {"CGACA", "GAAGA"});
+	assert(clump_finding(input, 5, 50, 4, tmem) == {"CGACA", "GAAGA"});
 }
 
 fn int hamming_distance(String s1, String s2) {
@@ -144,7 +144,7 @@ fn void test_approximate_pattern_matching() @test {
 		},
 	};
 	foreach (t : tests) {
-		int[] matches = approximate_pattern_matching(t.pattern, t.genome, t.d, tmem());
+		int[] matches = approximate_pattern_matching(t.pattern, t.genome, t.d, tmem);
 		assert(matches == t.expected, "Expected %s, found %s", t.expected, matches);
 	}
 }
@@ -234,7 +234,7 @@ fn void test_frequent_words_with_mismatches() @test {
 	};
 	foreach (t : tests) {
 		@pool() {
-			String[] matches = frequent_words_with_mismatches(t.text, t.k, t.d, tmem());
+			String[] matches = frequent_words_with_mismatches(t.text, t.k, t.d, tmem);
 			test::expect_equal_slices_sorted(t.expected, matches);
 		};
 	}
@@ -249,7 +249,7 @@ fn void test_frequent_words_with_mismatches_and_rc() @test {
 		},
 	};
 	foreach (t : tests) {
-		String[] matches = frequent_words_with_mismatches_and_rc(t.text, t.k, t.d, tmem());
+		String[] matches = frequent_words_with_mismatches_and_rc(t.text, t.k, t.d, tmem);
 		test::expect_equal_slices_sorted(t.expected, matches);
 	}
 }
@@ -265,8 +265,8 @@ fn String[] neighbors(String pattern, int d, Allocator alloc = allocator::heap()
 	@pool() {
 		DynamicArenaAllocator neighborhood_arena;
 		DynamicArenaAllocator suffix_neighborhood_arena;
-		neighborhood_arena.init(tmem(), 1024);
-		suffix_neighborhood_arena.init(tmem(), 1024);
+		neighborhood_arena.init(tmem, 1024);
+		suffix_neighborhood_arena.init(tmem, 1024);
 		List{String} neighborhood;
 		List{String} suffix_neighborhood;
 		neighborhood.init_with_array(&neighborhood_arena, {"A", "C", "G", "T"});
@@ -357,7 +357,7 @@ fn void test_neighbors() @test {
 		},
 	};
 	foreach (t : tests) {
-		String[] matches = neighbors(t.text, t.d, tmem());
+		String[] matches = neighbors(t.text, t.d, tmem);
 		test::expect_equal_slices_sorted(t.expected, matches);
 	}
 }