Searched refs:hasNegativeSign (Results 1 – 9 of 9) sorted by relevance
965 if(!mstruct_units[i][i2].isPower() || !mstruct_units[i][i2][1].hasNegativeSign()) { in combination_factorize()974 if(mstruct_new[i][i2].isPower() && mstruct_new[i][i2][1].hasNegativeSign()) { in combination_factorize()982 } else if(mstruct_new[i].isPower() && mstruct_new[i][1].hasNegativeSign()) { in combination_factorize()1175 if(CHILD(i)[i2].isPower() && CHILD(i)[i2][1].hasNegativeSign()) {1180 } else if(CHILD(i).isPower() && CHILD(i)[1].hasNegativeSign()) {1205 if(!mstruct_units[i][i2].isPower() || !mstruct_units[i][i2][1].hasNegativeSign()) {1214 if(mstruct_new[i][i2].isPower() && mstruct_new[i][i2][1].hasNegativeSign()) {1222 } else if(mstruct_new[i].isPower() && mstruct_new[i][1].hasNegativeSign()) {2696 if(!mstruct_units[i][i2].isPower() || !mstruct_units[i][i2][1].hasNegativeSign()) {2705 if(mstruct_new[i][i2].isPower() && mstruct_new[i][i2][1].hasNegativeSign()) {[all …]
131 bool m1 = mstruct1.hasNegativeSign(), m2 = mstruct2.hasNegativeSign(); in sortCompare()154 if(mstruct1[i].isPower() && mstruct1[i][1].hasNegativeSign()) { in sortCompare()159 } else if(mstruct1.isPower() && mstruct1[1].hasNegativeSign()) { in sortCompare()164 if(mstruct2[i].isPower() && mstruct2[i][1].hasNegativeSign()) { in sortCompare()169 } else if(mstruct2.isPower() && mstruct2[1].hasNegativeSign()) { in sortCompare()497 …TRUCT_ADDITION && SIZE > 2 && po.sort_options.minus_last && v_subs[sorted[0]]->hasNegativeSign()) { in sort()500 if(!v_subs[sorted[i2]]->hasNegativeSign()) { in sort()940 } else if(!bdiv && CHILD(i2).isPower() && CHILD(i2)[1].hasNegativeSign()) { in improve_division_multipliers()1752 …if(ename->reference) do_prefix = (hasNegativeSign() ? CALCULATOR->place_currency_code_before_negat… in prefixCurrencies()1798 if((*mden)[i2].hasNegativeSign()) { in unnegate_multiplier()[all …]
566 if(CHILD(i1).isPower() && CHILD(i1)[1].hasNegativeSign()) { in merge_addition()582 if(mstruct[i2].isPower() && mstruct[i2][1].hasNegativeSign()) { in merge_addition()605 if(mstruct[i].isPower() && mstruct[i][1].hasNegativeSign()) { in merge_addition()643 if(mstruct[i].isPower() && mstruct[i][1].hasNegativeSign()) { in merge_addition()656 if(CHILD(i).isPower() && CHILD(i)[1].hasNegativeSign()) { in merge_addition()686 if(mstruct[i].isPower() && mstruct[i][1].hasNegativeSign()) { in merge_addition()699 if(eo.combine_divisions && mstruct[1].hasNegativeSign()) { in merge_addition()704 if(CHILD(i).isPower() && CHILD(i)[1].hasNegativeSign()) { in merge_addition()1801 if(eo.combine_divisions && mstruct[1].hasNegativeSign()) { in merge_multiplication()3343 if(CHILD(i).number().hasNegativeSign()) { in merge_power()[all …]
300 bool hasNegativeSign() const;
108 if(mstruct.hasNegativeSign() && !mstruct.containsType(STRUCT_ADDITION, true)) return true; in has_predominately_negative_sign()113 if(mstruct[i].hasNegativeSign()) { in has_predominately_negative_sign()118 if(mstruct.size() % 2 == 0 && p_count == mstruct.size() / 2) return mstruct[0].hasNegativeSign(); in has_predominately_negative_sign()1736 if(vargs[0].number().hasNegativeSign()) mstruct.negate(); in calculate()
742 bool MathStructure::hasNegativeSign() const { in hasNegativeSign() function in MathStructure743 …BER && o_number.hasNegativeSign()) || m_type == STRUCT_NEGATE || (m_type == STRUCT_MULTIPLICATION … in hasNegativeSign()2809 …N || m_type == STRUCT_INVERSE || (m_type == STRUCT_POWER && CHILD(1).hasNegativeSign())) return tr… in containsDivision()
509 bool hasNegativeSign() const;
38 if(coeff.hasNegativeSign()) return -1; in polynomialUnit()
2390 bool Number::hasNegativeSign() const { function in Number