From e3faeb3bab96810765dae545610698d32799fc8c Mon Sep 17 00:00:00 2001 From: Alexander Medvednikov Date: Sat, 18 Apr 2026 03:13:29 +0300 Subject: [PATCH] builtin: fix name conflict in test --- vlib/builtin/js/map_test.js.v | 22 +++++++++++----------- vlib/builtin/map_test.v | 26 +++++++++++++------------- 2 files changed, 24 insertions(+), 24 deletions(-) diff --git a/vlib/builtin/js/map_test.js.v b/vlib/builtin/js/map_test.js.v index 3a0470f41..1a989a13b 100644 --- a/vlib/builtin/js/map_test.js.v +++ b/vlib/builtin/js/map_test.js.v @@ -2,7 +2,7 @@ // vtest build: present_node? import rand -const strings = unique_strings(200, 10) +const test_strings = unique_strings(200, 10) fn unique_strings(arr_len int, str_len int) []string { mut arr := []string{cap: arr_len} @@ -17,20 +17,20 @@ fn unique_strings(arr_len int, str_len int) []string { fn test_get_and_set_many() { mut m := map[string]int{} - for i, s in strings { + for i, s in test_strings { m[s] = i assert m[s] == i assert m.len == i + 1 } - for i, s in strings { + for i, s in test_strings { assert m[s] == i } - assert m.len == strings.len + assert m.len == test_strings.len } fn test_for_in_many() { mut m := map[string]int{} - for i, s in strings { + for i, s in test_strings { m[s] = i } for k, v in m { @@ -40,24 +40,24 @@ fn test_for_in_many() { fn test_keys_many() { mut m := map[string]int{} - for i, s in strings { + for i, s in test_strings { m[s] = i } keys := m.keys() - assert keys.len == strings.len + assert keys.len == test_strings.len assert keys.len == m.len - assert keys == strings + assert keys == test_strings } fn test_deletes_many() { mut m := map[string]int{} - for i, s in strings { + for i, s in test_strings { m[s] = i } - for i, s in strings { + for i, s in test_strings { m.delete(s) assert m[s] == 0 - assert m.len == strings.len - (i + 1) + assert m.len == test_strings.len - (i + 1) } assert m.len == 0 assert m.keys().len == 0 diff --git a/vlib/builtin/map_test.v b/vlib/builtin/map_test.v index d33f9f639..c2f8e4af9 100644 --- a/vlib/builtin/map_test.v +++ b/vlib/builtin/map_test.v @@ -1,6 +1,6 @@ import rand -const strings = unique_strings(7000, 10) +const test_strings = unique_strings(7000, 10) fn unique_strings(arr_len int, str_len int) []string { mut arr := []string{cap: arr_len} @@ -15,20 +15,20 @@ fn unique_strings(arr_len int, str_len int) []string { fn test_get_and_set_many() { mut m := map[string]int{} - for i, s in strings { + for i, s in test_strings { m[s] = i assert m[s] == i assert m.len == i + 1 } - for i, s in strings { + for i, s in test_strings { assert m[s] == i } - assert m.len == strings.len + assert m.len == test_strings.len } fn test_for_in_many() { mut m := map[string]int{} - for i, s in strings { + for i, s in test_strings { m[s] = i } for k, v in m { @@ -38,34 +38,34 @@ fn test_for_in_many() { fn test_keys_many() { mut m := map[string]int{} - for i, s in strings { + for i, s in test_strings { m[s] = i } keys := m.keys() - assert keys.len == strings.len + assert keys.len == test_strings.len assert keys.len == m.len - assert keys == strings + assert keys == test_strings } fn test_values_many() { mut m := map[string]int{} - for i, s in strings { + for i, s in test_strings { m[s] = i } values := m.values() - assert values.len == strings.len + assert values.len == test_strings.len assert values.len == m.len } fn test_deletes_many() { mut m := map[string]int{} - for i, s in strings { + for i, s in test_strings { m[s] = i } - for i, s in strings { + for i, s in test_strings { m.delete(s) assert m[s] == 0 - assert m.len == strings.len - (i + 1) + assert m.len == test_strings.len - (i + 1) } assert m.len == 0 assert m.keys().len == 0 -- 2.39.5