Hi Chapel community ??
I'm working on a GSoC 2020 project, Sequential Data Structures. As part of the
project, I'm proposing Vector and Heap.
Vector is a kind of list storing elements in a contiguous area, which helps
the cache performance, and also requires less space than the current List.
Heap is also called Priority Queue. It's commonly used in many algorithms like
Dijkstra's algorithm.
More details are provided in the issues. I'm looking forward to your
feedback, particularly on the interfaces. I also wonder where should these
structures be. I suppose they can firstly be implemented as separated mason
modules. Then merging can be easy if any would come in as standard/package
modules.
Related Issues:
Vector https://github.com/chapel-lang/chapel/issues/15668
Heap https://github.com/chapel-lang/chapel/issues/15667
Thanks
Yujia Qiao @Rapiz1
_______________________________________________
Chapel-developers mailing list
[email protected]
https://lists.sourceforge.net/lists/listinfo/chapel-developers
