lszskye opened a new issue, #251: URL: https://github.com/apache/paimon-cpp/issues/251
### Search before asking - [x] I searched in the [issues](https://github.com/apache/paimon-cpp/issues) and found nothing similar. ### Paimon-cpp version - an existing `key=1` in L2; - `key=1` and `key=2` in L0; - compaction of only L0 into L1; - the output is supposed to be only `key=2`. The previous implementation special-cased `bool` by creating and immediately closing the lookup writer. This produced a valid but empty SST file. As a result, a compaction could incorrectly retain a newer row even though the first row for that key already existed. ### Minimal reproduce step - an existing `key=1` in L2; - `key=1` and `key=2` in L0; - compaction of only L0 into L1; - the output is supposed to be only `key=2`. ### What doesn't meet your expectations? The previous implementation special-cased `bool` by creating and immediately closing the lookup writer. This produced a valid but empty SST file. As a result, a compaction could incorrectly retain a newer row even though the first row for that key already existed. ### Anything else? _No response_ ### Are you willing to submit a PR? - [x] I'm willing to submit a PR! -- This is an automated message from the Apache Git Service. To respond to the message, please log on to GitHub and use the URL above to go to the specific comment. To unsubscribe, e-mail: [email protected] For queries about this service, please contact Infrastructure at: [email protected]
