docs: private void mergeEntryWithoutSplit(Node node,
              Entry newEntry, long timestamp) {
  
          Entry nearestEntryToCarriedBuffer =
                  node.nearestEntry(newEntry);
          double distanceNearestEntryToBuffer =
                  nearestEntryToCarriedBuffer.calcDistance(newEntry);
  
          BestMergeInNode bestMergeInNode =
                  calculateBestMergeInNode(node);
  
          if (distanceNearestEntryToBuffer < bestMergeInNode.distance) {
              nearestEntryToCarriedBuffer.aggregateEntry(newEntry, timestamp,
                      this.negLambda);
          } else {
              node.mergeEntries(bestMergeInNode.entryPos1,
                      bestMergeInNode.entryPos2);
              node.addEntry(newEntry, timestamp);
          }
      }