Databases
StackOverflow2013
Postsdbo
POSorting a 2d-vector by index value into lazy sequence in clojure
 

Note that there are some explanatory texts on larger screens.

plurals
  1. POSorting a 2d-vector by index value into lazy sequence in clojure
    primarykey
    data
    text
    <p>I am reading the Joy Of Clojure and came across an implementation of quick sort that uses lazy sequences to achieve better than O(n log n) performance when only taking the first few cons cells from the lazy sequence. I am trying to get it to work for a 2d array of integers, but I can't quite seem to get it: So far this is what I have: </p> <pre><code>(defn sort-parts2 "Lazy, tail-recursive, incremental quicksort. Works against and creates partitions based on the pivot, defined as 'work'." [work] (lazy-seq (loop [[part &amp; parts] work] (if-let [[pivot &amp; xs] (seq part)] (let [smaller? #(&lt; % pivot)] (recur (list* (filter smaller? xs) pivot (remove smaller? xs) parts))) (when-let [[x &amp; parts] parts] (cons x (sort-parts2 parts))))))) sort.joy=&gt; a [[5 9 0 6 5 1 4 4 8 7] [2 6 8 2 6 7 0 1 8 1] [8 8 0 5 9 9 7 7 1 6] [9 8 5 3 0 2 0 6 9 3] [8 8 5 8 9 8 2 3 8 5] [7 9 2 8 5 6 6 8 3 4] [4 8 2 4 6 6 7 4 4 1] [8 5 1 7 3 0 2 4 2 3] [9 1 2 9 0 1 0 2 2 9] [4 0 2 6 8 5 6 1 7 7]] </code></pre> <p>what I want to get for an input of <code>(sort-parts2 a 0)</code> //index on the first element of the subvectors is: </p> <pre><code> sort.joy=&gt; aSorted [[2 6 8 2 6 7 0 1 8 1] [4 0 2 6 8 5 6 1 7 7] [4 8 2 4 6 6 7 4 4 1] [5 9 0 6 5 1 4 4 8 7] [7 9 2 8 5 6 6 8 3 4] [8 5 1 7 3 0 2 4 2 3] [8 8 0 5 9 9 7 7 1 6] [8 8 5 8 9 8 2 3 8 5] [9 1 2 9 0 1 0 2 2 9] [9 8 5 3 0 2 0 6 9 3]] </code></pre> <p>as is, this is what I am getting right now:</p> <pre><code>sort.joy=&gt; (sort-parts a) (0 1 4 4 5 5 6 7 8 9 [2 6 8 2 6 7 0 1 8 1] 0 1 5 6 7 7 8 8 9 9 [9 8 5 3 0 2 0 6 9 3] 2 3 5 5 8 8 8 8 8 9 [7 9 2 8 5 6 6 8 3 4] 1 2 4 4 4 4 6 6 7 8 [8 5 1 7 3 0 2 4 2 3] 0 0 1 1 2 2 2 9 9 9 [4 0 2 6 8 5 6 1 7 7]) </code></pre> <p>Could someone please help me figure out a way to stop the loop from fully destructuring the 2d vector, thus returning a lazy vector with the head being a row vector? I have the comparotors for the rows figured out, thank you!</p> <p><strong>edit</strong> More general formulation of the problem: I want to sort a 2d vector, seen as <code>a</code> bellow into a lazy-sequence, where the head is the next sub-vector ordered by an index. To do this non-lazily, I am using: </p> <pre><code>(defn sortVector "sorts a 2d vector by the given index" [index coll] (sort-by #(nth % index) coll)) </code></pre>
    singulars
    1. This table or related slice is empty.
    1. This table or related slice is empty.
    1. PTQuestion
    1. USwespiserA
    1. USwespiserA
    plurals
    1. This table or related slice is empty.
    1. This table or related slice is empty.
    1. This table or related slice is empty.
    1. PO
      singulars
      1. PTAnswer
    1. VO
      singulars
      1. POSorting a 2d-vector by index value into lazy sequence in clojure
      1. This table or related slice is empty.
      1. VTUpMod
    1. This table or related slice is empty.
 

Querying!

 
Guidance
A row detail

Detail views are divided into sections. All the information in the data section comes from columns in the selected row. The other sections display data from other, related rows.

Related data can be related in a to-one or a to-many fashion. Captions of data related in a to-many fashion link to a list view showing a filtered view of the table.

Try moving around until you find a non-empty to-many entry and click on the label to get to one. You can move back to the root by clicking on the database name in the header.

SQuiL has stopped working due to an internal error.

If you are curious you may find further information in the browser console, which is accessible through the devtools (F12).

Reload