Hashtables?

[TrevorBradley]

I'm assuming Fenix doesn't have hashtables. Is there any way to do key,value lookups?

I'm thinking there might be a clever way to do it involving the quicksort function and binary tree searches. Set the key value as a Type, sort the keys after each entry is added to the array, then binary search the keys to look for the value. I'm not sure if something else exists in fenix that would make this simpler.

 

[Yos-T]

If you use a tree you don't need to sort. A tree is already sorted.
You could of course implement a hash table yourself if it isn't available in Fenix.