Changeset 1ab4aca in mainline

Timestamp:

2011-09-24T11:54:09Z (13 years ago)

Author:

Jakub Jermar <jakub@…>

Branches:

lfn, master, serial, ticket/834-toolchain-update, topic/msim-upgrade, topic/simplify-dev-export

Children:

925a21e, f1a9e87

Parents:

286286c

git-author:

Maurizio Lombardi <m.lombardi85@…> (2011-09-24 11:54:09)

git-committer:

Jakub Jermar <jakub@…> (2011-09-24 11:54:09)

Message:

Trivial: fix typos.

Files:

• kernel/generic/src/adt/btree.c (modified) (7 diffs)
• kernel/generic/src/adt/list.c (modified) (1 diff)
• uspace/lib/c/generic/adt/hash_table.c (modified) (1 diff)
• uspace/lib/c/generic/adt/list.c (modified) (1 diff)

kernel/generic/src/adt/btree.c

@@ -38 +38 @@
  *
  * The B+tree has the following properties:
- * @li it is a ballanced 3-4-5 tree (i.e. BTREE_M = 5)
+ * @li it is a balanced 3-4-5 tree (i.e. BTREE_M = 5)
  * @li values (i.e. pointers to values) are stored only in leaves
  * @li leaves are linked in a list
  *
- * Be carefull when using these trees. They need to allocate
+ * Be careful when using these trees. They need to allocate
  * and deallocate memory for their index nodes and as such
  * can sleep.
@@ -146 +146 @@
  * also makes use of this feature.
  *
- * @param node     B-tree node into wich the new key is to be inserted.
+ * @param node     B-tree node into which the new key is to be inserted.
  * @param key      The key to be inserted.
  * @param value    Pointer to value to be inserted.
@@ -270 +270 @@
  * This feature is used during insert by right rotation.
  *
- * @param node     B-tree node into wich the new key is to be inserted.
+ * @param node     B-tree node into which the new key is to be inserted.
  * @param key      The key to be inserted.
  * @param value    Pointer to value to be inserted.
@@ -463 +463 @@
         if (rnode->keys < BTREE_MAX_KEYS) {
                 /*
-                 * The rotaion can be done. The right sibling has free space.
+                 * The rotation can be done. The right sibling has free space.
                  */
                 node_insert_key_and_rsubtree(node, inskey, insvalue, rsubtree);
@@ -484 +484 @@
  * the median will be copied there.
  *
- * @param node     B-tree node wich is going to be split.
+ * @param node     B-tree node which is going to be split.
  * @param key      The key to be inserted.
  * @param value    Pointer to the value to be inserted.
@@ -562 +562 @@
         if (node->keys < BTREE_MAX_KEYS) {
                 /*
-                 * Node conatins enough space, the key can be stored immediately.
+                 * Node contains enough space, the key can be stored immediately.
                  */
                 node_insert_key_and_rsubtree(node, key, value, rsubtree);
@@ -806 +806 @@
                 
                 /*
-                 * The key can be immediatelly removed.
+                 * The key can be immediately removed.
                  *
                  * Note that the right subtree is removed because when

kernel/generic/src/adt/list.c

@@ -33 +33 @@
 /**
  * @file
- * @brief       Functions completing doubly linked circular list implementaion.
+ * @brief       Functions completing doubly linked circular list implementation.
  *
  * This file contains some of the functions implementing doubly linked circular lists.

uspace/lib/c/generic/adt/hash_table.c

@@ -190 +190 @@
 }
 
-/** Apply fucntion to all items in hash table.
+/** Apply function to all items in hash table.
  *
  * @param h   Hash table.

uspace/lib/c/generic/adt/list.c

@@ -33 +33 @@
 /**
  * @file
- * @brief       Functions completing doubly linked circular list implementaion.
+ * @brief       Functions completing doubly linked circular list implementation.
  *
  * This file contains some of the functions implementing doubly linked circular lists.