func (c *CredentialGraphClient) Search(ctx context.Context, pathExp string,
	ownerID *identity.ID) ([]CredentialGraph, error) {

	query := url.Values{}

	query.Set("pathexp", pathExp)
	query.Set("owner_id", ownerID.String())
	query.Set("mode", "contains")

	return c.getGraph(ctx, query)
}
// Search returns back all segments of the CredentialGraph (Keyring, Keyring
// Members, and Credentials) that are contained within the given loose path
// expression. It is loose in that it can have * for projects.
Search returns back all segments of the CredentialGraph (Keyring, Keyring
Members, and Credentials) that are contained within the given loose path
expression. It is loose in that it can have * for projects.
// Search returns back all segments of the CredentialGraph ( Keyring Keyring // Members and Credentials ) that are contained within the given loose path // expression . It is loose in that it can have * for projects .
func (c *CredentialGraphClient) Search(ctx context.Context, pathExp string,
	ownerID *identity.ID) ([]CredentialGraph, error) {
	query := url.Values{}
	query.Set("pathexp", pathExp)
	query.Set("owner_id", ownerID.String())
	query.Set("mode", "contains")
	return c.getGraph(ctx, query)
}
func ( c * CredentialGraphClient ) Search ( ctx context . Context , pathExp string , ownerID * identity . ID ) ( [ ] CredentialGraph , error ) { query := url . Values { } query . Set ( " " , pathExp ) query . Set ( " " , ownerID . String ( ) ) query . Set ( " " , " " ) return c . getGraph ( ctx , query ) }
Search returns back all segments of the CredentialGraph (Keyring, Keyring
Members, and Credentials) that are contained within the given loose path
expression.
Search returns back all segments of the CredentialGraph ( Keyring Keyring Members and Credentials ) that are contained within the given loose path expression .