i2p/haiku-beta6
1
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity

Minor whitespace cleanup.

Browse Source
This commit is contained in:
Axel Dörfler
2012-03-09 21:18:34 +01:00
parent d7f3dac1eb
commit 6307c1ebb1
1 changed files with 10 additions and 0 deletions
Download Patch File Download Diff File Expand all files Collapse all files
src/add-ons/kernel/file_systems/bfs/BPlusTree.h
+10
View File
@@ -388,6 +388,7 @@ BPlusTree::Remove(Transaction& transaction, const char* key, off_t value)
return Remove(transaction, (uint8*)key, strlen(key), value); return Remove(transaction, (uint8*)key, strlen(key), value);
} }
inline status_t inline status_t
BPlusTree::Insert(Transaction& transaction, const char* key, off_t value) BPlusTree::Insert(Transaction& transaction, const char* key, off_t value)
{ {
@@ -396,6 +397,7 @@ BPlusTree::Insert(Transaction& transaction, const char* key, off_t value)
return Insert(transaction, (uint8*)key, strlen(key), value); return Insert(transaction, (uint8*)key, strlen(key), value);
} }
inline status_t inline status_t
BPlusTree::Insert(Transaction& transaction, int32 key, off_t value) BPlusTree::Insert(Transaction& transaction, int32 key, off_t value)
{ {
@@ -404,6 +406,7 @@ BPlusTree::Insert(Transaction& transaction, int32 key, off_t value)
return Insert(transaction, (uint8*)&key, sizeof(key), value); return Insert(transaction, (uint8*)&key, sizeof(key), value);
} }
inline status_t inline status_t
BPlusTree::Insert(Transaction& transaction, uint32 key, off_t value) BPlusTree::Insert(Transaction& transaction, uint32 key, off_t value)
{ {
@@ -412,6 +415,7 @@ BPlusTree::Insert(Transaction& transaction, uint32 key, off_t value)
return Insert(transaction, (uint8*)&key, sizeof(key), value); return Insert(transaction, (uint8*)&key, sizeof(key), value);
} }
inline status_t inline status_t
BPlusTree::Insert(Transaction& transaction, int64 key, off_t value) BPlusTree::Insert(Transaction& transaction, int64 key, off_t value)
{ {
@@ -420,6 +424,7 @@ BPlusTree::Insert(Transaction& transaction, int64 key, off_t value)
return Insert(transaction, (uint8*)&key, sizeof(key), value); return Insert(transaction, (uint8*)&key, sizeof(key), value);
} }
inline status_t inline status_t
BPlusTree::Insert(Transaction& transaction, uint64 key, off_t value) BPlusTree::Insert(Transaction& transaction, uint64 key, off_t value)
{ {
@@ -428,6 +433,7 @@ BPlusTree::Insert(Transaction& transaction, uint64 key, off_t value)
return Insert(transaction, (uint8*)&key, sizeof(key), value); return Insert(transaction, (uint8*)&key, sizeof(key), value);
} }
inline status_t inline status_t
BPlusTree::Insert(Transaction& transaction, float key, off_t value) BPlusTree::Insert(Transaction& transaction, float key, off_t value)
{ {
@@ -436,6 +442,7 @@ BPlusTree::Insert(Transaction& transaction, float key, off_t value)
return Insert(transaction, (uint8*)&key, sizeof(key), value); return Insert(transaction, (uint8*)&key, sizeof(key), value);
} }
inline status_t inline status_t
BPlusTree::Insert(Transaction& transaction, double key, off_t value) BPlusTree::Insert(Transaction& transaction, double key, off_t value)
{ {
@@ -454,6 +461,7 @@ TreeIterator::Rewind()
return Goto(BPLUSTREE_BEGIN); return Goto(BPLUSTREE_BEGIN);
} }
inline status_t inline status_t
TreeIterator::GetNextEntry(void* key, uint16* keyLength, uint16 maxLength, TreeIterator::GetNextEntry(void* key, uint16* keyLength, uint16 maxLength,
off_t* value, uint16* duplicate) off_t* value, uint16* duplicate)
@@ -462,6 +470,7 @@ TreeIterator::GetNextEntry(void* key, uint16* keyLength, uint16 maxLength,
duplicate); duplicate);
} }
inline status_t inline status_t
TreeIterator::GetPreviousEntry(void* key, uint16* keyLength, uint16 maxLength, TreeIterator::GetPreviousEntry(void* key, uint16* keyLength, uint16 maxLength,
off_t* value, uint16* duplicate) off_t* value, uint16* duplicate)
@@ -591,4 +600,5 @@ bplustree_node::MaxFragments(uint32 nodeSize)
return nodeSize / ((NUM_FRAGMENT_VALUES + 1) * sizeof(off_t)); return nodeSize / ((NUM_FRAGMENT_VALUES + 1) * sizeof(off_t));
} }
#endif // B_PLUS_TREE_H #endif // B_PLUS_TREE_H