From: stevenj <stevenj@alum.mit.edu>
Date: Thu, 6 Sep 2007 17:26:40 +0000 (-0400)
Subject: fix comment
X-Git-Url: http://www.chiark.greenend.org.uk/ucgi/~ianmdlvl/git?a=commitdiff_plain;h=899a10a524677f0e41859590046187b455f309c1;p=nlopt.git

fix comment

darcs-hash:20070906172640-c8de0-11a7a435200e761ead10dc64dd940eeed6bfcdbe.gz
---

diff --git a/util/sobolseq.c b/util/sobolseq.c
index 1948277..b72d792 100644
--- a/util/sobolseq.c
+++ b/util/sobolseq.c
@@ -75,8 +75,7 @@ typedef struct nlopt_soboldata_s {
      uint32_t n; /* number of x's generated so far */
 } soboldata;
 
-/* Return position (0, 1, ...) of rightmost zero bit in n,
- * via binary search on the (32) bits of n. 
+/* Return position (0, 1, ...) of rightmost zero bit in n.
  *
  * This code uses a 32-bit version of algorithm to find the rightmost
  * one bit in Knuth, _The Art of Computer Programming_, volume 4A