ResMonoidSparse()

ResMonoidSparse::ResMonoidSparse	(	int	mNumVars,
		const std::vector< int > &	var_degrees,
		const std::vector< int > &	weightvecs,
		const MonomialOrderingType	moType )

Definition at line 9 of file res-moninfo-sparse.cpp.

{
  mNumVars = nvars;
  hashfcn =
      std::unique_ptr<res_monomial_word[]>(new res_monomial_word[mNumVars]);
  for (int i = 0; i < mNumVars; i++) hashfcn[i] = rand();
  mask = 0x10000000;
  mVarDegrees = var_degrees;
 
  ncalls_hash_value = 0;
  ncalls_compare = 0;
  ncalls_compare_grevlex = 0;
  ncalls_mult = 0;
  ncalls_get_component = 0;
  ncalls_from_expvector = 0;
  ncalls_to_expvector = 0;
  ncalls_to_varpower = 0;
  ncalls_from_varpower = 0;
  ncalls_is_equal = 0;
  ncalls_is_equal_true = 0;
  ncalls_divide = 0;
  ncalls_weight = 0;
  ncalls_unneccesary = 0;
  ncalls_quotient_as_vp = 0;
 
  mNumWeights = 0;
  if (moType == MonomialOrderingType::Lex)  // moIsLex(mo)
    {
      //      mCompareFcn = &ResMonoidSparse::compare_lex;
 
      if (M2_gbTrace >= 1) fprintf(stderr, "lex order\n");
    }
  else if (moType == MonomialOrderingType::GRevLex)  // moIsGRevLex(mo)
    {
      //      mCompareFcn = &ResMonoidSparse::compare_grevlex;
 
      if (M2_gbTrace >= 1) fprintf(stderr, "grevlex order\n");
    }
  else
    {
      mWeightVectors = weightvecs;
      mNumWeights = static_cast<int>(mWeightVectors.size()) / nvars;
      //      mCompareFcn = &ResMonoidSparse::compare_weightvector;
 
      if (M2_gbTrace >= 1) fprintf(stderr, "weight order\n");
    }
 
  nslots = 3 + nvars + mNumWeights;
  mFirstVar = 3 + mNumWeights;
  mFirstWeight = 3;
}

References GRevLex, hashfcn, Lex, M2_gbTrace, mask, mFirstVar, mFirstWeight, mNumVars, mNumWeights, mVarDegrees, mWeightVectors, ncalls_compare, ncalls_compare_grevlex, ncalls_divide, ncalls_from_expvector, ncalls_from_varpower, ncalls_get_component, ncalls_hash_value, ncalls_is_equal, ncalls_is_equal_true, ncalls_mult, ncalls_quotient_as_vp, ncalls_to_expvector, ncalls_to_varpower, ncalls_unneccesary, ncalls_weight, and nslots.