//######################################################################
//# Generate a random interleaver
//######################################################################
-interleaver::interleaver(int K, unsigned int seed)
+interleaver::interleaver(int K, int seed)
{
d_K=K;
d_INTER.resize(d_K);
d_DEINTER.resize(d_K);
- srand(seed);
+ if(seed>=0) srand((unsigned int)seed);
std::vector<int> tmp(d_K);
for(int i=0;i<d_K;i++) {
d_INTER[i]=i;
interleaver(const interleaver & INTERLEAVER);
interleaver(int K, const std::vector<int> & INTER);
interleaver(const char *name);
- interleaver(int K, unsigned int seed);
+ interleaver(int K, int seed);
int K () const { return d_K; }
const std::vector<int> & INTER () const { return d_INTER; }
const std::vector<int> & DEINTER () const { return d_DEINTER; }
interleaver(const interleaver & INTERLEAVER);\r
interleaver(int K, const std::vector<int> & INTER);\r
interleaver(const char *name);\r
- interleaver(int K, unsigned int seed);\r
+ interleaver(int K, int seed);\r
int K () const { return d_K; }\r
const std::vector<int> & INTER () const { return d_INTER; }\r
const std::vector<int> & DEINTER () const { return d_DEINTER; }\r
}
// instantiate an <int> version of the quicksort_index
-
+//template <int> void SWAP (int & a, int & b);
template
void
quicksort_index<int>
void SWAP (T & a, T & b);
template <class T>
-void quicksort_index (std::vector<T> & p, std::vector<int> & index,
- int left, int right);
+void quicksort_index (std::vector<T> & p, std::vector<int> & index, int left, int right);
#endif