Changeset 2730 for trunk/src/Locator.cpp

Timestamp:

01/16/13 16:00:28 (11 years ago)

Author:

Takeshi Nakazato

Message:

New Development: No

JIRA Issue: Yes CAS-4770

Ready for Test: Yes

Interface Changes: No

What Interface Changed: Please list interface changes

Test Programs: List test programs

Put in Release Notes: Yes/No?

Module(s): Module Names change impacts.

Description: Describe your changes here...

Rewrite implementations for locator and interpolator.
Documentation (doxygen format) is added to header files.

File:

• trunk/src/Locator.cpp (modified) (1 diff)

trunk/src/Locator.cpp

@@ -15 +15 @@
 
 namespace asap {
+Locator::Locator()
+  : x_(0),
+    n_(0),
+    ascending_(true),
+    copy_(false)
+{
+}
 
-Locator::Locator(double *v, unsigned int n)
+Locator::Locator(double *v, unsigned int n, bool copystorage)
+  : x_(0),
+    n_(0),
+    ascending_(true),
+    copy_(false)
 {
-  set(v, n);
+  set(v, n, copystorage);
 }
 
 Locator::~Locator()
-{}
-
-void Locator::set(double *v, unsigned int n)
 {
-  x_ = v;
-  n_ = n;
+  if (copy_ && x_)
+    delete[] x_;
 }
 
+void Locator::set(double *v, unsigned int n, bool copystorage)
+{
+  if (copy_) {
+    if (!copystorage || n > n_) {
+      delete[] x_;
+      x_ = 0;
+    }
+  }
+  copy_ = copystorage;
+  n_ = n;
+  if (copy_) {
+    if (!x_)
+      x_ = new double[n_];
+    for (unsigned int i = 0; i < n_; i++)
+      x_[i] = v[i];
+  }
+  else {
+    x_ = v;
+  }
+  ascending_ = (x_[0] <= x_[n_-1]);
 }
+
+unsigned int Locator::bisection(double x, unsigned int left, unsigned int right)
+{
+  unsigned int jl = left;
+  unsigned int ju = right;
+
+  if (ascending_) {
+    // ascending order
+    if (x <= x_[0])
+      return 0;
+    else if (x > x_[n_-1])
+      return n_;
+
+    unsigned int jm;
+    while (ju - jl > 1) {
+      jm = (ju + jl) / 2;
+      if (x > x_[jm])
+        jl = jm;
+      else
+        ju = jm;
+    }
+  }
+  else {
+    // descending order
+    if (x >= x_[0])
+      return 0;
+    else if (x < x_[n_-1])
+      return n_;
+
+    unsigned int jm;
+    while (ju - jl > 1) {
+      jm = (ju + jl) / 2;
+      if (x < x_[jm])
+        jl = jm;
+      else
+        ju = jm;
+    }
+  }
+
+  return ju;
+}
+
+void Locator::hunt(double x, unsigned int &left, unsigned int &right)
+{
+  unsigned int inc = 1;
+  if (ascending_) {
+    // ascending order
+    if (x >= x_[left]) {
+      // forward hunt
+      if (left >= n_ - 1) {
+        right = n_;
+        return;
+      }
+      right = left + inc;
+      while (x >= x_[right]) {
+        left = right;
+        inc *= 2;
+        right = left + inc;
+        if (right > n_ - 1) {
+          right = n_;
+          break;
+        }
+      }
+    }
+    else {
+      // backward hunt
+      if (left == 0) {
+        right = 0;
+        return;
+      }
+      right = left;
+      left -= inc;
+      while (x < x_[left]) {
+        right = left;
+        inc *= 2;
+        if (inc >= right) {
+          left = 0;
+          break;
+        }
+        left = right - inc;
+      }
+    }
+  }
+  else {
+    // descending order
+    if (x < x_[left]) {
+      // forward hunt
+      if (left >= n_ - 1) {
+        right = n_;
+        return;
+      }
+      right = left + inc;
+      while (x < x_[right]) {
+        left = right;
+        inc *= 2;
+        right = left + inc;
+        if (right > n_ - 1) {
+          right = n_;
+          break;
+        }
+      }
+    }
+    else {
+      // backward hunt
+      if (left == 0) 
+        return;
+      right = left;
+      left -= inc;
+      while (x >= x_[left]) {
+        right = left;
+        inc *= 2;
+        if (inc >= right) {
+          left = 0;
+          break;
+        }
+        left = right - inc;
+      }
+    }
+  }
+}
+}