pub fn partition_workspace_names<'a, B>(
        &self,
        names: impl IntoIterator<Item = &'a str>,
    ) -> Result<(B, B)>
    where
        B: Default + Extend<&'a str>,
    {
        let workspace = self.package_graph()?.workspace();
        let (known, unknown) = names
            .into_iter()
            .partition(|name| workspace.contains_name(name));
        Ok((known, unknown))
    }
/// For a given list of workspace packages, returns a tuple of (known, unknown) packages.
///
/// Initializes the package graph if it isn't already done so, and returns an error if the
For a given list of workspace packages, returns a tuple of (known, unknown) packages.
Initializes the package graph if it isn't already done so, and returns an error if the
For a given list of workspace packages returns a tuple of ( known unknown ) packages . Initializes the package graph if it isn ' t already done so and returns an error if the
pub fn partition_workspace_names<'a, B>(
        &self,
        names: impl IntoIterator<Item = &'a str>,
    ) -> Result<(B, B)>
    where
        B: Default + Extend<&'a str>,
    {
        let workspace = self.package_graph()?.workspace();
        let (known, unknown) = names
            .into_iter()
            .partition(|name| workspace.contains_name(name));
        Ok((known, unknown))
    }
pub fn partition_workspace_names < ' a , B > ( & self , names : impl IntoIterator < Item = & ' a str > , ) -> Result < ( B , B ) > where B : Default + Extend < & ' a str > , { let workspace = self . package_graph ( ) ? . workspace ( ) ; let ( known , unknown ) = names . into_iter ( ) . partition ( | name | workspace . contains_name ( name ) ) ; Ok ( ( known , unknown ) ) }
For a given list of workspace packages, returns a tuple of (known, unknown) packages.
For a given list of workspace packages returns a tuple of ( known unknown ) packages .
&self
names
impl IntoIterator<Item = &'a str>