372046933 commented on issue #1995:
URL:
https://github.com/apache/incubator-brpc/issues/1995#issuecomment-1317996849
Since linear scan is not efficient. Would interval tree be used to query and
update in $\mathcal{O}(\log{}n)$ ?
--
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]
---------------------------------------------------------------------
To unsubscribe, e-mail: [email protected]
For additional commands, e-mail: [email protected]
