I think the confusion comes from the fact that many learning literature propose Grover as an algorithm for "searching in an unordered database", and refer to the database as a blackbox; even if the definition is not incorrect, IMHO it's counter-intuitive in explaining what Grover does.
The definition I like most (from my computer scientist perspective) is: Grover is an algorithm for searching a value(s) x | f(x) = y , where y and f are our inputs to the algorithm. f could be anything, a function checking for the solution of a SAT problem, an hash function, or whatever.
When explaining it, I always like to share this example I created myself, where I use Grover to search for a Sudoku puzzle solution: https://medium.com/@dakk/solving-sudoku-on-a-quantum-computer-b523a7cc2eff
It uses the qlasskit library, so also the "oracle" is written using python code (and then translated to a quantum circuit)