Changeset 879 for trunk/yat

Timestamp:

Sep 21, 2007, 4:10:07 PM (15 years ago)

Author:

Markus Ringnér

Message:

Added support to utility::vector for gsl-functions that finds indices to the k largest/smallest elements in a vector

Location:

trunk/yat/utility

Files:

• vector.cc (modified) (1 diff)
• vector.h (modified) (1 diff)

trunk/yat/utility/vector.cc

@@ -522 +522 @@
       throw utility::GSL_error(std::string("sort_index(vector&,const vector&)",status));      
     }
-    for(size_t i=0;i<p->size;i++) {
-      sort_index.resize(0);
-      sort_index.push_back(gsl_permutation_get(p,i));
-    }
+    sort_index=std::vector<size_t>(p->data,p->data+p->size);
     gsl_permutation_free(p);
   }
 
+
+  void sort_smallest_index(std::vector<size_t>& sort_index, size_t k, 
+                            const vector& invec)
+  {
+    assert(invec.gsl_vector_p());
+    assert(k<=invec.size());
+    sort_index.resize(k);
+    gsl_sort_vector_smallest_index(&sort_index[0],k,invec.gsl_vector_p());
+  }
+  
+  void sort_largest_index(std::vector<size_t>& sort_index, size_t k, 
+                            const vector& invec)
+  {
+    assert(invec.gsl_vector_p());
+    assert(k<=invec.size());
+    sort_index.resize(k);
+    gsl_sort_vector_largest_index(&sort_index[0],k,invec.gsl_vector_p());
+  }
 
 

trunk/yat/utility/vector.h

@@ -547 +547 @@
   void sort_index(std::vector<size_t>& sort_index, const vector& invec);
 
+  /** Similar to sort_index but creates a vector with indices to the \a k
+  smallest elements in \a invec.  
+  */
+  void sort_smallest_index(std::vector<size_t>& sort_index, size_t k, const
+  vector& invec);
+
+  /** Similar to sort_index but creates a vector with indices to the \a k
+  largest elements in \a invec.  
+  */
+  void sort_largest_index(std::vector<size_t>& sort_index, size_t k, const
+  vector& invec);
+
+  
 
   /**