Just another update

Task/Search-a-list/Maxima/search-a-list.maxima

@@ -0,0 +1,9 @@
+haystack: ["Zig","Zag","Wally","Ronald","Bush","Zig","Zag","Krusty","Charlie","Bush","Bozo"];
+needle:  "Zag";
+
+findneedle(needle, haystack, [opt]):=block([idx],
+  idx: sublist_indices(haystack, lambda([w], w=needle)),
+  if emptyp(idx) then throw('notfound),
+  if emptyp(opt) then return(idx),
+  opt: first(opt),
+  if opt='f then first(idx) else if opt='l then last(idx) else throw('unknownmode));

Task/Search-a-list/Python/search-a-list-3.py

@@ -9,5 +9,4 @@
 	if haystack.count(n) == 1:
 		assert hi == haystack.index(n), "index == hi_index if needle occurs only once"
 
-		
 >>>

Task/Search-a-list/UNIX-Shell/search-a-list.sh

@@ -0,0 +1,15 @@
+if [ $1 ];then
+haystack="Zip Zag Wally Ronald Bush Krusty Charlie Bush Bozo"
+
+index=$(echo $haystack|tr " " "\n"|grep -in "^$1$")
+if [ $? = 0 ];then
+quantity_of_hits=$(echo $index|tr " " "\n"|wc -l|tr -d " ")
+first_index=$(echo $index|cut -f 1 -d ":")
+if [ $quantity_of_hits = 1 ];then
+echo The sole index for $1 is: $first_index
+else
+echo The smallest index for $1 is: $first_index
+greatest_index=$(echo $index|tr " " "\n"|tail -1|cut -f 1 -d ":")
+echo "The greatest index for $1 is: $greatest_index";fi
+else echo $1 is absent from haystatck.;fi
+else echo Must provide string to find in haystack.;fi