Is cancel O(1) correct?

I'm wondering if the time complexity for cancel is indeed O(1), as stated in the wiki?
Since `remove` is called on a TreeMap:
https://github.com/DrAshBooth/JavaLOB/blob/master/src/lob/OrderTree.java#L55, this would imply time complexity O(logN).