Searched refs:Node (Results 1 - 25 of 535) sorted by path

1234567891011>>

/haiku/headers/libs/print/libprint/
H A DDbgMsg.h12 #include <Node.h>
/haiku/headers/os/
H A DStorageKit.h13 #include <Node.h>
/haiku/headers/os/mail/
H A DMailAttachment.h9 #include <Node.h>
/haiku/headers/os/media/
H A DParameterWeb.h85 media_node Node();
/haiku/headers/os/package/
H A DInstallationLocationInfo.h9 #include <Node.h>
/haiku/headers/os/storage/
H A DDirectory.h9 #include <Node.h>
H A DFile.h10 #include <Node.h>
H A DFilePanel.h11 #include <Node.h>
H A DNodeMonitor.h79 #include <Node.h>
H A DSymLink.h9 #include <Node.h>
/haiku/headers/private/debugger/value/
H A DValueNode.h118 ValueNode* Node() const { return fNode; } function in class:ValueNodeChild
/haiku/headers/private/kernel/boot/
H A DFileMapDisk.h43 class FileMapDisk : public Node {
48 status_t Init(Node *node/*Partition *partition, FileMap *map, off_t imageSize*/);
68 Node *fNode;
H A Dpartitions.h17 class Partition : public Node, public partition_data {
/haiku/headers/private/kernel/boot/net/
H A DRemoteDisk.h16 class RemoteDisk : public Node {
H A DiSCSITarget.h78 class iSCSITarget : public Node {
/haiku/headers/private/kernel/util/
H A DAVLTreeMap.h26 typename Node;
27 inline Node* Allocate(const Key& key, const Value& value)
28 inline void Free(Node* node)
29 inline const Key GetKey(const Node* node) const
30 inline Value& GetValue(Node* node) const
31 inline AVLTreeNode* GetAVLTreeNode(Node* node) const
32 inline Node* GetNode(AVLTreeNode* node) const
33 inline int CompareKeyNode(const Key& a, const Node* b)
34 inline int CompareNodes(const Node* a, const Node*
50 typedef typename NodeStrategy::Node Node; typedef in class:AVLTreeMap
600 struct Node : AVLTreeNode { struct in class:AVLTreeMapStrategy::Auto
601 Node(const Key &key, const Value &value) function in struct:AVLTreeMapStrategy::Auto::Node
[all...]
H A DSplayTree.h38 template<typename Node>
40 Node* left;
41 Node* right;
49 typedef typename Definition::NodeType Node; typedef in class:SplayTree
50 typedef SplayTreeLink<Node> Link;
63 bool Insert(Node* node)
97 Node* Remove(const Key& key)
108 Node* node = fRoot;
113 Node* temp = rootLink->right;
126 bool Remove(Node* nod
356 typedef typename Definition::NodeType Node; typedef in class:IteratableSplayTree
[all...]
/haiku/headers/private/mail/
H A DNodeMessage.h23 #include <Node.h>
H A Dmail_util.h17 #include <Node.h>
/haiku/headers/private/print/
H A DPrinter.h16 #include <Node.h>
H A DPrinterRoster.h14 #include <Node.h>
/haiku/headers/private/shared/
H A DColorQuantizer.h56 struct Node;
59 void _AddColor(Node** _node, uint8 r, uint8 g, uint8 b,
61 uint32* _leafCount, Node** reducibleNodes);
62 Node* _CreateNode(uint32 level, uint32 bitsPerColor,
63 uint32* _leafCount, Node** reducibleNodes);
65 Node** reducibleNodes);
66 void _DeleteTree(Node** _node);
68 void _GetPaletteColors(Node* node, RGBA* table,
72 Node* fTree;
74 Node* fReducibleNode
[all...]
H A DFunctionObject.h43 #include <Node.h>
/haiku/headers/private/storage/
H A DNotOwningEntryRef.h13 #include <Node.h>
/haiku/headers/tools/cppunit/cppunit/
H A DXmlOutputter.h56 class CPPUNIT_API Node class in class:CppUnit::XmlOutputter
59 Node( std::string elementName,
61 Node( std::string elementName,
63 virtual ~Node();
69 void addNode( Node *node );
85 typedef std::deque<Node *> Nodes;
94 virtual Node *makeRootNode();
96 Node *rootNode );
98 Node *rootNode );
99 virtual void addStatistics( Node *rootNod
[all...]

Completed in 156 milliseconds

1234567891011>>