Searched refs:Item (Results 1 - 25 of 29) sorted by path

12

/haiku/headers/libs/alm/
H A DArea.h53 BLayoutItem* Item();
/haiku/headers/os/support/
H A DObjectList.h256 template<class Item, class Result, class Param1>
258 WhileEachListItem(BObjectList<Item>* list, Result (Item::*func)(Param1), argument
273 template<class Item, class Result, class Param1>
275 WhileEachListItem(BObjectList<Item>* list, Result (*func)(Item*, Param1),
290 template<class Item, class Result, class Param1, class Param2>
292 WhileEachListItem(BObjectList<Item>* list, Result (Item::*func)(Param1, Param2), argument
307 template<class Item, clas
345 EachListItemIgnoreResult(BObjectList<Item>* list, Result (Item::*func)()) argument
365 EachListItem(BObjectList<Item>* list, void (Item::*func)(Param1, Param2), Param1 p1, Param2 p2) argument
[all...]
/haiku/src/add-ons/kernel/file_systems/reiserfs/
H A DBlock.h33 class Item;
H A DIndirectItem.h34 class IndirectItem : public Item {
36 IndirectItem() : Item() {}
38 : Item(node, header) {}
H A DItem.cpp0 // Item.cpp
22 #include "Item.h"
36 \class Item
39 Item is the base class for DirItem, IndirectItem and StatItem.
41 on and to its ItemHeader. The Item locks the node in the block cache
42 as longs as it exists. An Item can be savely casted into one of the
47 Item::Item() function in class:Item
54 Item::Item(cons function in class:Item
62 Item::Item(LeafNode *node, const ItemHeader *header) function in class:Item
[all...]
H A DItem.h0 // Item.h
59 // Item
60 class Item { class
62 Item();
63 Item(const Item &item);
64 Item(LeafNode *node, const ItemHeader *header);
65 ~Item();
88 Item &operator=(const Item
[all...]
H A DDirItem.h30 #include "Item.h"
77 class DirItem : public Item {
79 DirItem() : Item() {}
81 : Item(node, header) {}
163 status_t error = Item::Check();
H A DIterators.cpp562 ItemIterator::GetCurrent(Item *item)
577 ItemIterator::GoToPrevious(Item *item)
602 ItemIterator::GoToNext(Item *item)
635 \param item Pointer to a pre-allocated Item that shall be set
640 ItemIterator::FindRightMostClose(const VKey *k, Item *item)
670 \param item Pointer to a pre-allocated Item that shall be set
675 ItemIterator::FindRightMost(const VKey *k, Item *item)
680 Item closeItem;
883 \param foundItem Pointer to a pre-allocated Item that shall be set
889 ObjectItemIterator::GetNext(Item *foundIte
[all...]
H A DIterators.h132 status_t GetCurrent(Item *item);
133 status_t GoToPrevious(Item *item = NULL);
134 status_t GoToNext(Item *item = NULL);
135 status_t FindRightMostClose(const VKey *k, Item *item = NULL);
136 status_t FindRightMost(const VKey *k, Item *item = NULL);
166 status_t GetNext(Item *foundItem);
167 status_t GetNext(Item *foundItem, uint32 type);
168 status_t GetPrevious(Item *foundItem);
169 status_t GetPrevious(Item *foundItem, uint32 type);
245 Item fIte
[all...]
H A DStatItem.h32 #include "Item.h"
224 class StatItem : public Item {
226 StatItem() : Item() {}
228 : Item(node, header) {}
/haiku/src/apps/diskusage/
H A DInfoWindow.cpp70 typedef pair<string, string> Item; typedef
71 typedef vector<Item> InfoList;
78 Item item;
95 info.push_back(Item(B_TRANSLATE_MARK("Size"), name.String()));
102 info.push_back(Item(B_TRANSLATE("Created"), tmp));
105 info.push_back(Item(B_TRANSLATE("Modified"), tmp));
110 info.push_back(Item(B_TRANSLATE("Kind"), tmp));
116 info.push_back(Item(B_TRANSLATE("Path"), path));
/haiku/src/apps/mediaplayer/
H A DController.h77 const PlaylistItem* Item() const function in class:Controller
H A DInfoWin.cpp354 const PlaylistItem* item = fController->Item();
H A DMainWin.cpp738 item = fController->Item();
2749 = dynamic_cast<const FilePlaylistItem*>(fController->Item());
2839 = dynamic_cast<const FilePlaylistItem*>(fController->Item());
/haiku/src/apps/switcher/
H A DGroupListView.cpp37 void* Item() const function in class:RendererLayoutItem
193 ? "group" : "item", rendererItem->Item());
/haiku/src/libs/alm/
H A DArea.cpp25 Area::Item() function in class:Area
H A DRowColumnManager.cpp140 BSize prefSize = row->fAreas.ItemAt(i)->Item()->PreferredSize();
167 BSize prefSize = column->fAreas.ItemAt(i)->Item()->PreferredSize();
/haiku/src/preferences/printers/
H A DSpoolFolder.h24 PrinterItem* Item() const { return fItem; } function in class:SpoolFolder
/haiku/src/tests/system/kernel/util/
H A DDoublyLinkedListTest.cpp87 template <typename Item>
91 DoublyLinkedList<Item, DoublyLinkedListMemberGetLink<Item> > list;
93 Item items[valueCount];
109 typename DoublyLinkedList<Item,
110 DoublyLinkedListMemberGetLink<Item> >::Iterator
122 Item *item;
131 Item *first = list.RemoveHead();
H A DDoublyLinkedListTest.h18 template <typename Item> void TestList();
/haiku/src/add-ons/input_server/devices/keyboard/
H A DTeamMonitorWindow.cpp121 TeamListItem* Item() { return fItem; } function in class:TeamDescriptionView
547 if (item == fDescriptionView->Item()) {
/haiku/src/add-ons/kernel/file_systems/btrfs/
H A DBTree.cpp149 result += Item(from)->Offset() + Item(from)->Size()
150 - Item(to)->Offset();
181 memcpy(Item(at), origin->Item(from), origin->_CalculateSpace(from, to));
182 // Item offset of copied node must be changed to get the
186 Item(i)->SetOffset(Item(i)->Offset() - length);
287 Item(i)->SetOffset(Item(
[all...]
H A DBTree.h162 btrfs_entry* Item(uint32 i) const function in class:BTree::Node
165 { return (uint8*)Item(0) + Item(i)->Offset(); }
/haiku/src/apps/mediaplayer/playlist/
H A DPlaylistListView.cpp66 class PlaylistListView::Item : public SimpleItem, class in class:PlaylistListView
69 Item(PlaylistItem* item);
70 virtual ~Item();
95 PlaylistListView::Item::Item(PlaylistItem* item) function in class:PlaylistListView::Item
104 PlaylistListView::Item::~Item()
111 PlaylistListView::Item::Draw(BView* owner, BRect frame, const font_height& fh,
206 PlaylistListView::Item::ItemChanged(const PlaylistItem* item)
215 PlaylistListView::Item
[all...]
H A DPlaylistListView.h58 class Item;
83 Item* fLastClickedItem;

Completed in 234 milliseconds

12