diff --git a/annotated.html b/annotated.html index fd5c25b62..2840c75c5 100644 --- a/annotated.html +++ b/annotated.html @@ -97,13 +97,13 @@ $(document).ready(function(){initNavTree('annotated.html',''); initResizable();
Here are the data structures with brief descriptions:
- - - - - - - + + + + + + + diff --git a/annotated_dup.js b/annotated_dup.js index ded845378..a3d7dd031 100644 --- a/annotated_dup.js +++ b/annotated_dup.js @@ -8,13 +8,13 @@ var annotated_dup = [ "Overview", "d7/db5/md_exercism__r_e_a_d_m_e.html#autotoc_md28", null ], [ "LeetCode Algorithm", "df/d58/md_leetcode__r_e_a_d_m_e.html#autotoc_md30", null ], [ "_big_int", "dc/d77/struct__big__int.html", "dc/d77/struct__big__int" ], + [ "_cantor_set", "d9/dd7/struct__cantor__set.html", "d9/dd7/struct__cantor__set" ], [ "_large_num", "d3/d5a/struct__large__num.html", "d3/d5a/struct__large__num" ], [ "adaline", "d2/daa/structadaline.html", "d2/daa/structadaline" ], [ "array_3d", "d0/dc8/structarray__3d.html", "d0/dc8/structarray__3d" ], [ "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" ], - [ "contour", "d2/d89/structcontour.html", "d2/d89/structcontour" ], [ "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" ], diff --git a/classes.html b/classes.html index 149c1ddc7..195daeff5 100644 --- a/classes.html +++ b/classes.html @@ -98,80 +98,80 @@ $(document).ready(function(){initNavTree('classes.html',''); initResizable(); })
 C_big_intStore arbitratily large integer values as a linked list of digits
 C_large_numDynamically large number
 CadalineStructure to hold adaline model parameters
 Carray_3dTo store info regarding 3D arrays
 CAVLnode
 CBSTIteratorDefinition for a binary tree node
 CCArray
 Ccontour
 C_cantor_setStructure to define Cantor set
 C_large_numDynamically large number
 CadalineStructure to hold adaline model parameters
 Carray_3dTo store info regarding 3D arrays
 CAVLnode
 CBSTIteratorDefinition for a binary tree node
 CCArray
 Cdata
 CDict
 Cdynamic_array
- + - - + - - + + - - + - - - - + + + - + + - - + + - - + - + - + - + - - - + +
  _  
contour   
  c  
+
GraphRep    node    tnode   
  d  
-
  h  
+
  h  
  p  
TrieNode   
_big_int   CArray   
  w  
_large_num   data   
_cantor_set   
  d  
+
hash_set_t    pid   
  a  
-
Dict   
_large_num   
  l  
  q  
word_count_word   
dynamic_array   
adaline   
  e  
+
  a  
data   
Dict    L    queue   
array_3d   
adaline   dynamic_array   
  m  
QueueRep   
AVLnode   Edge   
array_3d   
  e  
+
  s  
  b  
-
elem   
AVLnode    max_heap   
  g  
+
  b  
Edge    min_heap    Stack   
BSTIterator   
elem   
  n  
subset   
  c  
+
BSTIterator   
  g  
Graph   
  t  
Node   
CArray   T   
Graph   T   
diff --git a/d0/d91/binary__search_8c__incl.map b/d0/d91/binary__search_8c__incl.map new file mode 100644 index 000000000..37941bd18 --- /dev/null +++ b/d0/d91/binary__search_8c__incl.map @@ -0,0 +1,5 @@ + + + + + diff --git a/d0/d91/binary__search_8c__incl.md5 b/d0/d91/binary__search_8c__incl.md5 new file mode 100644 index 000000000..ec6cfcd33 --- /dev/null +++ b/d0/d91/binary__search_8c__incl.md5 @@ -0,0 +1 @@ +544ed89d8f854428f7f41142fd9ffe39 \ No newline at end of file diff --git a/d0/d91/binary__search_8c__incl.svg b/d0/d91/binary__search_8c__incl.svg new file mode 100644 index 000000000..4451ee879 --- /dev/null +++ b/d0/d91/binary__search_8c__incl.svg @@ -0,0 +1,52 @@ + + + + + + +searching/binary_search.c + + + +Node1 + + +searching/binary_search.c + + + + + +Node2 + + +assert.h + + + + + +Node1->Node2 + + + + + +Node3 + + +stdio.h + + + + + +Node1->Node3 + + + + + diff --git a/d2/d89/structcontour.js b/d2/d89/structcontour.js deleted file mode 100644 index 78fac44d2..000000000 --- a/d2/d89/structcontour.js +++ /dev/null @@ -1,6 +0,0 @@ -var structcontour = -[ - [ "end", "d2/d89/structcontour.html#acff4c6a80e7d8b15a27f42add6dff976", null ], - [ "next", "d2/d89/structcontour.html#a37ee431bf2d840798656489101dbaaf3", null ], - [ "start", "d2/d89/structcontour.html#a6acf2aeeb306adbed73b797d810ded37", null ] -]; \ No newline at end of file diff --git a/d4/d68/qr__decompose_8h_source.html b/d4/d68/qr__decompose_8h_source.html index b8e78034a..badeccbe3 100644 --- a/d4/d68/qr__decompose_8h_source.html +++ b/d4/d68/qr__decompose_8h_source.html @@ -309,10 +309,13 @@ $(document).ready(function(){initNavTree('d4/d68/qr__decompose_8h_source.html','
#define max(a, b)
shorthand for maximum value
Definition: kohonen_som_trace.c:26
void test3()
Test that creates a random set of points distributed in eight clusters in 3D space and trains an SOM ...
Definition: kohonen_som_topology.c:596
void exact_solution(const double *x, double *y)
Exact solution of the problem.
Definition: ode_midpoint_euler.c:67
+
struct _cantor_set * next
pointer to next set
Definition: cantor_set.c:15
+
int main(int argc, char const *argv[])
Main function.
Definition: cantor_set.c:84
int compare(const void *a, const void *b)
comparison function for use with internal qsort algorithm
Definition: sol1.c:19
int main(int argc, char **argv)
Main function.
Definition: lu_decompose.c:79
int main(int argc, char *argv[])
Main Function.
Definition: ode_semi_implicit_euler.c:147
#define min(a, b)
shorthand for minimum value
Definition: kohonen_som_topology.c:36
+
void propagate(CantorSet *head)
Iterative constructor of all sets in the current level.
Definition: cantor_set.c:23
double vector_mag(double *vector, int L)
Compute magnitude of vector.
Definition: qr_decompose.h:64
void delete_adaline(struct adaline *ada)
delete dynamically allocated memory
Definition: adaline_learning.c:82
void test_circle(double *const *data, int N)
Creates a random set of points distributed near the circumference of a circle and trains an SOM that ...
Definition: kohonen_som_trace.c:212
@@ -322,6 +325,7 @@ $(document).ready(function(){initNavTree('d4/d68/qr__decompose_8h_source.html','
Definition: prime_factoriziation.c:25
PID Controller.
Definition: pid.c:31
double complex d_func(double complex x)
Return first order derivative of the function.
Definition: newton_raphson_root.c:32
+
struct _cantor_set CantorSet
structure to define Cantor set
int main(int argc, char **argv)
Main function.
Definition: kohonen_som_topology.c:656
int main(int argc, char **argv)
Main function.
Definition: adaline_learning.c:379
double * data_3d(const struct array_3d *arr, int x, int y, int z)
Function that returns the pointer to (x, y, z) ^th location in the linear 3D array given by:
Definition: kohonen_som_topology.c:60
@@ -332,6 +336,7 @@ $(document).ready(function(){initNavTree('d4/d68/qr__decompose_8h_source.html','
long double complex poly_function(double *coeffs, unsigned int degree, long double complex x)
Evaluate the value of a polynomial with given coefficients.
Definition: durand_kerner_roots.c:50
Kyler Smith, 2017 Stack data structure implementation.
Definition: binary_search_tree.c:14
double * vector_proj(double *a, double *b, double *out, int L)
Compute projection of vector on defined as.
Definition: qr_decompose.h:76
+
void free_memory(CantorSet *head)
Clear memory allocated by propagate function.
Definition: cantor_set.c:72
unsigned int num_digits
number of digits in the number
Definition: factorial_large_number.c:17
void test3()
Test that creates a random set of points distributed in six clusters in 3D space.
Definition: kohonen_som_trace.c:451
void test_3d_classes2(double *const *data, int N)
Creates a random set of points distributed in four clusters in 3D space with centroids at the points.
Definition: kohonen_som_topology.c:551
@@ -355,6 +360,8 @@ $(document).ready(function(){initNavTree('d4/d68/qr__decompose_8h_source.html','
int main(int argc, char **argv)
main function
Definition: newton_raphson_root.c:37
int main(int argc, char **argv)
Main function.
Definition: kohonen_som_trace.c:506
void fib(unsigned long n, unsigned long *C, unsigned long *D)
Returns the and Fibonacci number.
Definition: fibonacci_fast.c:20
+
double start
start of interval
Definition: cantor_set.c:13
+
double end
end of interval
Definition: cantor_set.c:14
void print_matrix(double **A, int M, int N)
function to display matrix on stdout
Definition: qr_decompose.h:22
double vector_dot(double *a, double *b, int L)
Compute dot product of two vectors of equal lengths.
Definition: qr_decompose.h:43
double eta
learning rate of the algorithm
Definition: adaline_learning.c:39
@@ -392,7 +399,7 @@ $(document).ready(function(){initNavTree('d4/d68/qr__decompose_8h_source.html','
int save_2d_data(const char *fname, double **X, int num_points, int num_features)
Save a given n-dimensional data martix to file.
Definition: kohonen_som_topology.c:95
double complex func(double complex x)
Return value of the function to find the root for.
Definition: newton_raphson_root.c:22
int activation(double x)
Heaviside activation function
Definition: adaline_learning.c:95
-
Definition: cantor_set.c:6
+
void test()
Test implementations.
Definition: binary_search.c:75
void test1(double eta)
test function to predict points in a 2D coordinate system above the line as +1 and others as -1.
Definition: adaline_learning.c:206
void test2(double eta)
test function to predict points in a 2D coordinate system above the line as +1 and others as -1.
Definition: adaline_learning.c:254
#define ACCURACY
maximum accuracy limit
Definition: durand_kerner_roots.c:41
@@ -407,9 +414,11 @@ $(document).ready(function(){initNavTree('d4/d68/qr__decompose_8h_source.html','
#define ACCURACY
convergence accuracy
Definition: adaline_learning.c:44
void test1()
Test that creates a random set of points distributed in four clusters in 2D space and trains an SOM t...
Definition: kohonen_som_topology.c:393
int dim2
lengths of second dimension
Definition: kohonen_som_topology.c:43
+
structure to define Cantor set
Definition: cantor_set.c:12
char * digits
array to store individual digits
Definition: factorial_large_number.c:16
void kohonen_som(double **X, struct array_3d *W, int num_samples, int num_features, int num_out, double alpha_min)
Apply incremental algorithm with updating neighborhood and learning rates on all samples in the given...
Definition: kohonen_som_topology.c:306
void problem(const double *x, double *y, double *dy)
Problem statement for a system with first-order differential equations.
Definition: ode_midpoint_euler.c:54
+
void print(CantorSet *head)
Print sets in the current range to stdout
Definition: cantor_set.c:55
#define order
number of dependent variables in problem
Definition: ode_forward_euler.c:44
int num_weights
number of weights of the neural network
Definition: adaline_learning.c:41
void add_digit(large_num *num, unsigned int value)
add a digit to the large number
Definition: factorial_large_number.c:48
diff --git a/d6/df3/graph_8h_source.html b/d6/df3/graph_8h_source.html index 393954e88..e427f172e 100644 --- a/d6/df3/graph_8h_source.html +++ b/d6/df3/graph_8h_source.html @@ -150,6 +150,7 @@ $(document).ready(function(){initNavTree('d6/df3/graph_8h_source.html','../../')
Definition: dynamic_array.h:7
Definition: bellman_ford.c:8
Definition: bellman_ford.c:14
+
void print(CantorSet *head)
Print sets in the current range to stdout
Definition: cantor_set.c:55
struct Node node
Node, the basic data structure of the tree.
unsigned long MAX_N
upper limit of numbers to check
Definition: sol1.c:13
unsigned long gcd(unsigned long a, unsigned long b)
Compute Greatest Common Divisor (GCD) of two numbers using Euclids algorithm.
Definition: sol.c:11
+
int main(void)
Main function.
Definition: binary_search.c:105
struct _big_int * prev_digit
units place
Definition: sol1.c:21
store arbitratily large integer values as a linked list of digits.
Definition: sol1.c:18
int main()
Main function.
Definition: sol2.c:15
@@ -313,6 +314,7 @@ Here is the call graph for this function:
c_atoi
int c_atoi(const char *str)
the function take a string and return an integer
Definition: c_atoi_str_to_integer.c:16
collatz
long long collatz(long long start_num)
Computes the length of collatz sequence for a given starting number.
Definition: sol1.c:27
main
int main(int argc, char *argv[])
Main function.
Definition: shell_sort2.c:55
+
test
void test()
Test implementations.
Definition: binary_search.c:75
MAX_N
long MAX_N
Limit of numbers to check.
Definition: sol2.c:17
shell_sort
void shell_sort(int *array, long LEN)
Optimized algorithm - takes half the time as other.
Definition: shell_sort2.c:31
main
int main()
Main function.
Definition: sol4.c:12
@@ -320,6 +322,7 @@ Here is the call graph for this function:
max
#define max(a, b)
shorthand for maximum value
Definition: kohonen_som_topology.c:32
add_digit
big_int * add_digit(big_int *digit, char value)
Function that allocates memory to add another digit at the MSB.
Definition: sol1.c:37
LIMS
#define LIMS
limit of range of matrix values
Definition: qr_eigen_values.c:19
+
binarysearch2
int binarysearch2(const int *arr, int l, int r, int x)
Iterative implementation.
Definition: binary_search.c:51
eigen_values
double eigen_values(double **A, double *eigen_vals, int mat_size, char debug_print)
Compute eigen values using iterative shifted QR decomposition algorithm as follows:
Definition: qr_eigen_values.c:104
test_c_atoi
void test_c_atoi()
test the function implementation
Definition: c_atoi_str_to_integer.c:56
is_leap_year
char is_leap_year(short year)
return 1 if input year is a leap year otherwise, return 0
Definition: sol1.c:41
@@ -327,7 +330,9 @@ Here is the call graph for this function:
tnode
Definition: multikey_quick_sort.c:205
is_sum_of_abundant
char is_sum_of_abundant(unsigned long N)
check if a given number can be represented as a sum of two abundant numbers.
Definition: sol1.c:69
create_matrix
void create_matrix(double **A, int N)
create a square matrix of given size with random elements
Definition: qr_eigen_values.c:27
+
print
void print(CantorSet *head)
Print sets in the current range to stdout
Definition: cantor_set.c:55
abundant_flags
char * abundant_flags
This is the global array to be used to store a flag to identify if a particular number is abundant (1...
Definition: sol2.c:26
+
binarysearch1
int binarysearch1(const int *arr, int l, int r, int x)
Recursive implementation.
Definition: binary_search.c:21
@@ -93,37 +93,45 @@ $(document).ready(function(){initNavTree('d2/d89/structcontour.html','../../');
Data Fields
-
contour Struct Reference
+
_cantor_set Struct Reference
+ +

structure to define Cantor set + More...

-Collaboration diagram for contour:
+Collaboration diagram for _cantor_set:
-
+
[legend]
- - - - - - + + + + + + + + +

Data Fields

-double start
 
-double end
 
-struct contour * next
 
+double start
 start of interval
 
+double end
 end of interval
 
+struct _cantor_set * next
 pointer to next set
 
-
The documentation for this struct was generated from the following file:
diff --git a/dir_da574daf9ce9c05b45556bdc871ed1e3.js b/dir_da574daf9ce9c05b45556bdc871ed1e3.js new file mode 100644 index 000000000..0d041a7f0 --- /dev/null +++ b/dir_da574daf9ce9c05b45556bdc871ed1e3.js @@ -0,0 +1,4 @@ +var dir_da574daf9ce9c05b45556bdc871ed1e3 = +[ + [ "binary_search.c", "df/d3b/binary__search_8c.html", "df/d3b/binary__search_8c" ] +]; \ No newline at end of file diff --git a/files.html b/files.html index cbdfc73a6..04f91dfee 100644 --- a/files.html +++ b/files.html @@ -136,77 +136,80 @@ $(document).ready(function(){initNavTree('files.html',''); initResizable(); });  kohonen_som_topology.cKohonen self organizing map (topological map)  kohonen_som_trace.cKohonen self organizing map (data tracing)  ▼ misc - collatz.cImplementation of Collatz' conjecture - factorial_large_number.cCompute factorial of arbitrarily large numbers by storing individual digits in a byte - fibonacci_fast.cCompute \(m^{mth}\) Fibonacci number using the formulae: - ▼ numerical_methods - durand_kerner_roots.cCompute all possible approximate roots of any given polynomial using Durand Kerner algorithm - lu_decompose.cLU decomposition of a square matrix - newton_raphson_root.cFind approximate solution for \(f(x) = 0\) using Newton-Raphson interpolation algorithm - ode_forward_euler.cSolve a multivariable first order ordinary differential equation (ODEs) using forward Euler method - ode_midpoint_euler.cSolve a multivariable first order ordinary differential equation (ODEs) using midpoint Euler method - ode_semi_implicit_euler.cSolve a multivariable first order ordinary differential equation (ODEs) using semi implicit Euler method - qr_decompose.hLibrary functions to compute QR decomposition of a given matrix - qr_decomposition.cProgram to compute the QR decomposition of a given matrix - qr_eigen_values.cCompute real eigen values and eigen vectors of a symmetric matrix using QR decomposition method - realtime_stats.cCompute statistics for data entered in rreal-time - ▼ project_euler - ► problem_1 - sol1.cProblem 1 solution - sol2.cProblem 1 solution - sol3.cProblem 1 solution. This solution is based on the pattern that the successive numbers in the series follow: 0+3,+2,+1,+3,+1,+2,+3 - sol4.cProblem 1 solution - ► problem_10 - sol1.cProblem 10 solution - sol2.cProblem 10 solution - ► problem_12 - sol1.cProblem 12 solution - ► problem_13 - sol1.cProblem 13 solution - ► problem_14 - sol1.cProblem 14 solution - ► problem_15 - sol1.cProblem 15 solution - ► problem_16 - sol1.cProblem 16 solution - ► problem_19 - sol1.cProblem 19 solution - ► problem_2 - so1.cProblem 2 solution - ► problem_20 - sol1.cProblem 20 solution - ► problem_21 - sol1.cProblem 21 solution - ► problem_22 - sol1.cProblem 22 solution - ► problem_23 - sol1.cProblem 23 solution - sol2.cProblem 23 solution - optimization using look-up array - ► problem_25 - sol1.cProblem 25 solution implemented using arbitrarily large numbers represented as arrays - ► problem_26 - sol1.cProblem 26 solution - ► problem_3 - sol1.cProblem 3 solution - sol2.cProblem 3 solution - ► problem_4 - sol.cProblem 4 solution - ► problem_401 - sol1.cProblem 401 solution - Sum of squares of divisors - ► problem_5 - sol.cProblem 5 solution - ► problem_6 - sol.cProblem 6 solution - ► problem_7 - sol.cProblem 7 solution - ► problem_8 - sol1.cProblem 8 solution - sol2.cProblem 8 solution - ► problem_9 - sol1.cProblem 9 solution - A naive implementation - sol2.cProblem 9 solution - ▼ sorting - shell_sort2.cShell sort algorithm implementation + cantor_set.cProgram to generate Cantor ternary set + collatz.cImplementation of Collatz' conjecture + factorial_large_number.cCompute factorial of arbitrarily large numbers by storing individual digits in a byte + fibonacci_fast.cCompute \(m^{mth}\) Fibonacci number using the formulae: + ▼ numerical_methods + durand_kerner_roots.cCompute all possible approximate roots of any given polynomial using Durand Kerner algorithm + lu_decompose.cLU decomposition of a square matrix + newton_raphson_root.cFind approximate solution for \(f(x) = 0\) using Newton-Raphson interpolation algorithm + ode_forward_euler.cSolve a multivariable first order ordinary differential equation (ODEs) using forward Euler method + ode_midpoint_euler.cSolve a multivariable first order ordinary differential equation (ODEs) using midpoint Euler method + ode_semi_implicit_euler.cSolve a multivariable first order ordinary differential equation (ODEs) using semi implicit Euler method + qr_decompose.hLibrary functions to compute QR decomposition of a given matrix + qr_decomposition.cProgram to compute the QR decomposition of a given matrix + qr_eigen_values.cCompute real eigen values and eigen vectors of a symmetric matrix using QR decomposition method + realtime_stats.cCompute statistics for data entered in rreal-time + ▼ project_euler + ► problem_1 + sol1.cProblem 1 solution + sol2.cProblem 1 solution + sol3.cProblem 1 solution. This solution is based on the pattern that the successive numbers in the series follow: 0+3,+2,+1,+3,+1,+2,+3 + sol4.cProblem 1 solution + ► problem_10 + sol1.cProblem 10 solution + sol2.cProblem 10 solution + ► problem_12 + sol1.cProblem 12 solution + ► problem_13 + sol1.cProblem 13 solution + ► problem_14 + sol1.cProblem 14 solution + ► problem_15 + sol1.cProblem 15 solution + ► problem_16 + sol1.cProblem 16 solution + ► problem_19 + sol1.cProblem 19 solution + ► problem_2 + so1.cProblem 2 solution + ► problem_20 + sol1.cProblem 20 solution + ► problem_21 + sol1.cProblem 21 solution + ► problem_22 + sol1.cProblem 22 solution + ► problem_23 + sol1.cProblem 23 solution + sol2.cProblem 23 solution - optimization using look-up array + ► problem_25 + sol1.cProblem 25 solution implemented using arbitrarily large numbers represented as arrays + ► problem_26 + sol1.cProblem 26 solution + ► problem_3 + sol1.cProblem 3 solution + sol2.cProblem 3 solution + ► problem_4 + sol.cProblem 4 solution + ► problem_401 + sol1.cProblem 401 solution - Sum of squares of divisors + ► problem_5 + sol.cProblem 5 solution + ► problem_6 + sol.cProblem 6 solution + ► problem_7 + sol.cProblem 7 solution + ► problem_8 + sol1.cProblem 8 solution + sol2.cProblem 8 solution + ► problem_9 + sol1.cProblem 9 solution - A naive implementation + sol2.cProblem 9 solution + ▼ searching + binary_search.cProgram to perform binary search of a target value in a given sorted array + ▼ sorting + shell_sort2.cShell sort algorithm implementation diff --git a/files_dup.js b/files_dup.js index acad892d6..e721545a0 100644 --- a/files_dup.js +++ b/files_dup.js @@ -8,5 +8,6 @@ var files_dup = [ "misc", "dir_a52f4d3d586a58b02f3a4ddf0a992157.html", "dir_a52f4d3d586a58b02f3a4ddf0a992157" ], [ "numerical_methods", "dir_9c6faab82c22511b50177aa2e38e2780.html", "dir_9c6faab82c22511b50177aa2e38e2780" ], [ "project_euler", "dir_b3d331eabd4234f247030c297aaf021c.html", "dir_b3d331eabd4234f247030c297aaf021c" ], + [ "searching", "dir_da574daf9ce9c05b45556bdc871ed1e3.html", "dir_da574daf9ce9c05b45556bdc871ed1e3" ], [ "sorting", "dir_bb1b521853a9c46347182a9d10420771.html", "dir_bb1b521853a9c46347182a9d10420771" ] ]; \ No newline at end of file diff --git a/functions.html b/functions.html index 99568587b..c43e6850b 100644 --- a/functions.html +++ b/functions.html @@ -107,12 +107,18 @@ $(document).ready(function(){initNavTree('functions.html',''); initResizable();
  • dim3 : array_3d
  • +
  • end +: _cantor_set +
  • eta : adaline
  • llink : Node
  • +
  • next +: _cantor_set +
  • next_digit : _big_int
  • @@ -128,6 +134,9 @@ $(document).ready(function(){initNavTree('functions.html',''); initResizable();
  • rlink : Node
  • +
  • start +: _cantor_set +
  • value : _big_int
  • diff --git a/functions_vars.html b/functions_vars.html index a662f107d..ce8e34f34 100644 --- a/functions_vars.html +++ b/functions_vars.html @@ -107,12 +107,18 @@ $(document).ready(function(){initNavTree('functions_vars.html',''); initResizabl
  • dim3 : array_3d
  • +
  • end +: _cantor_set +
  • eta : adaline
  • llink : Node
  • +
  • next +: _cantor_set +
  • next_digit : _big_int
  • @@ -128,6 +134,9 @@ $(document).ready(function(){initNavTree('functions_vars.html',''); initResizabl
  • rlink : Node
  • +
  • start +: _cantor_set +
  • value : _big_int
  • diff --git a/globals_b.html b/globals_b.html index 7ee5f6a58..6b932e595 100644 --- a/globals_b.html +++ b/globals_b.html @@ -96,6 +96,12 @@ $(document).ready(function(){initNavTree('globals_b.html',''); initResizable();
  • big_int : sol1.c
  • +
  • binarysearch1() +: binary_search.c +
  • +
  • binarysearch2() +: binary_search.c +
  • diff --git a/globals_c.html b/globals_c.html index 0c9d60c97..8567c7c0e 100644 --- a/globals_c.html +++ b/globals_c.html @@ -96,6 +96,9 @@ $(document).ready(function(){initNavTree('globals_c.html',''); initResizable();
  • c_atoi() : c_atoi_str_to_integer.c
  • +
  • CantorSet +: cantor_set.c +
  • check_termination() : durand_kerner_roots.c
  • diff --git a/globals_f.html b/globals_f.html index 09f1a2b8c..7d1ae0933 100644 --- a/globals_f.html +++ b/globals_f.html @@ -108,6 +108,9 @@ $(document).ready(function(){initNavTree('globals_f.html',''); initResizable();
  • forward_euler_step() : ode_forward_euler.c
  • +
  • free_memory() +: cantor_set.c +
  • func() : newton_raphson_root.c
  • diff --git a/globals_func.html b/globals_func.html index f761f7cef..0df1937b7 100644 --- a/globals_func.html +++ b/globals_func.html @@ -114,6 +114,16 @@ $(document).ready(function(){initNavTree('globals_func.html',''); initResizable( +

    - b -

    + +

    - c -

    @@ -192,6 +202,9 @@ $(document).ready(function(){initNavTree('globals_func.html',''); initResizable(
  • forward_euler_step() : ode_forward_euler.c
  • +
  • free_memory() +: cantor_set.c +
  • func() : newton_raphson_root.c
  • @@ -229,8 +242,8 @@ $(document).ready(function(){initNavTree('globals_func.html',''); initResizable( : sol1.c
  • get_perfect_number() -: sol2.c -, sol1.c +: sol1.c +, sol2.c
  • get_product() : sol1.c @@ -249,8 +262,8 @@ $(document).ready(function(){initNavTree('globals_func.html',''); initResizable( : threaded_binary_trees.c
  • is_abundant() -: sol2.c -, sol1.c +: sol1.c +, sol2.c
  • is_in() : sol1.c @@ -265,8 +278,8 @@ $(document).ready(function(){initNavTree('globals_func.html',''); initResizable( : sol1.c
  • is_sum_of_abundant() -: sol2.c -, sol1.c +: sol1.c +, sol2.c
  • isprime() : sol1.c @@ -301,43 +314,44 @@ $(document).ready(function(){initNavTree('globals_func.html',''); initResizable(
  • main() : c_atoi_str_to_integer.c , threaded_binary_trees.c -, sol1.c , adaline_learning.c -, sol1.c -, shell_sort2.c -, sol2.c , kohonen_som_topology.c -, kohonen_som_trace.c -, sol2.c -, sol.c -, sol1.c -, sol.c -, sol1.c -, lu_decompose.c -, sol1.c -, sol2.c -, sol1.c -, sol2.c -, sol1.c -, so1.c -, sol1.c -, durand_kerner_roots.c -, sol1.c -, realtime_stats.c -, sol3.c -, sol2.c -, sol1.c -, sol4.c -, qr_decomposition.c -, ode_semi_implicit_euler.c -, ode_midpoint_euler.c -, ode_forward_euler.c -, newton_raphson_root.c -, sol1.c -, qr_eigen_values.c -, fibonacci_fast.c -, factorial_large_number.c +, sol1.c +, cantor_set.c , collatz.c +, factorial_large_number.c +, qr_decomposition.c +, realtime_stats.c +, lu_decompose.c +, newton_raphson_root.c +, ode_forward_euler.c +, ode_midpoint_euler.c +, ode_semi_implicit_euler.c +, sol1.c +, sol2.c +, sol1.c +, sol2.c +, sol3.c +, sol4.c +, fibonacci_fast.c +, sol2.c +, durand_kerner_roots.c +, sol1.c +, so1.c +, sol1.c +, sol2.c +, sol1.c +, sol2.c +, sol1.c +, qr_eigen_values.c +, kohonen_som_trace.c +, sol1.c +, sol.c +, sol1.c +, sol.c +, sol2.c +, binary_search.c +, shell_sort2.c
  • mat_mul() : qr_eigen_values.c @@ -380,16 +394,22 @@ $(document).ready(function(){initNavTree('globals_func.html',''); initResizable(
  • preorder_display() : threaded_binary_trees.c
  • +
  • print() +: cantor_set.c +
  • print_matrix() : qr_decompose.h
  • print_number() -: sol1.c +: sol1.c
  • problem() -: ode_semi_implicit_euler.c -, ode_forward_euler.c +: ode_forward_euler.c , ode_midpoint_euler.c +, ode_semi_implicit_euler.c +
  • +
  • propagate() +: cantor_set.c
  • @@ -428,8 +448,8 @@ $(document).ready(function(){initNavTree('globals_func.html',''); initResizable( : ode_semi_implicit_euler.c
  • shell_sort() -: shell_sort2.c -, sol1.c +: sol1.c +, shell_sort2.c
  • show_data() : shell_sort2.c @@ -459,17 +479,20 @@ $(document).ready(function(){initNavTree('globals_func.html',''); initResizable(

    - t -

    diff --git a/globals_t.html b/globals_t.html index f6ccb0c59..99315d194 100644 --- a/globals_t.html +++ b/globals_t.html @@ -93,17 +93,20 @@ $(document).ready(function(){initNavTree('globals_t.html',''); initResizable();
    Here is a list of all documented functions, variables, defines, enums, and typedefs with links to the documentation:

    - t -