Struct SecondaryResolution 

pub struct SecondaryResolution<CC: FreeChainComplex>
where
    CC::Algebra: PairAlgebra,
{
    underlying: Arc<CC>,
    pub(crate) homotopies: OnceBiVec<SecondaryHomotopy<CC::Algebra>>,
    intermediates: DashMap<BidegreeGenerator, FpVector>,
}

Fields

underlying: Arc<CC>

homotopies: OnceBiVec<SecondaryHomotopy<CC::Algebra>>

s -> t -> idx -> homotopy

intermediates: DashMap<BidegreeGenerator, FpVector>

Implementations

impl<CC: FreeChainComplex> SecondaryResolution<CC>

where CC::Algebra: PairAlgebra,

pub fn new(cc: Arc<CC>) -> Self

pub fn homotopy(&self, s: i32) -> &SecondaryHomotopy<CC::Algebra>

pub fn e3_page(&self) -> Sseq<2, Adams>

Trait Implementations

impl<CC: FreeChainComplex> SecondaryLift for SecondaryResolution<CC>

where CC::Algebra: PairAlgebra,

type Algebra = <CC as ChainComplex>::Algebra

type Source = CC

type Target = CC

type Underlying = CC

fn underlying(&self) -> Arc<CC>

fn algebra(&self) -> Arc<Self::Algebra>

fn source(&self) -> Arc<Self::Source>

fn target(&self) -> Arc<Self::Target>

fn shift(&self) -> Bidegree

fn max(&self) -> BidegreeRange<'_, Self>

fn homotopies(&self) -> &OnceBiVec<SecondaryHomotopy<CC::Algebra>>

fn intermediates(&self) -> &DashMap<BidegreeGenerator, FpVector>

fn save_dir(&self) -> &SaveDirectory

fn composite(&self, s: i32) -> CompositeData<CC::Algebra>

fn compute_intermediate(&self, g: BidegreeGenerator) -> FpVector

const HIT_GENERATOR: bool = false

Whether the composite can hit generators. This is true for SecondaryChainHomotopy and false for the rest. This is important because for SecondaryResolution, we don’t actually know all the generators if we resolve up to a stem. So in composites for SecondaryResolution, we need to ignore target generators of the same degree uniformly.

fn prime(&self) -> ValidPrime

fn initialize_homotopies(&self)

fn compute_composites(&self)

fn get_intermediate(&self, g: BidegreeGenerator) -> FpVector

fn compute_partial(&self, s: i32)

fn compute_intermediates(&self)

fn compute_homotopy_step(&self, b: Bidegree) -> Range<i32>

fn compute_homotopies(&self)

fn extend_all(&self)