docs/Writerside/c.list@dfc0ddd9571e (annotated)
docs/Writerside/c.list
Sun, 23 Nov 2025 13:15:19 +0100
- author
- Mike Becker <universe@uap-core.de>
- date
- Sun, 23 Nov 2025 13:15:19 +0100
- changeset 1508
- dfc0ddd9571e
- parent 1145
- 1a8fe7b7dd8a
- permissions
- -rw-r--r--
optimize sorted insertion by using the infimum instead of the supremum
The reason is that the supremum returns the equal element with the smallest index, and we want the largest.
Therefore, we use the infimum, which already gives us the largest index when there are equal elements, and increase the index by one. The infimum is also guaranteed to exist in that case.
|
1145
1a8fe7b7dd8a
add stream.h docs and reworks hash_key.h docs
Mike Becker <universe@uap-core.de>
parents:
diff
changeset
|
1 | <?xml version="1.0" encoding="UTF-8"?> |
|
1a8fe7b7dd8a
add stream.h docs and reworks hash_key.h docs
Mike Becker <universe@uap-core.de>
parents:
diff
changeset
|
2 | <!DOCTYPE categories |
|
1a8fe7b7dd8a
add stream.h docs and reworks hash_key.h docs
Mike Becker <universe@uap-core.de>
parents:
diff
changeset
|
3 | SYSTEM "https://resources.jetbrains.com/writerside/1.0/categories.dtd"> |
|
1a8fe7b7dd8a
add stream.h docs and reworks hash_key.h docs
Mike Becker <universe@uap-core.de>
parents:
diff
changeset
|
4 | <categories> |
|
1a8fe7b7dd8a
add stream.h docs and reworks hash_key.h docs
Mike Becker <universe@uap-core.de>
parents:
diff
changeset
|
5 | <category id="apidoc" name="Doxygen" order="1"/> |
|
1a8fe7b7dd8a
add stream.h docs and reworks hash_key.h docs
Mike Becker <universe@uap-core.de>
parents:
diff
changeset
|
6 | </categories> |
