(in Python) given a list of candidates [ (12, "Dat"), (5, "dat"), (4, "..."), ...] find the Tuple with the Min (1st) tag value

[HenHanna]

(in Python) let's say i have a list of candidates
like this
a= [ (12, "Data1"), (5, "data"), (4, "..."), ...]

and i want to find the Tuple with the Min (1st) tag value.

in Python that's what min() gives, by default.

min(a)


Is this the same in Scheme(Gauche) ?

[B. Pym]

Post by HenHanna
(in Python) let's say i have a list of candidates
like this
a= [ (12, "Data1"), (5, "data"), (4, "..."), ...]
and i want to find the Tuple with the Min (1st) tag value.
in Python that's what min() gives, by default.
min(a)
Is this the same in Scheme(Gauche) ?

(use gauche.collection) ;; find-min

(find-min
'[(12 "Data1") (5 "data") (4 "...")]
:key car)

===>
(4 "...")

[HenHanna]

Post by B. Pym

Post by HenHanna
(in Python) let's say i have a list of candidates
like this
a= [ (12, "Data1"), (5, "data"), (4, "..."), ...]
and i want to find the Tuple with the Min (1st) tag value.
in Python that's what min() gives, by default.
min(a)
Is this the same in Scheme(Gauche) ?

(use gauche.collection) ;; find-min
(find-min
'[(12 "Data1") (5 "data") (4 "...")]
:key car)
===> (4 "...")

thanks.. how is it done in CL (Common Lisp) ?


in Python, this substitution
(go look for the key value in the CAR position
for Tuples and Lists (and what else?))
works in other situations also.


i just realized that i like this so much because
it reminds me of my Mother-Tongue (Assoc in Lisp 1.5)


What other features from LISP 1.5 do i feel nostalgic about?
----- Dotted Pairs, replca, replcd

the name Member, Atom, (memq)

(funarg triple) the name Moses