hc
2024-01-31 f9004dbfff8a3fbbd7e2a88c8a4327c7f2f8e5b2
kernel/include/linux/btree.h
....@@ -10,7 +10,7 @@
1010 *
1111 * A B+Tree is a data structure for looking up arbitrary (currently allowing
1212 * unsigned long, u32, u64 and 2 * u64) keys into pointers. The data structure
13
- * is described at http://en.wikipedia.org/wiki/B-tree, we currently do not
13
+ * is described at https://en.wikipedia.org/wiki/B-tree, we currently do not
1414 * use binary search to find the key on lookups.
1515 *
1616 * Each B+Tree consists of a head, that contains bookkeeping information and