Hi all,
I would like to search starter nodes by matching multiple keys using the NamedIndexRepository.
I already found out that extending one of the two AbstractGraphRepository subclasses (NodeGraphRepository ins this case) and using/extending the method findAllByQuery as a starting point might be the right way:
public class MySuperNodeGraphRepository<T extends NodeBacked> extends NodeGraphRepository<Node, T> implements GraphRepository<T>
So far so good.
So lets now say somewhere a defined public interface XYZRepository extends GraphRepository<XYZ> is @Autowired.
How do I manage it that my own MySuperNodeGraphRepository gets autowired and not the NodeGraphRepository.
In case my approach was completely wrong, how can I extend or use soem kind of repository to find nodes by matching multiple keys?
Thanks
I would like to search starter nodes by matching multiple keys using the NamedIndexRepository.
I already found out that extending one of the two AbstractGraphRepository subclasses (NodeGraphRepository ins this case) and using/extending the method findAllByQuery as a starting point might be the right way:
public class MySuperNodeGraphRepository<T extends NodeBacked> extends NodeGraphRepository<Node, T> implements GraphRepository<T>
So far so good.
So lets now say somewhere a defined public interface XYZRepository extends GraphRepository<XYZ> is @Autowired.
How do I manage it that my own MySuperNodeGraphRepository gets autowired and not the NodeGraphRepository.
In case my approach was completely wrong, how can I extend or use soem kind of repository to find nodes by matching multiple keys?
Thanks
Comment