Function orderAgainstScalar [src]

Same as order but the right-hand operand is a primitive integer.

Prototype

pub fn orderAgainstScalar(lhs: Const, scalar: anytype) math.Order

Parameters

lhs: Const

Source

  pub fn orderAgainstScalar(lhs: Const, scalar: anytype) math.Order {
    // Normally we could just determine the number of limbs needed with calcLimbLen,
    // but that is not comptime-known when scalar is not a comptime_int.  Instead, we
    // use calcTwosCompLimbCount for a non-comptime_int scalar, which can be pessimistic
    // in the case that scalar happens to be small in magnitude within its type, but it
    // is well worth being able to use the stack and not needing an allocator passed in.
    // Note that Mutable.init still sets len to calcLimbLen(scalar) in any case.
    const limb_len = comptime switch (@typeInfo(@TypeOf(scalar))) {
        .comptime_int => calcLimbLen(scalar),
        .int => |info| calcTwosCompLimbCount(info.bits),
        else => @compileError("expected scalar to be an int"),
    };
    var limbs: [limb_len]Limb = undefined;
    const rhs = Mutable.init(&limbs, scalar);
    return order(lhs, rhs.toConst());
}  