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

◆ emit_line()

void emit_line ( const char * s)

Definition at line 47 of file text-io.cpp.

48{
49 while (*s != 0)
50 {
51 while (*s != '\n' && *s != 0) putchar(*s++);
52 putchar('\n');
53 if (*s != 0) s++;
54 fputs(wrapping_prefix, stdout);
55 }
56 fflush(stdout);
57}
void size_t s
Definition m2-mem.cpp:271
#define wrapping_prefix
Definition text-io.hpp:41

References s, and wrapping_prefix.

Referenced by alexDual(), gbA::auto_reduce_by(), ResolutionComputation::choose_res(), gbA::collect_syzygy(), gbA::compute_s_pair(), NCGroebner::computeHomogeneous(), NCGroebner::computeInhomogeneous(), gbA::debug_spair(), gbA::do_computation(), F4MonomialLookupTableT< Key >::do_node(), MonomialIdeal::do_node(), ResF4MonomialLookupTableT< Key >::do_node(), dvec(), gbA::find_good_divisor(), GBinhom_comp::find_pairs(), gb2_comp::gb_reduce(), GB_comp::gb_reduce(), GBinhom_comp::gb_reduce(), GBRing::gbvector_auto_reduce(), GBRing::gbvector_auto_reduce_ZZ(), GBKernelComputation::geo_reduce(), gbA::insert_gb(), GBinhom_comp::mark_pair(), gbA::minimalize_pairs_non_ZZ(), gbA::minimalize_pairs_ZZ(), NCGroebner::NCGroebner(), MonomialSorterObject::operator()(), binomialGB_comp::process_pair(), range_safe_add(), rawStartComputation(), GBKernelComputation::reduce(), gbA::reduce_kk(), gbA::reduce_ZZ(), gbA::remainder_non_ZZ(), gbA::remainder_ZZ(), gbA::remove_unneeded_pairs(), gbA::replace_gb_element_ZZ(), GBinhom_comp::s_pair_step(), gbA::show(), gbA::show_mem_usage(), gbA::spair_set_defer(), gbA::spair_set_next(), GB_comp::start_computation(), gbA::start_computation(), GBinhom_comp::start_computation(), gbres_comp::stats(), and gbA::tail_remainder_ZZ().