Gryphon Data Structures: Difference between revisions
Jump to navigation
Jump to search
Adamcolton (talk | contribs) No edit summary |
Adamcolton (talk | contribs) No edit summary |
||
| Line 9: | Line 9: | ||
=== Channel === | === Channel === | ||
Depending on mutability, I think these will be different from the Go channel. I think you setup a receiver and then create senders. Each sender is a separate but mutable instance. | Depending on mutability, I think these will be different from the Go channel. I think you setup a receiver and then create senders. Each sender is a separate but mutable instance. | ||
=== Hash Map === | |||
Yup. | |||
=== Trees === | |||
* Red/Black | |||
* B | |||
* KT | |||
I think it may be possible to create one general purpose tree. It has a B value where B=1 is a binary tree. It can also be KT by passing the depth into the compare function. | |||
[[Category:Gryphon]] | [[Category:Gryphon]] | ||
Revision as of 12:51, 23 September 2019
Built in
Very little by default. Not even arrays. There is something like a byte array.
Std Lib
Slice/Vector
Need these.
Channel
Depending on mutability, I think these will be different from the Go channel. I think you setup a receiver and then create senders. Each sender is a separate but mutable instance.
Hash Map
Yup.
Trees
- Red/Black
- B
- KT
I think it may be possible to create one general purpose tree. It has a B value where B=1 is a binary tree. It can also be KT by passing the depth into the compare function.