Berry: is there a sort() method for list class? Google AI summary for search "tasmota berry sort list" suggests that?

[forumlw06]

Hi,

is Googles AI inventing things here? The official Berry docs do not mention a sort() method for lists (although it would be very useful).

How would i sort a list (without implementing myself)?

Thanks!

[s-hadinger]

Nope. Berry doesn't have a native sort function. This is pure hallucination.

One better way is to attach a PDF export of the Berry language reference
berry-readthedocs-io-en-latest.pdf

By the way, the short reference is here: https://berry.readthedocs.io/en/latest/source/en/berry_short_manual.html

[forumlw06]

Thanks, for the confirmation! I love AI ;-)

I was reading the docs, but wanted to check with real experts.

[sfromis]

The AI results you got are clearly "inspired" by Python with the parameter syntax reverse=True

Here's a simple example to sort a list:

def sort(l)
  # insertion sort
  for i:1..size(l)-1
    var k = l[i]
    var j = i
    while (j > 0) && (l[j-1] > k)
      l[j] = l[j-1]
      j -= 1
    end
    l[j] = k
  end
  return l
end

[forumlw06]

Thanks sfromis! Will try that if i have larger lists. My list was only 3 values, so i managed by a small hack (would not work for larger lists though)

[Noschvie]

Is there anything wrong with having a native sort function in Berry?

[s-hadinger]

Putting a generalized sort requires many sub-options: asc/desc, compare function, extraction of sort attribute, in place or copy... Which makes it suboptimal and slow compared to ad-hoc sorting function.

So it was a design choice from the creator of Berry to not provide it.

[sfromis]

Users can get most of that flexibility with a sort function allowing for a comparator function, which can manage extraction and direction. Like this:

  static def listsort(l, c)
    c = c ? c : /e1,e2 -> e1 > e2
    for i:1..l.size()-1
      var k = l[i]
      var j = i
      while (j > 0) && c(l[j-1], k)
        l[j] = l[j-1]
        j -= 1
      end
      l[j] = k
    end
    return l
  end

The default comparator function here is /e1,e2 -> e1 > e2, but simple to embellish on.

[Noschvie]

All clear, thank you.