docs: final boolean findNetworkEntries(double queryLat, double queryLon,
                                       GHIntHashSet foundEntries, int iteration) {
          // find entries in border of searchbox
          for (int yreg = -iteration; yreg <= iteration; yreg++) {
              double subqueryLat = queryLat + yreg * deltaLat;
              double subqueryLonA = queryLon - iteration * deltaLon;
              double subqueryLonB = queryLon + iteration * deltaLon;
              findNetworkEntriesSingleRegion(foundEntries, subqueryLat, subqueryLonA);
  
              // minor optimization for iteration == 0
              if (iteration > 0)
                  findNetworkEntriesSingleRegion(foundEntries, subqueryLat, subqueryLonB);
          }
  
          for (int xreg = -iteration + 1; xreg <= iteration - 1; xreg++) {
              double subqueryLon = queryLon + xreg * deltaLon;
              double subqueryLatA = queryLat - iteration * deltaLat;
              double subqueryLatB = queryLat + iteration * deltaLat;
              findNetworkEntriesSingleRegion(foundEntries, subqueryLatA, subqueryLon);
              findNetworkEntriesSingleRegion(foundEntries, subqueryLatB, subqueryLon);
          }
  
          if (iteration % 2 != 0) {
              // Check if something was found already...
              if (!foundEntries.isEmpty()) {
                  double rMin = calculateRMin(queryLat, queryLon, iteration);
                  double minDistance = calcMinDistance(queryLat, queryLon, foundEntries);
  
                  if (minDistance < rMin)
                      // early finish => foundEntries contains a nearest node for sure
                      return true;
                  // else: continue as an undetected nearer node may sit in a neighbouring tile.
                  // Now calculate how far we have to look outside to find any hidden nearest nodes
                  // and repeat whole process with wider search area until this distance is covered.
              }
          }
  
          // no early finish possible
          return false;
      }