Struct qs_s

Source

#[repr(C)]
pub struct qs_s {Show 63 fields
    pub index_j: slong,
    pub mutex: pthread_mutex_t,
    pub handles: *mut thread_pool_handle,
    pub num_handles: slong,
    pub n: fmpz_t,
    pub bits: flint_bitcnt_t,
    pub ks_primes: ulong,
    pub k: ulong,
    pub kn: fmpz_t,
    pub num_primes: slong,
    pub factor_base: *mut prime_t,
    pub sqrts: *mut c_int,
    pub small_primes: slong,
    pub second_prime: slong,
    pub sieve_size: slong,
    pub sieve_bits: c_uchar,
    pub sieve_fill: c_uchar,
    pub A: fmpz_t,
    pub B: fmpz_t,
    pub A_ind: *mut ulong,
    pub A_divp: *mut fmpz_t,
    pub B0_terms: *mut ulong,
    pub B_terms: *mut fmpz_t,
    pub A_inv: *mut ulong,
    pub A_inv2B: *mut *mut ulong,
    pub soln1: *mut c_int,
    pub soln2: *mut c_int,
    pub target_A: fmpz_t,
    pub upp_bound: fmpz_t,
    pub low_bound: fmpz_t,
    pub s: slong,
    pub low: slong,
    pub high: slong,
    pub span: slong,
    pub h: slong,
    pub m: slong,
    pub A_ind_diff: slong,
    pub curr_subset: *mut ulong,
    pub first_subset: *mut ulong,
    pub j: ulong,
    pub poly: *mut qs_poly_s,
    pub siqs: *mut FLINT_FILE,
    pub fname: *mut c_char,
    pub full_relation: slong,
    pub num_cycles: slong,
    pub vertices: slong,
    pub components: slong,
    pub edges: slong,
    pub table_size: slong,
    pub table: *mut hash_t,
    pub hash_table: *mut ulong,
    pub extra_rels: slong,
    pub max_factors: slong,
    pub Y_arr: *mut fmpz,
    pub curr_rel: *mut slong,
    pub relation: *mut slong,
    pub buffer_size: slong,
    pub num_relations: slong,
    pub small_factor: ulong,
    pub matrix: *mut la_col_t,
    pub qsort_arr: *mut *mut la_col_t,
    pub columns: slong,
    pub prime_count: *mut slong,
}

Fields§

§index_j: slong§mutex: pthread_mutex_t§handles: *mut thread_pool_handle§num_handles: slong§n: fmpz_t§bits: flint_bitcnt_t§ks_primes: ulong§k: ulong§kn: fmpz_t§num_primes: slong§factor_base: *mut prime_t§sqrts: *mut c_int§small_primes: slong§second_prime: slong§sieve_size: slong§sieve_bits: c_uchar§sieve_fill: c_uchar§A: fmpz_t

POLYNOMIAL DATA

§B: fmpz_t§A_ind: *mut ulong§A_divp: *mut fmpz_t§B0_terms: *mut ulong§B_terms: *mut fmpz_t§A_inv: *mut ulong§A_inv2B: *mut *mut ulong§soln1: *mut c_int§soln2: *mut c_int§target_A: fmpz_t§upp_bound: fmpz_t§low_bound: fmpz_t§s: slong§low: slong§high: slong§span: slong§h: slong§m: slong§A_ind_diff: slong§curr_subset: *mut ulong§first_subset: *mut ulong§j: ulong§poly: *mut qs_poly_s§siqs: *mut FLINT_FILE

RELATION DATA

§fname: *mut c_char§full_relation: slong§num_cycles: slong§vertices: slong§components: slong§edges: slong§table_size: slong§table: *mut hash_t§hash_table: *mut ulong§extra_rels: slong§max_factors: slong§Y_arr: *mut fmpz§curr_rel: *mut slong§relation: *mut slong§buffer_size: slong§num_relations: slong§small_factor: ulong§matrix: *mut la_col_t

LINEAR ALGEBRA DATA

§qsort_arr: *mut *mut la_col_t§columns: slong§prime_count: *mut slong

SQUARE ROOT DATA

qs_s

Struct qs_s Copy item path

Fields§

Trait Implementations§

impl Default for qs_s

fn default() -> Self

Auto Trait Implementations§

impl Freeze for qs_s

impl RefUnwindSafe for qs_s

impl !Send for qs_s

impl !Sync for qs_s

impl Unpin for qs_s

impl UnsafeUnpin for qs_s

impl UnwindSafe for qs_s

Blanket Implementations§

impl<T> Any for Twhere T: 'static + ?Sized,

fn type_id(&self) -> TypeId

impl<T> Borrow<T> for Twhere T: ?Sized,

fn borrow(&self) -> &T

impl<T> BorrowMut<T> for Twhere T: ?Sized,

fn borrow_mut(&mut self) -> &mut T

impl<T> From<T> for T

fn from(t: T) -> T

impl<T, U> Into<U> for Twhere U: From<T>,

fn into(self) -> U

impl<T, U> TryFrom<U> for Twhere U: Into<T>,

type Error = Infallible

fn try_from(value: U) -> Result<T, <T as TryFrom<U>>::Error>

impl<T, U> TryInto<U> for Twhere U: TryFrom<T>,

type Error = <U as TryFrom<T>>::Error

fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>

Struct qs_s

impl<T> Any for T
where T: 'static + ?Sized,

impl<T> Borrow<T> for T
where T: ?Sized,

impl<T> BorrowMut<T> for T
where T: ?Sized,

impl<T, U> Into<U> for T
where U: From<T>,

impl<T, U> TryFrom<U> for T
where U: Into<T>,

impl<T, U> TryInto<U> for T
where U: TryFrom<T>,