Changeset 25061a in git for kernel/tgb_internal.h

Timestamp:

Oct 17, 2005, 7:12:50 PM (17 years ago)

Author:

Michael Brickenstein <bricken@…>

Branches:

(u'jengelh-datetime', 'ceac47cbc86fe4a15902392bdbb9bd2ae0ea02c6')(u'spielwiese', 'a800fe4b3e9d37a38c5a10cc0ae9dfa0c15a4ee6')

Children:

4e01d2939d69a59407ea07140f184ace5c292bef

Parents:

bc6c75e647eb65339809ff5f7fea57c7e0b139f4

Message:

*bricken: generalized wlen type initial work


git-svn-id: file:///usr/local/Singular/svn/trunk@8726 2c84dea3-7e68-4137-9b89-c4e89433aadc

File:

• kernel/tgb_internal.h (modified) (4 diffs)

kernel/tgb_internal.h

@@ -5 +5 @@
 *  Computer Algebra System SINGULAR     *
 ****************************************/
-/* $Id: tgb_internal.h,v 1.16 2005-07-20 11:12:43 bricken Exp $ */
+/* $Id: tgb_internal.h,v 1.17 2005-10-17 17:12:37 bricken Exp $ */
 /*
  * ABSTRACT: tgb internal .h file
@@ -153 +153 @@
     SOONTREP
   };
-
+template <class len_type, class set_type>  int pos_helper(kStrategy strat, poly p, len_type len, set_type setL, polyset set);
 static int add_to_reductors(slimgb_alg* c, poly h, int len);
 static int bucket_guess(kBucket* bucket);
@@ -170 +170 @@
 static void soon_t_rep(const int & arg_i, const int & arg_j, slimgb_alg* c);
 static int pLcmDeg(poly a, poly b);
-static int simple_posInS (kStrategy strat, poly p,int len);
+static int simple_posInS (kStrategy strat, poly p,int len, wlen_type wlen);
 static BOOLEAN find_next_pair(slimgb_alg* c, BOOLEAN go_higher=TRUE);
 
@@ -241 +241 @@
 static void finalize_reduction_step(reduction_step* r);
 
+template <class len_type, class set_type>  int pos_helper(kStrategy strat, poly p, len_type len, set_type setL, polyset set){
+  int length=strat->sl;
+  int i;
+  int an = 0;
+  int en= length;
+
+  if ((len>setL[length])
+      || ((len==setL[length]) && (pLmCmp(set[length],p)== -1)))
+    return length+1;
+
+  loop
+  {
+    if (an >= en-1)
+    {
+      if ((len<setL[an])
+          || ((len==setL[an]) && (pLmCmp(set[an],p) == 1))) return an;
+      return en;
+    }
+    i=(an+en) / 2;
+    if ((len<setL[i])
+        || ((len==setL[i]) && (pLmCmp(set[i],p) == 1))) en=i;
+    //else if ((len>setL[i])
+    //|| ((len==setL[i]) && (pLmCmp(set[i],p) == -1))) an=i;
+    else an=i;
+  }
+
+}