Add toSeq to several collections' module

Heap, Queue, RandomAccessList, Vector

Author: jackfoxy

src/FSharpx.Core/Collections/Deque2.fsi

@@ -139,7 +139,7 @@ module Deque =
     ///O(1) amortized, O(n), worst case. Returns the first element and tail.
     val inline uncons : Deque<'T> -> 'T * Deque<'T>
 
-    ///O(n). Returns a seq of the deque elements.
+    ///O(n). Views the given deque as a sequence.
     val inline toSeq  : Deque<'T> ->  seq<'T>
 
     ///O(1) amortized, O(n), worst case. Returns option first element and tail.

src/FSharpx.Core/Collections/Heap.fs

@@ -207,6 +207,8 @@ module Heap =
 
     let inline tryTail (xs: Heap<'T>) = xs.TryTail()
 
+    let inline toSeq (xs: Heap<'T>) = xs :> seq<'T>
+
     let inline uncons (xs: Heap<'T>) = xs.Uncons()
 
     let inline tryUncons (xs: Heap<'T>) = xs.TryUncons()

src/FSharpx.Core/Collections/Heap.fsi

@@ -85,7 +85,7 @@ module Heap =
     ///O(log n) amortized time. Returns heap option from merging two heaps.
     val inline tryMerge : Heap<'T> -> Heap<'T> -> Heap<'T> option
 
-    ///O(n). Returns heap from the sequence.
+    ///O(n). Returns heap, bool isDescending, from the sequence.
     val ofSeq : bool -> seq<'T> -> Heap<'T>
 
     ///O(n). Returns heap reversed.
@@ -97,6 +97,9 @@ module Heap =
     ///O(log n) amortized time. Returns option heap of the elements trailing the head.
     val inline tryTail : Heap<'T> -> Heap<'T> option
 
+    ///O(n). Views the given heap as a sequence.
+    val inline toSeq  : Heap<'T> ->  seq<'T>
+
     ///O(log n) amortized time. Returns the head element and tail.
     val inline uncons : Heap<'T> -> 'T * Heap<'T>
 

src/FSharpx.Core/Collections/Queue.fs

@@ -127,6 +127,8 @@ module Queue =
 
     let inline tryTail (q : Queue<'T>) = q.TryTail
 
+    let inline toSeq (q: Queue<'T>) = q :> seq<'T>
+
     let inline uncons (q : Queue<'T>) = q.Uncons
 
     let inline tryUncons (q : Queue<'T>) = q.TryUncons

src/FSharpx.Core/Collections/Queue.fsi

@@ -89,6 +89,9 @@ module Queue =
     ///O(1) amortized, O(n) worst-case. Returns option queue of the elements trailing the first element
     val inline tryTail : Queue<'T> -> Queue<'T> option
 
+    ///O(n). Views the given queue as a sequence.
+    val inline toSeq  : Queue<'T> ->  seq<'T>
+
     ///O(1) amortized, O(n) worst-case. Returns the first element and tail.
     val inline uncons : Queue<'T> -> 'T * Queue<'T>
 

src/FSharpx.Core/Collections/RandomAccessList.fs

@@ -390,6 +390,8 @@ module RandomAccessList =
 
     let inline tryTail (randomAccessList :'T RandomAccessList) = randomAccessList.TryTail
 
+    let inline toSeq (randomAccessList: 'T RandomAccessList) = randomAccessList :> seq<'T>
+
     let inline uncons (randomAccessList :'T RandomAccessList) = randomAccessList.Uncons
 
     let inline tryUncons (randomAccessList :'T RandomAccessList) = randomAccessList.TryUncons

src/FSharpx.Core/Collections/RandomAccessList.fsi

@@ -103,6 +103,9 @@ module RandomAccessList =
     /// O(n). Returns option random access list without the last item.
     val inline tryTail : RandomAccessList<'T> -> RandomAccessList<'T> option
 
+    ///O(n). Views the given random access list as a sequence.
+    val inline toSeq  : RandomAccessList<'T> ->  seq<'T>
+
     /// O(1). Returns tuple last element and random access list without last item
     val inline uncons : RandomAccessList<'T> -> 'T * RandomAccessList<'T>
 

src/FSharpx.Core/Collections/Vector.fs

@@ -443,6 +443,8 @@ module Vector =
 
     let inline singleton (x : 'T) = empty |> conj x
 
+    let inline toSeq (vector: Vector<'T>) = vector :> seq<'T>
+
     let inline unconj (vector: Vector<'T>) = vector.Unconj
 
     let inline tryUnconj (vector: Vector<'T>) = vector.TryUnconj

src/FSharpx.Core/Collections/Vector.fsi

@@ -119,6 +119,9 @@ module Vector =
     /// O(1). Returns a new vector of one element.   
     val inline singleton : 'T -> Vector<'T>
 
+    ///O(n). Views the given vector as a sequence.
+    val inline toSeq  : Vector<'T> ->  seq<'T>
+
     /// O(1). Returns tuple last element and vector without last item
     val inline unconj : Vector<'T> -> Vector<'T> * 'T
 

tests/FSharpx.Collections.Tests/HeapTest.fs

@@ -211,6 +211,13 @@ let ``structural equality``() =
 
     l1 = l3 |> should equal false
 
+[<Test>]
+let ``toSeq to list``() =
+    let l = ["f";"e";"d";"c";"b";"a"] 
+    let h = ofSeq true l
+
+    h|> toSeq |> List.ofSeq |> should equal l
+
 [<Test>]
 [<TestCaseSource("intGensStart2")>]
 let ``tryUncons 1 element``(x : obj) =