diff --git a/annotated.html b/annotated.html index 4a8cb414..a58fbbc6 100644 --- a/annotated.html +++ b/annotated.html @@ -103,30 +103,32 @@ $(document).ready(function(){initNavTree('annotated.html',''); initResizable();  CAVLnode  CBSTIteratorDefinition for a binary tree node  CCArray - Cdata - CDict - Cdynamic_array - CEdge - Celem - CGraph - CGraphRep - Chash_set_t - Ckohonen_array_3dTo store info regarding 3D arrays - CL - Cmax_heap - Cmin_heap - CNodeNode, the basic data structure of the tree - CnodeNode, the basic data structure in the tree - CpidPID Controller - Cqueue - CQueueRep - CStack - Csubset - CsudokuStructure to hold the matrix and dimensions - CT - Ctnode - CTrieNode - Cword_count_word + Ccluster + Cdata + CDict + Cdynamic_array + CEdge + Celem + CGraph + CGraphRep + Chash_set_t + Ckohonen_array_3dTo store info regarding 3D arrays + CL + Cmax_heap + Cmin_heap + CNodeNode, the basic data structure of the tree + CnodeNode, the basic data structure in the tree + Cobservation + CpidPID Controller + Cqueue + CQueueRep + CStack + Csubset + CsudokuStructure to hold the matrix and dimensions + CT + Ctnode + CTrieNode + Cword_count_word diff --git a/annotated_dup.js b/annotated_dup.js index 37e1343e..4bf99617 100644 --- a/annotated_dup.js +++ b/annotated_dup.js @@ -7,6 +7,7 @@ var annotated_dup = [ "AVLnode", "d2/d71/struct_a_v_lnode.html", "d2/d71/struct_a_v_lnode" ], [ "BSTIterator", "d4/d02/struct_b_s_t_iterator.html", "d4/d02/struct_b_s_t_iterator" ], [ "CArray", "d4/d2d/struct_c_array.html", "d4/d2d/struct_c_array" ], + [ "cluster", "d1/d99/structcluster.html", "d1/d99/structcluster" ], [ "data", "df/dea/structdata.html", "df/dea/structdata" ], [ "Dict", "d4/dfe/struct_dict.html", "d4/dfe/struct_dict" ], [ "dynamic_array", "d6/d42/structdynamic__array.html", "d6/d42/structdynamic__array" ], @@ -21,6 +22,7 @@ var annotated_dup = [ "min_heap", "de/dce/structmin__heap.html", "de/dce/structmin__heap" ], [ "Node", "db/d8b/struct_node.html", "db/d8b/struct_node" ], [ "node", "d5/da1/structnode.html", "d5/da1/structnode" ], + [ "observation", "d1/d5e/structobservation.html", "d1/d5e/structobservation" ], [ "pid", "d0/d43/structpid.html", "d0/d43/structpid" ], [ "queue", "d2/d36/structqueue.html", "d2/d36/structqueue" ], [ "QueueRep", "d0/d10/struct_queue_rep.html", "d0/d10/struct_queue_rep" ], diff --git a/classes.html b/classes.html index fbe25617..fd59e780 100644 --- a/classes.html +++ b/classes.html @@ -94,91 +94,96 @@ $(document).ready(function(){initNavTree('classes.html',''); initResizable(); })
Data Structure Index
-
_ | a | b | c | d | e | g | h | k | l | m | n | p | q | s | t | w
+
_ | a | b | c | d | e | g | h | k | l | m | n | o | p | q | s | t | w
- + - + - + + + - - - + - + - + - + - + - - + - + - + + - - + - + + + - + + +
  _  
  d  
-
cluster   
  h  
  n  
-
node    subset   
sudoku   
  d  
+
  o  
+
sudoku   
_big_int   data    hash_set_t   Node   
  t  
_cantor_set   Dict   data   
  k  
node   observation   
_large_num   dynamic_array   Dict   
  p  
T   
  a  
  e  
-
dynamic_array    kohonen_array_3d    tnode   
  l  
+
  e  
+
  l  
pid    TrieNode   
adaline   Edge   
  q  
  w  
AVLnode   elem   Edge    L   
  b  
  g  
-
elem   
  m  
queue    word_count_word   
QueueRep   
  g  
+
QueueRep   
BSTIterator   Graph    max_heap   
  s  
  c  
GraphRep   Graph    min_heap   
Stack   
GraphRep   
  n  
+
Stack   
CArray   
Node   
-
_ | a | b | c | d | e | g | h | k | l | m | n | p | q | s | t | w
+
_ | a | b | c | d | e | g | h | k | l | m | n | o | p | q | s | t | w
diff --git a/d0/d43/structpid.html b/d0/d43/structpid.html index 30b6ec2f..9849dae5 100644 --- a/d0/d43/structpid.html +++ b/d0/d43/structpid.html @@ -128,7 +128,7 @@ float integralTerms of the controller can be removed by setting their gain to 0, creating a PI (kD = 0) or PD (kI = 0) controller. Depending on the control problem at hand, some terms may not increase the performance of the system, or may have a negative effect.

For a more mathematical expanation of the PID Controller, see https://en.wikipedia.org/wiki/PID_controller

Limitations of this implementation:

Inputs: e(t) - Current error at time t. For example, how far a servo is off the desired angle Output: u(t) - Controller output at time t.


The documentation for this struct was generated from the following file: diff --git a/functions_vars.html b/functions_vars.html index dd909c21..c91acabf 100644 --- a/functions_vars.html +++ b/functions_vars.html @@ -94,6 +94,9 @@ $(document).ready(function(){initNavTree('functions_vars.html',''); initResizabl
  • a : sudoku
  • +
  • count +: cluster +
  • data : kohonen_array_3d , Node @@ -117,6 +120,9 @@ $(document).ready(function(){initNavTree('functions_vars.html',''); initResizabl
  • eta : adaline
  • +
  • group +: observation +
  • left : node
  • @@ -159,6 +165,14 @@ $(document).ready(function(){initNavTree('functions_vars.html',''); initResizabl
  • weights : adaline
  • +
  • x +: cluster +, observation +
  • +
  • y +: cluster +, observation +
  • diff --git a/globals_func_m.html b/globals_func_m.html index 744867e6..13e4b86e 100644 --- a/globals_func_m.html +++ b/globals_func_m.html @@ -94,7 +94,7 @@ $(document).ready(function(){initNavTree('globals_func_m.html',''); initResizabl

    - m -