comparison 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
comparison
equal deleted inserted replaced
755:f6d296c5868e 756:33df05108ba1
25 #: Returns: 25 #: Returns:
26 #: int: 0 if no unexpected storage is left, 1 otherwise 26 #: int: 0 if no unexpected storage is left, 1 otherwise
27 #: 27 #:
28 check_no_alist_artifacts() { 28 check_no_alist_artifacts() {
29 # This are all _farr_alist_XXX_prefix variables 29 # This are all _farr_alist_XXX_prefix variables
30 if set | grep -E -e '^_farr_KV_.*=' -e '^_farr_K_.*=' -e '^_farr_V_.*='; then 30 if set | grep -E -e '^_farr_KV_.*=' -e '^_farr_Kb_.*=' -e '^_farr_Ks_.*=' -e '^_farr_Vs_.*='; then
31 return 1 31 return 1
32 else 32 else
33 return 0 33 return 0
34 fi 34 fi
35 } 35 }