diff tests/testsetup.sh @ 756:33df05108ba1

farray.sh: New implementation alists: searching is done using a binary search now while preserving insertion order. The implementation uses two key lists: The first one is sorted and is used for searching using binary search. The second is a double-linked list and is used for remembering the insertion order.
author Franz Glasner <fzglas.hg@dom66.de>
date Sat, 19 Oct 2024 22:40:11 +0200
parents 45c47bc1f7d2
children 7ead30e3b2f9
line wrap: on
line diff
--- a/tests/testsetup.sh	Fri Oct 18 14:02:18 2024 +0200
+++ b/tests/testsetup.sh	Sat Oct 19 22:40:11 2024 +0200
@@ -27,7 +27,7 @@
 #:
 check_no_alist_artifacts() {
     # This are all _farr_alist_XXX_prefix variables
-    if set | grep -E -e '^_farr_KV_.*=' -e '^_farr_K_.*=' -e '^_farr_V_.*='; then
+    if set | grep -E -e '^_farr_KV_.*=' -e '^_farr_Kb_.*=' -e '^_farr_Ks_.*=' -e '^_farr_Vs_.*='; then
 	return 1
     else
 	return 0