移去rt

hc

2023-12-08 01573e231f18eb2d99162747186f59511f56b64d

 kernel/include/linux/btree.h
..
..
@@ -10,7 +10,7 @@
10
10
  *
11
11
  * A B+Tree is a data structure for looking up arbitrary (currently allowing
12
12
  * 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
14
14
  * use binary search to find the key on lookups.
15
15
  *
16
16
  * Each B+Tree consists of a head, that contains bookkeeping information and