Question

Is there a simple way to implement a fast priority queue in Haskell?

score 2.5k · Answer 1 · 2014-11-25 21:08:09

2.5k

Views

Is there a simple way to implement a fast priority queue in Haskell?

Published on 25 November 2014 at 21:08

score 223 · Answer 2 · 2012-05-21 21:50:52

223

Views

Asymptotic runtimes of InsertionSort and FingerTreeSort

Published on 21 May 2012 at 21:50

score 121 · Answer 3 · 2014-05-15 18:53:49

121

Views

Haskell: Where can I find the other operations from the finger tree paper?

Published on 15 May 2014 at 18:53

score 548 · Answer 4 · 2011-05-01 15:10:24

548

Views

Is there an implementation of a binary search tree annotated with sub-tree size

Published on 01 May 2011 at 15:10

score 424 · Answer 5 · 2011-12-09 19:08:53

424

Views

Finding the Missing 'Reduce' Typeclass from Finger Tree Article

Published on 09 December 2011 at 19:08

score 1.1k · Answer 6 · 2010-06-14 18:25:46

1.1k

Views

String representations: improvements over ropes?

Published on 14 June 2010 at 18:25

score 608 · Answer 7 · 2016-03-12 16:13:43

608

Views

Priority queue with O(1) delete-max, insert-min, and find-min and O(log n) insertion and deletion

Published on 12 March 2016 at 16:13

score 470 · Answer 8 · 2020-03-10 16:30:55

470

Views

How can (<*) be implemented optimally for sequences?

Published on 10 March 2020 at 16:30

score 2.2k · Answer 9 · 2010-10-19 21:30:01

2.2k

Views

What should I use Clojure's finger trees for?

Published on 19 October 2010 at 21:30

score 972 · Answer 10 · 2013-02-10 14:12:49

972

Views

How fast is Data.Sequence.Seq compared to []?

Published on 10 February 2013 at 14:12

score 1.9k · Answer 11 · 2012-06-22 07:16:30

1.9k

Views

Why aren't FingerTrees used enough to have a stable implementation?

Published on 22 June 2012 at 07:16

score 147 · Answer 12 · 2016-10-04 13:55:57

147

Views

Type error when implementing finger trees

Published on 04 October 2016 at 13:55

score 66 · Answer 13 · 2016-03-26 21:33:10

66

Views

Q: Optimized data structure for Branched and Versioned entities

Published on 26 March 2016 at 21:33

score 121 · Answer 14 · 2015-09-24 07:07:00

121

Views

Data.Sequence.Seq lazy parallel Functor instance

Published on 24 September 2015 at 07:07

score 478 · Answer 15 · 2013-03-21 17:53:01

478

Views

Clojure finger trees and flexvec

Published on 21 March 2013 at 17:53

score 153 · Answer 16 · 2019-05-09 14:00:36

153

Views

Fingertree head complexity

Published on 09 May 2019 at 14:00

List Question

Is there a simple way to implement a fast priority queue in Haskell?

Asymptotic runtimes of InsertionSort and FingerTreeSort

Haskell: Where can I find the other operations from the finger tree paper?

Is there an implementation of a binary search tree annotated with sub-tree size

Finding the Missing 'Reduce' Typeclass from Finger Tree Article

String representations: improvements over ropes?

Priority queue with O(1) delete-max, insert-min, and find-min and O(log n) insertion and deletion

How can (<*) be implemented optimally for sequences?

What should I use Clojure's finger trees for?

How fast is Data.Sequence.Seq compared to []?

Why aren't FingerTrees used enough to have a stable implementation?

Type error when implementing finger trees

Q: Optimized data structure for Branched and Versioned entities

Data.Sequence.Seq lazy parallel Functor instance

Clojure finger trees and flexvec

Fingertree head complexity

Trending Questions

Popular # Hahtags

Popular Questions