expr-lang/expr

Question: Is there planned support for iterator in version 1.23?

amikai opened this issue ยท 6 comments

Hi @antonmedv

Golang 1.23 will support the iter package and define the type Seq[V any] as an iterator. The expr package supports numerous array functions. I believe iterators will be widely used in many libraries in the future. Is there any plan for these array functions to support not only arrays but also iterators in version 1.23?

Use slice.Values as example

// Values is slices.Values inject by expr.Func
let v = Values([1, 2, 3]);
any(Values, { # > 1}) //  [2, 3]

I understand this example is quite simple and not necessary (because we can directly use the array in any). However, please imagine that the iterator might not be iterating over an array.

Reference

https://tip.golang.org/doc/go1.23
https://pkg.go.dev/iter@master

Hey @amikai

Yes, definitely. I'm going to work on bring support for Go iterators in Expr.

Hi @antonmedv,

Although I am not familiar with the source code for expr, I would like to try working on this feature. If it's convenient for you, could you please explain how to proceed, mention any high-level steps, or reference similar PRs? I will evaluate my capabilities to decide whether to take on this task. If this change affects a large portion of the source code and you prefer to handle it yourself, just let me know.

Sure you can try next things.

First of all find an example of using an iterator and thing what is not working in expr.

Take all as example. I think the implementation like this:

  • all only accept reflect.Array and reflect.Slice as a first element in checker.go. The 1.23 expose reflect.CanSeq, we can leverage on this function to check it is iterable or not.
  • The function with predicate will treat # as PointerNode, I guess it want to use the array (or slice) element in the first parameter, and calculate is true or false. It should point to the value which pulled from iterator.

The built in function with predicate look like directly compile to byte code , that i quite not understand that part (compiler fundamental).

I think I can't help, so I'll leave what I imagined before here. I hope it helps you when you're working on it.

function
all(array | iter.Seq, predicate) โ†’ bool
any(array | iter.Seq, predicate) โ†’ bool
one(array | iter.Seq, predicate) โ†’ bool
none(array | iter.Seq, predicate) โ†’ bool
map(array, predicate) โ†’ array
map(iter.Seq, predicate) โ†’ iter.Seq
filter(array, predicate) โ†’ array
filter(iter.Seq, predicate) โ†’ iter.Seq
find(array | iter.Seq, predicate) โ†’ (element type)
findLast(array | iter.Seq, predicate) โ†’ (element type)
findIndex(array | iter.Seq, predicate) โ†’ int
count(array | iter.Seq, predicate) โ†’ int
concat(array1, array2[, ...]) โ†’ array
concat(seq1, seq2[, ...]) โ†’ iter.Seq
concat(array, [, delimiter]) โ†’ string
concat(iter.Seq, [, delimiter]) โ†’ string
(TODO) reduce
sum(array | iter.Seq) โ†’ int
mean(array | iter.Seq) โ†’ int
meidan(array | iter.Seq) โ†’ int
fist(array | iter.Seq) โ†’ (element type)
last(array | iter.Seq) โ†’ (element type)
take(array, n) โ†’ array
take(iter.Seq, n) โ†’ iter.Seq
reverse(array) โ†’ array
reverse(iter.Seq) โ†’ iter.Seq
sort(array) โ†’ array
sort(iter.Seq) โ†’ iter.Seq

Nice ๐Ÿ‘๐Ÿป

I like how you evaluated all the builtin functions. We can use it to better plan the feature.

One point about map:

map(iter.Seq, predicate) โ†’ iter.Seq

I think map will return array. Not seq. As lazy evaluation is more complicated.

Hi @antonmedv,

I hope you're doing well. I wanted to share my thoughts on the map function for iter.Seq. I believe it is important, and when you're implementing it, it might be worth considering the potential for future support.

For example, a scenario that I think could be beneficial is to prevent exhausting the entire array with a predicate:

any(map(seq, expensive_predicate), predicate)