protected DBTraceMemoryBlockEntry findSoonestBlockEntry(OffsetSnap loc, boolean inclusive) {
		Iterator<DBTraceMemoryBlockEntry> it;
		if (inclusive) {
			it = blocksByOffset.tail(loc, true).values().iterator();
		}
		else {
			it = blocksByOffset.tail(new OffsetSnap(loc.offset, loc.snap + 1),
				true).values().iterator();
		}
		if (!it.hasNext()) {
			return null;
		}
		DBTraceMemoryBlockEntry next = it.next();
		if (next.getOffset() != loc.offset || next.isScratch() != loc.isScratch()) {
			return null;
		}
		return next;
	}
Locate the soonest block entry for the given offset-snap pair

<p>
To qualify, the entry must have a snap greater than (or optionally equal to) that given and
an offset exactly equal to that given. That is, it is the earliest in time, but most follow
the given snap. Additionally, if the given snap is in scratch space, the found entry must
also be in scratch space.

@param loc the offset-snap pair
@param inclusive true to allow equal snap
@return the found entry, or null
Ghidra/Debug/Framework-TraceModeling/src/main/java/ghidra/trace/database/memory/DBTraceMemorySpace.java