type_gavltree.html

来自「一个由Mike Gashler完成的机器学习方面的includes neural」· HTML 代码 · 共 57 行

HTML
57 行
字号 
<html><head><title>Generated Documentation</title></head><body>	<image src="headerimage.png">	<br><br><table><tr><td><big><big><big style="font-family: arial;"><b>GAVLTree</b></big></big></big><br><br></td><td></td></tr></table><br><br><big><big><i>Statics (public)</i></big></big><br><div style="margin-left: 40px;">void <big><b>Test</b></big>()<br></div><br><big><big><i>Constructors (public)</i></big></big><br><div style="margin-left: 40px;"><big><b>GAVLTree</b></big>()<br></div><br><big><big><i>Destructors</i></big></big><br><div style="margin-left: 40px;"><big><b>~GAVLTree</b></big>()<br></div><br><big><big><i>Public</i></big></big><br><div style="margin-left: 40px;">bool <big><b>Delete</b></big>(int nIndex)<br><div style="margin-left: 80px;"><font color=brown> Removes and deletes a node from the tree.  Returns true if a node was found to delete</font></div><br>bool <big><b>Delete</b></big>(<a href="type_GAVLNode.html">GAVLNode</a>* pLikeMe)<br><div style="margin-left: 80px;"><font color=brown> Removes and deletes a node from the tree.  Returns true if a node was found to delete</font></div><br><a href="type_GAVLNode.html">GAVLNode</a>* <big><b>FindCloseNode</b></big>(<a href="type_GAVLNode.html">GAVLNode</a>* pLikeMe, int* pnOutIndex)<br><div style="margin-left: 80px;"><font color=brown> Finds a node that's adjacent to the spot where pLikeMe would go if it were in the tree. (Note that this isn't always the node with the value closest to the value of pLikeMe, because the one on the other side might be closer, but one of the two is always the closest.)</font></div><br><a href="type_GAVLNode.html">GAVLNode</a>* <big><b>GetNode</b></big>(int* n)<br><div style="margin-left: 80px;"><font color=brown> Returns a node from the tree</font></div><br><a href="type_GAVLNode.html">GAVLNode</a>* <big><b>GetNode</b></big>(<a href="type_GAVLNode.html">GAVLNode</a>* pLikeMe, int* pnOutIndex)<br><div style="margin-left: 80px;"><font color=brown> Gets a node that compares equal to pLikeMe.</font></div><br>int <big><b>GetSize</b></big>()<br><div style="margin-left: 80px;"><font color=brown> Returns the number of nodes in the tree</font></div><br>void <big><b>Insert</b></big>(<a href="type_GAVLNode.html">GAVLNode</a>* pNode)<br><div style="margin-left: 80px;"><font color=brown> Inserts a node into the tree</font></div><br><a href="type_GAVLNode.html">GAVLNode</a>* <big><b>Unlink</b></big>(<a href="type_GAVLNode.html">GAVLNode</a>* pLikeMe)<br><div style="margin-left: 80px;"><font color=brown> Removes a node from the tree and returns it to you so you can delete it</font></div><br><a href="type_GAVLNode.html">GAVLNode</a>* <big><b>Unlink</b></big>(int* nIndex)<br><div style="margin-left: 80px;"><font color=brown> Removes a node from the tree and returns it to you so you can delete it</font></div><br></div><br><big><big><i>Protected</i></big></big><br><div style="margin-left: 40px;"><a href="type_GAVLNode.html">GAVLNode</a>* <big><b>GetRoot</b></big>()<br></div><br></body></html>

type_gavltree.html - 源码说明

本页面展示了「一个由Mike Gashler完成的机器学习方面的includes neural net, naive bayesian classifier, decision tree, KNN, a genet」中的 type_gavltree.html 源码文件，采用 HTML 编程语言编写，共 57 行代码。您可以在线阅读完整代码内容，也可以返回资源详情页下载完整源码包进行本地学习和开发。

虫虫下载站收录了大量与classifier相关的技术资源，包括源代码、技术文档、电路图等，是电子工程师和嵌入式开发者的专业学习平台。

⌨️ 快捷键说明

复制代码Ctrl + C
搜索代码Ctrl + F
全屏模式F11
增大字号Ctrl + =
减小字号Ctrl + -
显示快捷键?