From 4a4d9f3cbe72d3976f2df7053208c671c22c0410 Mon Sep 17 00:00:00 2001
From: Bart Schaefer <barts@users.sourceforge.net>
Date: Tue, 10 Apr 2012 01:17:02 +0000
Subject: 30383, users/16991 (Vaclav), users/17000: Improve speed of
 arrayuniq() by implementing a hash seive algorithm; add test to exercise it.

---
 Test/D04parameter.ztst | 10 ++++++++++
 1 file changed, 10 insertions(+)

(limited to 'Test/D04parameter.ztst')

diff --git a/Test/D04parameter.ztst b/Test/D04parameter.ztst
index 8bc37ff4c..cc2d6aecd 100644
--- a/Test/D04parameter.ztst
+++ b/Test/D04parameter.ztst
@@ -1076,6 +1076,16 @@
 >i
 >willJOYCE
 
+  print -l JAMES${(u)${=:-$(echo yes yes she said yes i will yes she said she will and yes she did yes)}}JOYCE
+0:New hash seive unique algorithm for arrays of more than 10 elements
+>JAMESyes
+>she
+>said
+>i
+>will
+>and
+>didJOYCE
+
   foo=
   print "${${foo}/?*/replacement}"
 0:Quoted zero-length strings are handled properly
-- 
cgit 1.4.1