random.h 3.6 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133
  1. /***********************************************************************
  2. * Software License Agreement (BSD License)
  3. *
  4. * Copyright 2008-2009 Marius Muja (mariusm@cs.ubc.ca). All rights reserved.
  5. * Copyright 2008-2009 David G. Lowe (lowe@cs.ubc.ca). All rights reserved.
  6. *
  7. * THE BSD LICENSE
  8. *
  9. * Redistribution and use in source and binary forms, with or without
  10. * modification, are permitted provided that the following conditions
  11. * are met:
  12. *
  13. * 1. Redistributions of source code must retain the above copyright
  14. * notice, this list of conditions and the following disclaimer.
  15. * 2. Redistributions in binary form must reproduce the above copyright
  16. * notice, this list of conditions and the following disclaimer in the
  17. * documentation and/or other materials provided with the distribution.
  18. *
  19. * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR
  20. * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
  21. * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
  22. * IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT,
  23. * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
  24. * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
  25. * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
  26. * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
  27. * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF
  28. * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
  29. *************************************************************************/
  30. #ifndef OPENCV_FLANN_RANDOM_H
  31. #define OPENCV_FLANN_RANDOM_H
  32. #include <algorithm>
  33. #include <cstdlib>
  34. #include <vector>
  35. #include "general.h"
  36. namespace cvflann
  37. {
  38. /**
  39. * Seeds the random number generator
  40. * @param seed Random seed
  41. */
  42. inline void seed_random(unsigned int seed)
  43. {
  44. srand(seed);
  45. }
  46. /*
  47. * Generates a random double value.
  48. */
  49. /**
  50. * Generates a random double value.
  51. * @param high Upper limit
  52. * @param low Lower limit
  53. * @return Random double value
  54. */
  55. inline double rand_double(double high = 1.0, double low = 0)
  56. {
  57. return low + ((high-low) * (std::rand() / (RAND_MAX + 1.0)));
  58. }
  59. /**
  60. * Generates a random integer value.
  61. * @param high Upper limit
  62. * @param low Lower limit
  63. * @return Random integer value
  64. */
  65. inline int rand_int(int high = RAND_MAX, int low = 0)
  66. {
  67. return low + (int) ( double(high-low) * (std::rand() / (RAND_MAX + 1.0)));
  68. }
  69. /**
  70. * Random number generator that returns a distinct number from
  71. * the [0,n) interval each time.
  72. */
  73. class UniqueRandom
  74. {
  75. std::vector<int> vals_;
  76. int size_;
  77. int counter_;
  78. public:
  79. /**
  80. * Constructor.
  81. * @param n Size of the interval from which to generate
  82. * @return
  83. */
  84. UniqueRandom(int n)
  85. {
  86. init(n);
  87. }
  88. /**
  89. * Initializes the number generator.
  90. * @param n the size of the interval from which to generate random numbers.
  91. */
  92. void init(int n)
  93. {
  94. // create and initialize an array of size n
  95. vals_.resize(n);
  96. size_ = n;
  97. for (int i = 0; i < size_; ++i) vals_[i] = i;
  98. // shuffle the elements in the array
  99. std::random_shuffle(vals_.begin(), vals_.end());
  100. counter_ = 0;
  101. }
  102. /**
  103. * Return a distinct random integer in greater or equal to 0 and less
  104. * than 'n' on each call. It should be called maximum 'n' times.
  105. * Returns: a random integer
  106. */
  107. int next()
  108. {
  109. if (counter_ == size_) {
  110. return -1;
  111. }
  112. else {
  113. return vals_[counter_++];
  114. }
  115. }
  116. };
  117. }
  118. #endif //OPENCV_FLANN_RANDOM_H