Changeset 63d2db in git for kernel

Timestamp:

Nov 18, 2022, 5:57:57 PM (17 months ago)

Author:

Hans Schoenemann <hannes@…>

Branches:

(u'spielwiese', 'fe61d9c35bf7c61f2b6cbf1b56e25e2f08d536cc')

Children:

3d3fd4c30ec2e66b2e1aca5ef773826fb9ae3924d65cbb52476edc058eb3eb9d38c122de988f2c4c

Parents:

deedf3d8f501628fbee217e6e83dcbe439b95645

Message:

removed: posInTrg0

File:

• kernel/GBEngine/kutil.cc (modified) (2 diffs)

kernel/GBEngine/kutil.cc

@@ -5050 +5050 @@
 #endif
 
-/*2 Pos for rings T: Here I am
-* looks up the position of p in T
-* set[0] is the smallest with respect to the ordering-procedure
-* totaldegree,pComp
-*/
-int posInTrg0 (const TSet set,const int length,LObject &p)
-{
-  if (length==-1) return 0;
-  int o = p.GetpFDeg();
-  int op = set[length].GetpFDeg();
-  int i;
-  int an = 0;
-  int en = length;
-  int cmp_int = currRing->OrdSgn;
-  if ((op < o) || (pLmCmp(set[length].p,p.p)== -cmp_int))
-    return length+1;
-  int cmp;
-  loop
-  {
-    if (an >= en-1)
-    {
-      op = set[an].GetpFDeg();
-      if (op > o) return an;
-      if (op < 0) return en;
-      cmp = pLmCmp(set[an].p,p.p);
-      if (cmp == cmp_int)  return an;
-      if (cmp == -cmp_int) return en;
-      if (nGreater(pGetCoeff(p.p), pGetCoeff(set[an].p))) return en;
-      return an;
-    }
-    i = (an + en) / 2;
-    op = set[i].GetpFDeg();
-    if (op > o)       en = i;
-    else if (op < o)  an = i;
-    else
-    {
-      cmp = pLmCmp(set[i].p,p.p);
-      if (cmp == cmp_int)                                     en = i;
-      else if (cmp == -cmp_int)                               an = i;
-      else if (nGreater(pGetCoeff(p.p), pGetCoeff(set[i].p))) an = i;
-      else                                                    en = i;
-    }
-  }
-}
-/*
-  int o = p.GetpFDeg();
-  int op = set[length].GetpFDeg();
-
-  if ((op < o)
-  || ((op == o) && (pLmCmp(set[length].p,p.p) != currRing->OrdSgn)))
-    return length+1;
-
-  int i;
-  int an = 0;
-  int en= length;
-
-  loop
-  {
-    if (an >= en-1)
-    {
-      op= set[an].GetpFDeg();
-      if ((op > o)
-      || (( op == o) && (pLmCmp(set[an].p,p.p) == currRing->OrdSgn)))
-        return an;
-      return en;
-    }
-    i=(an+en) / 2;
-    op = set[i].GetpFDeg();
-    if (( op > o)
-    || (( op == o) && (pLmCmp(set[i].p,p.p) == currRing->OrdSgn)))
-      en=i;
-    else
-      an=i;
-  }
-}
-  */
 /*2
 * looks up the position of p in T
@@ -11672 +11596 @@
 #endif
     else if (strat->posInT==posInT_EcartpLength) printf("posInT_EcartpLength\n");
-    else if (strat->posInT==posInTrg0) printf("posInTrg0\n");
     else  printf("%p\n",(void*)strat->posInT);
   printf("posInL: ");