Implement traverse Inspired by Haskell for Safe Transformations

[hoangchungk53qx1]

This pull request introduces a new extension function, traverse, inspired by the traverse function in Haskell's Data.Traversable module.
Link : https://hackage.haskell.org/package/base-4.10.0.0/docs/Data-Traversable.html#t:Traversable

The goal is to provide a safe and declarative way to transform collections while handling potential errors gracefully.

functional programming, traverse allows us to apply a function that returns a Result (or any monadic type) to each element of a collection and collect the results into a single Result containing the transformed collection. If any transformation fails, the entire operation short-circuits, returning the first error encountered. This is particularly useful for scenarios where we need to ensure all transformations succeed or fail early on the first error.

[michaelbull]

Thanks for this. I like this idea a lot!

I think we could simplify its implementation, as it shares a lot of structure with fold. It looks to me like traverse could call fold with list::add as the second argument.

[hoangchungk53qx1]

@michaelbull "Yes, I know that fold can be used to do the same thing,
but I want to write an operator that is more expressive in other functional languages."

[michaelbull]

I'm not suggesting that fold does the same thing, just that its implementation is largely shared between fold and traverse, so the new traverse function could call fold in its implementation to avoid duplication.

[hoangchungk53qx1]

@michaelbull That's a good idea. I've just edited it, please check it again.