| 739 | |
| 740 | #ifdef HAVE_SHIFTBBA |
| 741 | int kFindInTShift(poly p, TSet T, int tlength) |
| 742 | { |
| 743 | int i; |
| 744 | |
| 745 | for (i=0; i<=tlength; i++) |
| 746 | { |
| 747 | // in the Letterplace ring the LMs in T and L are copies thus we have to use pEqualPolys() instead of == |
| 748 | if (pEqualPolys(T[i].p, p)) return i; |
| 749 | } |
| 750 | return -1; |
| 751 | } |
| 752 | #endif |
| 753 | |
| 754 | #ifdef HAVE_SHIFTBBA |