pub struct SweetApp { /* private fields */ }
Expand description
An installed app, with prebuilt SweetCells
Implementations§
source§impl SweetApp
impl SweetApp
sourcepub fn installed_app_id(&self) -> &InstalledAppId
pub fn installed_app_id(&self) -> &InstalledAppId
Accessor
sourcepub fn into_cells(self) -> Vec<SweetCell> ⓘ
pub fn into_cells(self) -> Vec<SweetCell> ⓘ
Accessor
Examples found in repository?
src/sweettest/sweet_app.rs (line 57)
51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102
pub fn into_tuple<Inner>(self) -> Inner
where
Inner: HomogeneousTuple<Item = SweetCell>,
Inner::Buffer: std::convert::AsRef<[Option<SweetCell>]>,
Inner::Buffer: std::convert::AsMut<[Option<SweetCell>]>,
{
self.into_cells()
.into_iter()
.collect_tuple::<Inner>()
.expect(
"Wrong number of Cells in destructuring pattern, or too many (must be 4 or less)",
)
}
}
/// A collection of installed apps
#[derive(
Clone, derive_more::From, derive_more::Into, derive_more::AsRef, derive_more::IntoIterator,
)]
pub struct SweetAppBatch(pub(super) Vec<SweetApp>);
impl SweetAppBatch {
/// Get the underlying data
pub fn into_inner(self) -> Vec<SweetApp> {
self.0
}
/// Helper to destructure the nested cell data as nested tuples.
/// The outer tuple contains the apps, the inner layer contains the cells in each app.
///
/// Each level of nesting can contain 1-4 items, i.e. up to 4 apps with 4 DNAs each.
/// Beyond 4, and this will PANIC! (But it's just for tests so it's fine.)
pub fn into_tuples<Outer, Inner>(self) -> Outer
where
Outer: HomogeneousTuple<Item = Inner>,
Inner: HomogeneousTuple<Item = SweetCell>,
Outer::Buffer: std::convert::AsRef<[Option<Inner>]>,
Outer::Buffer: std::convert::AsMut<[Option<Inner>]>,
Inner::Buffer: std::convert::AsRef<[Option<SweetCell>]>,
Inner::Buffer: std::convert::AsMut<[Option<SweetCell>]>,
{
self.into_inner()
.into_iter()
.map(|a| {
a.into_cells()
.into_iter()
.collect_tuple::<Inner>()
.expect("Wrong number of DNAs in destructuring pattern, or too many (must be 4 or less)")
})
.collect_tuple::<Outer>()
.expect("Wrong number of Agents in destructuring pattern, or too many (must be 4 or less)")
}
sourcepub fn agent(&self) -> &AgentPubKey
pub fn agent(&self) -> &AgentPubKey
Returns the AgentPubKey associated with this app. All Cells in this app will have the same Agent, so we just return the first.
sourcepub fn into_tuple<Inner>(self) -> Innerwhere
Inner: HomogeneousTuple<Item = SweetCell>,
Inner::Buffer: AsRef<[Option<SweetCell>]> + AsMut<[Option<SweetCell>]>,
pub fn into_tuple<Inner>(self) -> Innerwhere
Inner: HomogeneousTuple<Item = SweetCell>,
Inner::Buffer: AsRef<[Option<SweetCell>]> + AsMut<[Option<SweetCell>]>,
Helper to destructure into a tuple of SweetCells.
Can only be used for up to 4 cells. For more, please use into_cells
.
Trait Implementations§
Auto Trait Implementations§
impl !RefUnwindSafe for SweetApp
impl Send for SweetApp
impl Sync for SweetApp
impl Unpin for SweetApp
impl !UnwindSafe for SweetApp
Blanket Implementations§
§impl<T> Any for Twhere
T: Any + ?Sized,
impl<T> Any for Twhere
T: Any + ?Sized,
§fn type_id_compat(&self) -> TypeId
fn type_id_compat(&self) -> TypeId
TODO: once 1.33.0 is the minimum supported compiler version, remove
Any::type_id_compat and use StdAny::type_id instead.
https://github.com/rust-lang/rust/issues/27745
§impl<T> ArchivePointee for T
impl<T> ArchivePointee for T
§type ArchivedMetadata = ()
type ArchivedMetadata = ()
The archived version of the pointer metadata for this type.
§fn pointer_metadata(
_: &<T as ArchivePointee>::ArchivedMetadata
) -> <T as Pointee>::Metadata
fn pointer_metadata(
_: &<T as ArchivePointee>::ArchivedMetadata
) -> <T as Pointee>::Metadata
Converts some archived metadata to the pointer metadata for itself.
§impl<F, W, T, D> Deserialize<With<T, W>, D> for Fwhere
W: DeserializeWith<F, T, D>,
D: Fallible + ?Sized,
F: ?Sized,
impl<F, W, T, D> Deserialize<With<T, W>, D> for Fwhere
W: DeserializeWith<F, T, D>,
D: Fallible + ?Sized,
F: ?Sized,
§fn deserialize(
&self,
deserializer: &mut D
) -> Result<With<T, W>, <D as Fallible>::Error>
fn deserialize(
&self,
deserializer: &mut D
) -> Result<With<T, W>, <D as Fallible>::Error>
Deserializes using the given deserializer
§impl<T> FutureExt for T
impl<T> FutureExt for T
§fn with_context(self, otel_cx: Context) -> WithContext<Self> ⓘ
fn with_context(self, otel_cx: Context) -> WithContext<Self> ⓘ
§fn with_current_context(self) -> WithContext<Self> ⓘ
fn with_current_context(self) -> WithContext<Self> ⓘ
source§impl<T> Instrument for T
impl<T> Instrument for T
source§fn instrument(self, span: Span) -> Instrumented<Self> ⓘ
fn instrument(self, span: Span) -> Instrumented<Self> ⓘ
source§fn in_current_span(self) -> Instrumented<Self> ⓘ
fn in_current_span(self) -> Instrumented<Self> ⓘ
source§impl<T> Instrument for T
impl<T> Instrument for T
source§fn instrument(self, span: Span) -> Instrumented<Self> ⓘ
fn instrument(self, span: Span) -> Instrumented<Self> ⓘ
source§fn in_current_span(self) -> Instrumented<Self> ⓘ
fn in_current_span(self) -> Instrumented<Self> ⓘ
§impl<T> Pointable for T
impl<T> Pointable for T
§impl<SS, SP> SupersetOf<SS> for SPwhere
SS: SubsetOf<SP>,
impl<SS, SP> SupersetOf<SS> for SPwhere
SS: SubsetOf<SP>,
§fn to_subset(&self) -> Option<SS>
fn to_subset(&self) -> Option<SS>
The inverse inclusion map: attempts to construct
self
from the equivalent element of its
superset. Read more§fn is_in_subset(&self) -> bool
fn is_in_subset(&self) -> bool
Checks if
self
is actually part of its subset T
(and can be converted to it).§fn to_subset_unchecked(&self) -> SS
fn to_subset_unchecked(&self) -> SS
Use with care! Same as
self.to_subset
but without any property checks. Always succeeds.§fn from_subset(element: &SS) -> SP
fn from_subset(element: &SS) -> SP
The inclusion map: converts
self
to the equivalent element of its superset.§impl<T> Upcastable for Twhere
T: 'static + Any + Send + Sync,
impl<T> Upcastable for Twhere
T: 'static + Any + Send + Sync,
§fn upcast_any_ref(&self) -> &(dyn Any + 'static)
fn upcast_any_ref(&self) -> &(dyn Any + 'static)
upcast ref
§fn upcast_any_mut(&mut self) -> &mut (dyn Any + 'static)
fn upcast_any_mut(&mut self) -> &mut (dyn Any + 'static)
upcast mut ref