01:17 <rick42> pil question: i know i can find member of a list `Lst` that has optimal cost with `(by cost sort Lst)`

01:17 <rick42> (given a `cost` function)

01:17 <rick42> if i want to see which member of `Lst` that is, i can say `(car (by cost sort Lst))`

01:17 <rick42> now: what if there are "ties" (for instance three members of `Lst` have optimal cost)?

01:17 <rick42> what's the best way to return all of them? thanks :)

02:23 <rick42> here's is the code I was playing with that prompted that question:

02:23 <rick42> i'm not happy with the last expression at the top level

02:23 <rick42> (after the comment that says `# Application of the above to find all solutions`)

02:23 <rick42> https://gist.githubusercontent.com/cryptorick/9416392098c0b0e52d6888e49ec6e109/raw/5ac2a8ff3a455db25f528d0144c9ef851cb83ab7/bridge-torch.l

02:23 <rick42> seems that there might be a better way ...

02:23 <rick42> (there's usually a better way in pil that i don't know about :)

02:23 <rick42> anyway, please comment upon any of the code, so I can learn. thanks!

04:53 <Regenaxer> Good morning rick42!

04:54 <Regenaxer> Pehaps 'maxi' and 'filter'?

06:34 <Regenaxer> rick42: How about this http://ix.io/1K0e ?

06:44 <Regenaxer> Or this http://ix.io/1K0f ?

06:45 <Regenaxer> Algorithmically more expensive (depends on 'cost'), but perhaps faster due to less function call overhead

09:14 <tankf33der> o/

09:15 <tankf33der> second night in the row coding in picolisp in sleep. like nightmare. recursion, db and gui. sigh.

09:16 <Regenaxer> Hi tankf33der! Good!! :)

13:39 <rick42> thanks, Regenaxer!

13:40 <rick42> i used the second one :) https://gist.githubusercontent.com/cryptorick/9416392098c0b0e52d6888e49ec6e109/raw/74aee9fd46b0b9c5cbd54bd8846ce46f55baaaaa/bridge-torch.l

13:41 <Regenaxer> :)

13:59 <Regenaxer> I'd prefer that too

14:00 <Regenaxer> yes, 'mini' of course ;)

14:02 <Regenaxer> Instead of '(apply max' I would use @@ after 'maxi'

14:02 <Regenaxer> And constants like

14:02 <Regenaxer> (def 'Costs '((A . 1) (B . 2) (

14:02 <Regenaxer> cold be

14:03 <Regenaxer> (de Costs (A . 1) (B . ...

14:06 <rick42> ok

14:06 <rick42> yes, in fact I did use @@ after mini

14:07 <rick42> ah, you mean in `cost`

14:08 <rick42> got it. thanks

14:09 <Regenaxer> ok, not sure :)

14:46 <rick42> (prob (maxi ...) @@) seems to be slightly faster than (apply (max ...))

15:02 <Regenaxer> Perfect

15:08 <Regenaxer> The basic problem with 'apply' is that it expands the arguments on the stack, so it is expensive in terms of stack space and time (relatively)

15:09 <Regenaxer> So I don't use 'apply' for potentially unlimited lists (short lists are perfectly fine)

17:20 <rick42> got it. thanks again

17:22 <rick42> i now have the `cost` function as:

17:22 <rick42> (let cost-person '((Person) (cdr (assoc Person Costs)))

17:22 <rick42> (de cost (Path)

17:22 <rick42> (sum '((Move) (maxi cost-person Move) @@) Path)))

17:22 <rick42> got rid of the `lookup` function; everything can be localized

17:35 <rick42> tankf33der: you have reached heights in your picolisp journey that i could not hope to reach: literally coding in your sleep. maybe in a few more years of hacking picolisp, you will be able to levitate like Regenaxer does :)

18:00 <tankf33der> pil32 passed tests on gcc 9.1

18:13 <Regenaxer> rick42, if 'Person' is an internal or external symbol, you can replace 'cost-person' with 'get'

18:13 <Regenaxer> (get Costs Person)

18:48 <rick42> so Regenaxer I could "tag" each symbol A, B, C or D with a Cost property?

18:49 <Regenaxer> Yes, that too. But 'get' on a list does a (cdr (asoq ...))

18:49 <Regenaxer> 'asoq' uses '==', so the CARs should be symbols

18:49 <Regenaxer> (or short numbers in pil64)

18:51 <Regenaxer> : (get '((a . 1) (b . 2) (c . 3)) 'b)

18:51 <Regenaxer> -> 2

18:51 <rick42> ok that's looks good

18:52 <Regenaxer> But properties are more general and useful in my tyste

18:52 <Regenaxer> taste

19:13 <rick42> thanks!

19:13 <rick42> :)

19:14 <Regenaxer> :)