Macaulay2 Engine
Loading...
Searching...
No Matches

◆ text_out() [2/3]

void res2_comp::text_out ( buffer & o,
const res2_pair * p ) const

Definition at line 1925 of file res-a0.cpp.

1926{
1927 res2_pair *a, *b;
1928
1929 a = p->syz->comp;
1930 if (p->syz->next == nullptr)
1931 b = nullptr;
1932 else
1933 b = p->syz->next->comp;
1934
1935 o << p->me << ' ';
1936 o << p->level << ' ' << p->degree << ' ';
1937 if (a != nullptr)
1938 o << a->me << ' ';
1939 else
1940 o << ". ";
1941 if (b != nullptr)
1942 o << b->me << ' ';
1943 else
1944 o << ". ";
1945
1946 o << p->compare_num << ' ';
1947
1948 switch (p->syz_type)
1949 {
1950 case SYZ2_S_PAIR:
1951 o << "PR";
1952 break;
1953 case SYZ2_MINIMAL:
1954 o << "SZ";
1955 break;
1956 case SYZ2_NOT_MINIMAL:
1957 o << "GB";
1958 o << "(pivot " << p->pivot_term->comp->me << ")";
1959 break;
1960 case SYZ2_NOT_NEEDED:
1961 o << "NO";
1962 break;
1963 default:
1964 break;
1965 }
1966
1967#if 0
1968// if (p->mi_exists)
1969#endif
1970 o << "[mi: " << p->mi->size() << "]";
1971#if 0
1972// else
1973// {
1974// res2_pair *q = p->next_div;
1975// int n = 0;
1976// while (q != NULL) { n++; q = q->next_div; }
1977// o << "[midiv: " << n << "]";
1978// }
1979#endif
1980 M->elem_text_out(o, p->syz->monom);
1981 o << " [" << R->n_terms(p->syz) << "] ";
1982 if (M2_gbTrace >= 4)
1983 {
1984 // Display the vector
1985 o << " syz: ";
1986 R->elem_text_out(o, p->syz);
1987 }
1988 o << newline;
1989}
res2_poly * R
Definition res-a0.hpp:123
const Monoid * M
Definition res-a0.hpp:124
int p
char newline[]
Definition m2-types.cpp:49
int M2_gbTrace
Definition m2-types.cpp:52
@ SYZ2_NOT_NEEDED
@ SYZ2_NOT_MINIMAL
@ SYZ2_S_PAIR
@ SYZ2_MINIMAL
unsigned int me

References M, M2_gbTrace, res2_pair::me, newline, p, R, SYZ2_MINIMAL, SYZ2_NOT_MINIMAL, SYZ2_NOT_NEEDED, and SYZ2_S_PAIR.