// VertexIDs takes the label and optional properties to retrieve
// the IDs desired from the graph.
VertexIDs takes the label and optional properties to retrieve
the IDs desired from the graph.
// VertexIDs takes the label and optional properties to retrieve // the IDs desired from the graph .
func (v *vertexIDQueryManager) VertexIDs(label string, properties ...interface{}) ([]string, error) {
	if len(properties)%2 != 0 {
		v.logger.Error("number of parameters ["+strconv.Itoa(len(properties))+"]",
			gremerror.NewGrammesError("VertexIDs", gremerror.ErrOddNumberOfParameters),
		)
		return nil, gremerror.ErrOddNumberOfParameters
	}
	query := traversal.NewTraversal().V().HasLabel(label)
	for i := 0; i < len(properties); i += 2 {
		query.AddStep("has", properties[i], properties[i+1])
	}
	ids, err := v.VertexIDsByString(query.String())
	if err != nil {
		v.logger.Error("error gathering IDs",
			gremerror.NewGrammesError("VertexIDs", err),
		)
	}
	return ids, err
}
func ( v * vertexIDQueryManager ) VertexIDs ( label string , properties ... interface { } ) ( [ ] string , error ) { if len ( properties ) % 2 != 0 { v . logger . Error ( " " + strconv . Itoa ( len ( properties ) ) + " " , gremerror . NewGrammesError ( " " , gremerror . ErrOddNumberOfParameters ) , ) return nil , gremerror . ErrOddNumberOfParameters } query := traversal . NewTraversal ( ) . V ( ) . HasLabel ( label ) for i := 0 ; i < len ( properties ) ; i += 2 { query . AddStep ( " " , properties [ i ] , properties [ i + 1 ] ) } ids , err := v . VertexIDsByString ( query . String ( ) ) if err != nil { v . logger . Error ( " " , gremerror . NewGrammesError ( " " , err ) , ) } return ids , err }
VertexIDs takes the label and optional properties to retrieve
the IDs desired from the graph.
VertexIDs takes the label and optional properties to retrieve the IDs desired from the graph .