From c7c5c5c67bcca35c8b1c8c5385a8a5eeeef6399c Mon Sep 17 00:00:00 2001 From: github-actions <${GITHUB_ACTOR}@users.noreply.github.com> Date: Thu, 16 Jul 2020 20:36:47 +0000 Subject: [PATCH] Documentation for 5d9bf078514f3b5dd913100f10fe56f050f005d7 --- d0/d46/kohonen__som__trace_8c.html | 69 ++++++----- d0/d6d/problem__10_2sol1_8c.html | 2 +- d0/dcb/group__kohonen__1d.html | 5 +- d1/d6b/group__kohonen__2d.html | 7 +- d2/df6/kohonen__som__topology_8c.html | 63 +++++----- d4/d68/qr__decompose_8h.html | 11 +- d4/d68/qr__decompose_8h_source.html | 11 +- d4/d83/problem__401_2sol1_8c.html | 149 ++++++++++++----------- d4/d83/problem__401_2sol1_8c.js | 4 +- d4/dbd/problem__23_2sol2_8c.html | 77 ++++++------ d4/dbd/problem__23_2sol2_8c.js | 3 +- d7/d50/qr__eigen__values_8c.html | 7 +- d7/d91/problem__15_2sol1_8c.html | 7 +- d7/d98/spirograph_8c.html | 7 +- d7/dd8/c__atoi__str__to__integer_8c.html | 32 +++-- d7/ddb/problem__23_2sol1_8c.html | 53 ++++---- d7/ddb/problem__23_2sol1_8c.js | 3 +- d8/d32/problem__25_2sol1_8c.html | 53 ++++---- da/d2a/group__adaline.html | 7 +- db/d01/problem__13_2sol1_8c.html | 121 +++++++++--------- db/d01/problem__13_2sol1_8c.js | 2 - db/d80/problem__20_2sol1_8c.html | 2 +- db/dfb/hash_8h_source.html | 1 - dc/d2e/lu__decompose_8c.html | 2 +- dd/d8c/adaline__learning_8c.html | 39 +++--- df/d1a/problem__21_2sol1_8c.html | 2 +- globals_defs.html | 26 ++-- globals_m.html | 25 ++-- globals_n.html | 6 - globals_vars.html | 4 - navtreedata.js | 4 +- navtreeindex0.js | 8 +- navtreeindex1.js | 20 +-- navtreeindex2.js | 8 +- search/all_10.js | 24 ++-- search/all_11.js | 12 +- search/all_12.js | 6 +- search/all_13.js | 66 +++++----- search/all_14.js | 36 +++--- search/all_15.js | 2 +- search/all_16.js | 10 +- search/all_17.js | 4 +- search/all_d.js | 33 +++-- search/all_e.js | 22 ++-- search/all_f.js | 16 +-- search/classes_0.js | 6 +- search/classes_1.js | 4 +- search/classes_10.js | 2 +- search/classes_2.js | 2 +- search/classes_3.js | 2 +- search/classes_4.js | 6 +- search/classes_5.js | 4 +- search/classes_6.js | 4 +- search/classes_7.js | 2 +- search/classes_8.js | 2 +- search/classes_9.js | 2 +- search/classes_a.js | 4 +- search/classes_b.js | 2 +- search/classes_c.js | 2 +- search/classes_d.js | 4 +- search/classes_e.js | 6 +- search/classes_f.js | 6 +- search/defines_0.js | 2 +- search/defines_1.js | 2 +- search/defines_2.js | 2 +- search/defines_3.js | 2 +- search/defines_4.js | 18 +-- search/defines_5.js | 3 +- search/files_0.js | 2 +- search/files_1.js | 4 +- search/files_10.js | 2 +- search/files_2.js | 8 +- search/files_3.js | 2 +- search/files_4.js | 4 +- search/files_5.js | 2 +- search/files_6.js | 4 +- search/files_7.js | 2 +- search/files_8.js | 4 +- search/files_9.js | 2 +- search/files_a.js | 6 +- search/files_b.js | 2 +- search/files_c.js | 6 +- search/files_d.js | 2 +- search/files_e.js | 18 +-- search/files_f.js | 2 +- search/functions_0.js | 2 +- search/functions_1.js | 14 +-- search/functions_10.js | 2 +- search/functions_11.js | 2 +- search/functions_12.js | 34 +++--- search/functions_13.js | 26 ++-- search/functions_14.js | 8 +- search/functions_2.js | 8 +- search/functions_3.js | 16 +-- search/functions_4.js | 10 +- search/functions_5.js | 4 +- search/functions_6.js | 12 +- search/functions_7.js | 24 ++-- search/functions_8.js | 20 +-- search/functions_9.js | 4 +- search/functions_a.js | 10 +- search/functions_b.js | 6 +- search/functions_c.js | 16 +-- search/functions_d.js | 6 +- search/functions_e.js | 8 +- search/functions_f.js | 16 +-- search/groups_0.js | 2 +- search/groups_1.js | 4 +- search/groups_2.js | 2 +- search/groups_3.js | 4 +- search/pages_0.js | 2 +- search/pages_1.js | 2 +- search/pages_2.js | 2 +- search/pages_3.js | 2 +- search/pages_4.js | 4 +- search/pages_5.js | 2 +- search/pages_6.js | 4 +- search/pages_7.js | 2 +- search/searchdata.js | 4 +- search/typedefs_0.js | 2 +- search/typedefs_1.js | 2 +- search/typedefs_2.js | 2 +- search/typedefs_3.js | 2 +- search/variables_0.js | 4 +- search/variables_1.js | 10 +- search/variables_2.js | 4 +- search/variables_3.js | 2 +- search/variables_4.js | 7 +- search/variables_5.js | 7 +- search/variables_6.js | 2 +- search/variables_7.js | 2 +- search/variables_8.js | 2 +- search/variables_9.js | 2 +- 133 files changed, 759 insertions(+), 807 deletions(-) diff --git a/d0/d46/kohonen__som__trace_8c.html b/d0/d46/kohonen__som__trace_8c.html index 9c025c9c..04db3398 100644 --- a/d0/d46/kohonen__som__trace_8c.html +++ b/d0/d46/kohonen__som__trace_8c.html @@ -134,7 +134,7 @@ Functions int save_nd_data (const char *fname, double **X, int num_points, int num_features)  Save a given n-dimensional data martix to file. More...
  -void kohonen_get_min_1d (double const *X, int N, double *val, int *idx) +void kohonen_get_min_1d (double const *X, int N, double *val, int *idx)  Get minimum value and index of the value in a vector. More...
  void kohonen_update_weights (double const *x, double *const *W, double *D, int num_out, int num_features, double alpha, int R) @@ -143,19 +143,19 @@ Functions void kohonen_som_tracer (double **X, double *const *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 datset. More...
  -void test_circle (double *const *data, int N) +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 finds that circular pattern. More...
  void test1 ()  Test that creates a random set of points distributed near the circumference of a circle and trains an SOM that finds that circular pattern. More...
  -void test_lamniscate (double *const *data, int N) +void test_lamniscate (double *const *data, int N)  Creates a random set of points distributed near the locus of the Lamniscate of Gerono. More...
  void test2 ()  Test that creates a random set of points distributed near the locus of the Lamniscate of Gerono and trains an SOM that finds that circular pattern. More...
  -void test_3d_classes (double *const *data, int N) +void test_3d_classes (double *const *data, int N)  Creates a random set of points distributed in four clusters in 3D space with centroids at the points. More...
  void test3 () @@ -243,19 +243,19 @@ int 

262 {
-
263  int j, N = 500;
+
263  int j, N = 500;
264  int features = 2;
265  int num_out = 50;
266 
267  // 2D space, hence size = number of rows * 2
-
268  double **X = (double **)malloc(N * sizeof(double *));
+
268  double **X = (double **)malloc(N * sizeof(double *));
269 
270  // number of clusters nodes * 2
271  double **W = (double **)malloc(num_out * sizeof(double *));
272 
-
273  for (int i = 0; i < max(num_out, N); i++) // loop till max(N, num_out)
+
273  for (int i = 0; i < max(num_out, N); i++) // loop till max(N, num_out)
274  {
-
275  if (i < N) // only add new arrays if i < N
+
275  if (i < N) // only add new arrays if i < N
276  X[i] = (double *)malloc(features * sizeof(double));
277  if (i < num_out) // only add new arrays if i < num_out
278  {
@@ -268,17 +268,17 @@ output" style="pointer-events: none;" class="inline"/>

285  }
286  }
287 
-
288  test_circle(X, N); // create test data around circumference of a circle
-
289  save_nd_data("test1.csv", X, N, features); // save test data points
+
288  test_circle(X, N); // create test data around circumference of a circle
+
289  save_nd_data("test1.csv", X, N, features); // save test data points
290  save_nd_data("w11.csv", W, num_out,
291  features); // save initial random weights
-
292  kohonen_som_tracer(X, W, N, features, num_out, 0.1); // train the SOM
+
292  kohonen_som_tracer(X, W, N, features, num_out, 0.1); // train the SOM
293  save_nd_data("w12.csv", W, num_out,
294  features); // save the resultant weights
295 
-
296  for (int i = 0; i < max(num_out, N); i++)
+
296  for (int i = 0; i < max(num_out, N); i++)
297  {
-
298  if (i < N)
+
298  if (i < N)
299  free(X[i]);
300  if (i < num_out)
301  free(W[i]);
@@ -321,14 +321,14 @@ Here is the call graph for this function:

Sample execution output

359 {
-
360  int j, N = 500;
+
360  int j, N = 500;
361  int features = 2;
362  int num_out = 20;
-
363  double **X = (double **)malloc(N * sizeof(double *));
+
363  double **X = (double **)malloc(N * sizeof(double *));
364  double **W = (double **)malloc(num_out * sizeof(double *));
-
365  for (int i = 0; i < max(num_out, N); i++)
+
365  for (int i = 0; i < max(num_out, N); i++)
366  {
-
367  if (i < N) // only add new arrays if i < N
+
367  if (i < N) // only add new arrays if i < N
368  X[i] = (double *)malloc(features * sizeof(double));
369  if (i < num_out) // only add new arrays if i < num_out
370  {
@@ -342,17 +342,17 @@ output" style="pointer-events: none;" class="inline"/>

378  }
379  }
380 
-
381  test_lamniscate(X, N); // create test data around the lamniscate
-
382  save_nd_data("test2.csv", X, N, features); // save test data points
+
381  test_lamniscate(X, N); // create test data around the lamniscate
+
382  save_nd_data("test2.csv", X, N, features); // save test data points
383  save_nd_data("w21.csv", W, num_out,
384  features); // save initial random weights
-
385  kohonen_som_tracer(X, W, N, features, num_out, 0.01); // train the SOM
+
385  kohonen_som_tracer(X, W, N, features, num_out, 0.01); // train the SOM
386  save_nd_data("w22.csv", W, num_out,
387  features); // save the resultant weights
388 
-
389  for (int i = 0; i < max(num_out, N); i++)
+
389  for (int i = 0; i < max(num_out, N); i++)
390  {
-
391  if (i < N)
+
391  if (i < N)
392  free(X[i]);
393  if (i < num_out)
394  free(W[i]);
@@ -397,14 +397,14 @@ Here is the call graph for this function:

Sample execution output

463 {
-
464  int j, N = 200;
+
464  int j, N = 200;
465  int features = 3;
466  int num_out = 20;
-
467  double **X = (double **)malloc(N * sizeof(double *));
+
467  double **X = (double **)malloc(N * sizeof(double *));
468  double **W = (double **)malloc(num_out * sizeof(double *));
-
469  for (int i = 0; i < max(num_out, N); i++)
+
469  for (int i = 0; i < max(num_out, N); i++)
470  {
-
471  if (i < N) // only add new arrays if i < N
+
471  if (i < N) // only add new arrays if i < N
472  X[i] = (double *)malloc(features * sizeof(double));
473  if (i < num_out) // only add new arrays if i < num_out
474  {
@@ -418,17 +418,17 @@ output" style="pointer-events: none;" class="inline"/>

482  }
483  }
484 
-
485  test_3d_classes(X, N); // create test data around the lamniscate
-
486  save_nd_data("test3.csv", X, N, features); // save test data points
+
485  test_3d_classes(X, N); // create test data around the lamniscate
+
486  save_nd_data("test3.csv", X, N, features); // save test data points
487  save_nd_data("w31.csv", W, num_out,
488  features); // save initial random weights
-
489  kohonen_som_tracer(X, W, N, features, num_out, 0.01); // train the SOM
+
489  kohonen_som_tracer(X, W, N, features, num_out, 0.01); // train the SOM
490  save_nd_data("w32.csv", W, num_out,
491  features); // save the resultant weights
492 
-
493  for (int i = 0; i < max(num_out, N); i++)
+
493  for (int i = 0; i < max(num_out, N); i++)
494  {
-
495  if (i < N)
+
495  if (i < N)
496  free(X[i]);
497  if (i < num_out)
498  free(W[i]);
@@ -500,7 +500,7 @@ Here is the call graph for this function:
423 #ifdef _OPENMP
424 #pragma omp for
425 #endif
-
426  for (i = 0; i < N; i++)
+
426  for (i = 0; i < N; i++)
427  {
428  int class =
429  rand() % num_classes; // select a random class for the point
@@ -571,7 +571,7 @@ Here is the call graph for this function:
230 #ifdef _OPENMP
231 #pragma omp for
232 #endif
-
233  for (i = 0; i < N; i++)
+
233  for (i = 0; i < N; i++)
234  {
235  double r = _random(a_r, b_r); // random radius
236  double theta = _random(a_t, b_t); // random theta
@@ -632,7 +632,7 @@ Here is the call graph for this function:
324 #ifdef _OPENMP
325 #pragma omp for
326 #endif
-
327  for (i = 0; i < N; i++)
+
327  for (i = 0; i < N; i++)
328  {
329  double dx = _random(-dr, dr); // random change in x
330  double dy = _random(-dr, dr); // random change in y
@@ -655,7 +655,6 @@ Here is the call graph for this function:
test_circle
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:223
data
Definition: prime_factoriziation.c:25
save_nd_data
int save_nd_data(const char *fname, double **X, int num_points, int num_features)
Save a given n-dimensional data martix to file.
Definition: kohonen_som_trace.c:70
-
N
#define N
number of digits of the large number
Definition: sol1.c:109
test_lamniscate
void test_lamniscate(double *const *data, int N)
Creates a random set of points distributed near the locus of the Lamniscate of Gerono.
Definition: kohonen_som_trace.c:319
kohonen_som_tracer
void kohonen_som_tracer(double **X, double *const *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_trace.c:179
max
#define max(a, b)
shorthand for maximum value
Definition: kohonen_som_trace.c:32
diff --git a/d0/d6d/problem__10_2sol1_8c.html b/d0/d6d/problem__10_2sol1_8c.html index 961778bd..c06f7174 100644 --- a/d0/d6d/problem__10_2sol1_8c.html +++ b/d0/d6d/problem__10_2sol1_8c.html @@ -116,7 +116,7 @@ char  Function to check if a number is prime.
  -unsigned long long sum_of_primes (unsigned long N) +unsigned long long sum_of_primes (unsigned long N)  Computes sum of prime numbers less than N.
  diff --git a/d0/dcb/group__kohonen__1d.html b/d0/dcb/group__kohonen__1d.html index 97cb411b..9aeb4ae6 100644 --- a/d0/dcb/group__kohonen__1d.html +++ b/d0/dcb/group__kohonen__1d.html @@ -123,7 +123,7 @@ Functions int save_nd_data (const char *fname, double **X, int num_points, int num_features)  Save a given n-dimensional data martix to file. More...
  -void kohonen_get_min_1d (double const *X, int N, double *val, int *idx) +void kohonen_get_min_1d (double const *X, int N, double *val, int *idx)  Get minimum value and index of the value in a vector. More...
  void kohonen_update_weights (double const *x, double *const *W, double *D, int num_out, int num_features, double alpha, int R) @@ -237,7 +237,7 @@ Functions
105 {
106  val[0] = INFINITY; // initial min value
107 
-
108  for (int i = 0; i < N; i++) // check each value
+
108  for (int i = 0; i < N; i++) // check each value
109  {
110  if (X[i] < val[0]) // if a lower value is found
111  { // save the value and its index
@@ -537,7 +537,6 @@ Here is the call graph for this function:
-
N
#define N
number of digits of the large number
Definition: sol1.c:109
kohonen_update_weights
void kohonen_update_weights(double const *x, double *const *W, double *D, int num_out, int num_features, double alpha, int R)
Update weights of the SOM using Kohonen algorithm.
Definition: kohonen_som_trace.c:129
min
#define min(a, b)
shorthand for minimum value
Definition: kohonen_som_trace.c:36
max
#define max(a, b)
shorthand for maximum value
Definition: kohonen_som_trace.c:32
diff --git a/d1/d6b/group__kohonen__2d.html b/d1/d6b/group__kohonen__2d.html index 85f2ca14..fe533a18 100644 --- a/d1/d6b/group__kohonen__2d.html +++ b/d1/d6b/group__kohonen__2d.html @@ -136,7 +136,7 @@ Functions int save_u_matrix (const char *fname, struct kohonen_array_3d *W)  Create the distance matrix or U-matrix from the trained weights and save to disk. More...
  -void get_min_2d (double **X, int N, double *val, int *x_idx, int *y_idx) +void get_min_2d (double **X, int N, double *val, int *x_idx, int *y_idx)  Get minimum value and index of the value in a matrix. More...
  double kohonen_update_weights (const double *X, struct kohonen_array_3d *W, double **D, int num_out, int num_features, double alpha, int R) @@ -256,9 +256,9 @@ Functions
205 {
206  val[0] = INFINITY; // initial min value
207 
-
208  for (int i = 0; i < N; i++) // traverse each x-index
+
208  for (int i = 0; i < N; i++) // traverse each x-index
209  {
-
210  for (int j = 0; j < N; j++) // traverse each y-index
+
210  for (int j = 0; j < N; j++) // traverse each y-index
211  {
212  if (X[i][j] < val[0]) // if a lower value is found
213  { // save the value and its index
@@ -764,7 +764,6 @@ Here is the call graph for this function:
kohonen_array_3d::data
double * data
pointer to data
Definition: kohonen_som_topology.c:52
kohonen_array_3d::dim2
int dim2
lengths of second dimension
Definition: kohonen_som_topology.c:50
kohonen_array_3d::dim3
int dim3
lengths of thirddimension
Definition: kohonen_som_topology.c:51
-
N
#define N
number of digits of the large number
Definition: sol1.c:109
get_min_2d
void get_min_2d(double **X, int N, double *val, int *x_idx, int *y_idx)
Get minimum value and index of the value in a matrix.
Definition: kohonen_som_topology.c:204
min
#define min(a, b)
shorthand for minimum value
Definition: kohonen_som_topology.c:43
max
#define max(a, b)
shorthand for maximum value
Definition: kohonen_som_topology.c:39
diff --git a/d2/df6/kohonen__som__topology_8c.html b/d2/df6/kohonen__som__topology_8c.html index 2c274efa..dc7c518d 100644 --- a/d2/df6/kohonen__som__topology_8c.html +++ b/d2/df6/kohonen__som__topology_8c.html @@ -147,7 +147,7 @@ Functions int save_u_matrix (const char *fname, struct kohonen_array_3d *W)  Create the distance matrix or U-matrix from the trained weights and save to disk. More...
  -void get_min_2d (double **X, int N, double *val, int *x_idx, int *y_idx) +void get_min_2d (double **X, int N, double *val, int *x_idx, int *y_idx)  Get minimum value and index of the value in a matrix. More...
  double kohonen_update_weights (const double *X, struct kohonen_array_3d *W, double **D, int num_out, int num_features, double alpha, int R) @@ -156,19 +156,19 @@ Functions void kohonen_som (double **X, struct kohonen_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 datset. More...
  -void test_2d_classes (double *const *data, int N) +void test_2d_classes (double *const *data, int N)  Creates a random set of points distributed in four clusters in 3D space with centroids at the points. More...
  void test1 ()  Test that creates a random set of points distributed in four clusters in 2D space and trains an SOM that finds the topological pattern. More...
  -void test_3d_classes1 (double *const *data, int N) +void test_3d_classes1 (double *const *data, int N)  Creates a random set of points distributed in four clusters in 3D space with centroids at the points. More...
  void test2 ()  Test that creates a random set of points distributed in 4 clusters in 3D space and trains an SOM that finds the topological pattern. More...
  -void test_3d_classes2 (double *const *data, int N) +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. More...
  void test3 () @@ -251,12 +251,12 @@ int 
407 {
-
408  int j, N = 300;
+
408  int j, N = 300;
409  int features = 2;
410  int num_out = 30; // image size - N x N
411 
412  // 2D space, hence size = number of rows * 2
-
413  double **X = (double **)malloc(N * sizeof(double *));
+
413  double **X = (double **)malloc(N * sizeof(double *));
414 
415  // cluster nodex in 'x' * cluster nodes in 'y' * 2
416  struct kohonen_array_3d W;
@@ -266,9 +266,9 @@ int  420  W.data = (double *)malloc(num_out * num_out * features *
421  sizeof(double)); // assign rows
422 
-
423  for (int i = 0; i < max(num_out, N); i++) // loop till max(N, num_out)
+
423  for (int i = 0; i < max(num_out, N); i++) // loop till max(N, num_out)
424  {
-
425  if (i < N) // only add new arrays if i < N
+
425  if (i < N) // only add new arrays if i < N
426  X[i] = (double *)malloc(features * sizeof(double));
427  if (i < num_out) // only add new arrays if i < num_out
428  {
@@ -287,13 +287,13 @@ int  441  }
442  }
443 
-
444  test_2d_classes(X, N); // create test data around circumference of a circle
-
445  save_2d_data("test1.csv", X, N, features); // save test data points
+
444  test_2d_classes(X, N); // create test data around circumference of a circle
+
445  save_2d_data("test1.csv", X, N, features); // save test data points
446  save_u_matrix("w11.csv", &W); // save initial random weights
-
447  kohonen_som(X, &W, N, features, num_out, 1e-4); // train the SOM
+
447  kohonen_som(X, &W, N, features, num_out, 1e-4); // train the SOM
448  save_u_matrix("w12.csv", &W); // save the resultant weights
449 
-
450  for (int i = 0; i < N; i++) free(X[i]);
+
450  for (int i = 0; i < N; i++) free(X[i]);
451  free(X);
452  free(W.data);
453 }
@@ -328,12 +328,12 @@ Here is the call graph for this function:
  • w22.csv: trained SOM U-matrix
    • 507 {
    -
    508  int j, N = 500;
    +
    508  int j, N = 500;
    509  int features = 3;
    510  int num_out = 30; // image size - N x N
    511 
    512  // 3D space, hence size = number of rows * 3
    -
    513  double **X = (double **)malloc(N * sizeof(double *));
    +
    513  double **X = (double **)malloc(N * sizeof(double *));
    514 
    515  // cluster nodex in 'x' * cluster nodes in 'y' * 2
    516  struct kohonen_array_3d W;
    @@ -343,9 +343,9 @@ Here is the call graph for this function:
    520  W.data = (double *)malloc(num_out * num_out * features *
    521  sizeof(double)); // assign rows
    522 
    -
    523  for (int i = 0; i < max(num_out, N); i++) // loop till max(N, num_out)
    +
    523  for (int i = 0; i < max(num_out, N); i++) // loop till max(N, num_out)
    524  {
    -
    525  if (i < N) // only add new arrays if i < N
    +
    525  if (i < N) // only add new arrays if i < N
    526  X[i] = (double *)malloc(features * sizeof(double));
    527  if (i < num_out) // only add new arrays if i < num_out
    528  {
    @@ -363,13 +363,13 @@ Here is the call graph for this function:
    540  }
    541  }
    542 
    -
    543  test_3d_classes1(X, N); // create test data
    -
    544  save_2d_data("test2.csv", X, N, features); // save test data points
    +
    543  test_3d_classes1(X, N); // create test data
    +
    544  save_2d_data("test2.csv", X, N, features); // save test data points
    545  save_u_matrix("w21.csv", &W); // save initial random weights
    -
    546  kohonen_som(X, &W, N, features, num_out, 1e-4); // train the SOM
    +
    546  kohonen_som(X, &W, N, features, num_out, 1e-4); // train the SOM
    547  save_u_matrix("w22.csv", &W); // save the resultant weights
    548 
    -
    549  for (int i = 0; i < N; i++) free(X[i]);
    +
    549  for (int i = 0; i < N; i++) free(X[i]);
    550  free(X);
    551  free(W.data);
    552 }
    @@ -404,10 +404,10 @@ Here is the call graph for this function:
  • w32.csv: trained SOM U-matrix
    • 610 {
    -
    611  int j, N = 500;
    +
    611  int j, N = 500;
    612  int features = 3;
    613  int num_out = 30;
    -
    614  double **X = (double **)malloc(N * sizeof(double *));
    +
    614  double **X = (double **)malloc(N * sizeof(double *));
    615 
    616  // cluster nodex in 'x' * cluster nodes in 'y' * 2
    617  struct kohonen_array_3d W;
    @@ -417,9 +417,9 @@ Here is the call graph for this function:
    621  W.data = (double *)malloc(num_out * num_out * features *
    622  sizeof(double)); // assign rows
    623 
    -
    624  for (int i = 0; i < max(num_out, N); i++) // loop till max(N, num_out)
    +
    624  for (int i = 0; i < max(num_out, N); i++) // loop till max(N, num_out)
    625  {
    -
    626  if (i < N) // only add new arrays if i < N
    +
    626  if (i < N) // only add new arrays if i < N
    627  X[i] = (double *)malloc(features * sizeof(double));
    628  if (i < num_out) // only add new arrays if i < num_out
    629  {
    @@ -438,13 +438,13 @@ Here is the call graph for this function:
    642  }
    643  }
    644 
    -
    645  test_3d_classes2(X, N); // create test data around the lamniscate
    -
    646  save_2d_data("test3.csv", X, N, features); // save test data points
    +
    645  test_3d_classes2(X, N); // create test data around the lamniscate
    +
    646  save_2d_data("test3.csv", X, N, features); // save test data points
    647  save_u_matrix("w31.csv", &W); // save initial random weights
    -
    648  kohonen_som(X, &W, N, features, num_out, 0.01); // train the SOM
    +
    648  kohonen_som(X, &W, N, features, num_out, 0.01); // train the SOM
    649  save_u_matrix("w32.csv", &W); // save the resultant weights
    650 
    -
    651  for (int i = 0; i < N; i++) free(X[i]);
    +
    651  for (int i = 0; i < N; i++) free(X[i]);
    652  free(X);
    653  free(W.data);
    654 }
    @@ -512,7 +512,7 @@ Here is the call graph for this function:
    379 #ifdef _OPENMP
    380 #pragma omp for
    381 #endif
    -
    382  for (i = 0; i < N; i++)
    +
    382  for (i = 0; i < N; i++)
    383  {
    384  int class =
    385  rand() % num_classes; // select a random class for the point
    @@ -591,7 +591,7 @@ Here is the call graph for this function:
    478 #ifdef _OPENMP
    479 #pragma omp for
    480 #endif
    -
    481  for (i = 0; i < N; i++)
    +
    481  for (i = 0; i < N; i++)
    482  {
    483  int class =
    484  rand() % num_classes; // select a random class for the point
    @@ -675,7 +675,7 @@ Here is the call graph for this function:
    581 #ifdef _OPENMP
    582 #pragma omp for
    583 #endif
    -
    584  for (i = 0; i < N; i++)
    +
    584  for (i = 0; i < N; i++)
    585  {
    586  int class =
    587  rand() % num_classes; // select a random class for the point
    @@ -707,7 +707,6 @@ Here is the call graph for this function:
    save_2d_data
    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:102
    _random
    double _random(double a, double b)
    Helper function to generate a random number in a given interval.
    Definition: kohonen_som_topology.c:87
    test_3d_classes2
    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:564
    -
    N
    #define N
    number of digits of the large number
    Definition: sol1.c:109
    kohonen_array_3d
    to store info regarding 3D arrays
    Definition: kohonen_som_topology.c:48
    kohonen_som
    void kohonen_som(double **X, struct kohonen_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:314
    max
    #define max(a, b)
    shorthand for maximum value
    Definition: kohonen_som_topology.c:39
    diff --git a/d4/d68/qr__decompose_8h.html b/d4/d68/qr__decompose_8h.html index 8379c8bb..c17df818 100644 --- a/d4/d68/qr__decompose_8h.html +++ b/d4/d68/qr__decompose_8h.html @@ -119,7 +119,7 @@ This graph shows which files directly or indirectly include this file: - + @@ -134,7 +134,7 @@ Functions - +

    Functions

    void print_matrix (double **A, int M, int N)
    void print_matrix (double **A, int M, int N)
     function to display matrix on stdout More...
     
    double vector_dot (double *a, double *b, int L)
    double * vector_sub (double *a, double *b, double *out, int L)
     Compute vector subtraction. More...
     
    void qr_decompose (double **A, double **Q, double **R, int M, int N)
    void qr_decompose (double **A, double **Q, double **R, int M, int N)
     Decompose matrix \(A\) using Gram-Schmidt process. More...
     
    @@ -186,7 +186,7 @@ Functions
    25 {
    26  for (int row = 0; row < M; row++)
    27  {
    -
    28  for (int col = 0; col < N; col++) printf("% 9.3g\t", A[row][col]);
    +
    28  for (int col = 0; col < N; col++) printf("% 9.3g\t", A[row][col]);
    29  putchar('\n');
    30  }
    31  putchar('\n');
    @@ -256,7 +256,7 @@ Functions
    149  double *col_vector = (double *)malloc(M * sizeof(double));
    150  double *col_vector2 = (double *)malloc(M * sizeof(double));
    151  double *tmp_vector = (double *)malloc(M * sizeof(double));
    -
    152  for (int i = 0; i < N;
    +
    152  for (int i = 0; i < N;
    153  i++) /* for each column => R is a square matrix of NxN */
    154  {
    155  int j;
    @@ -293,7 +293,7 @@ Functions
    186 
    187  /* compute upper triangular values of R */
    188  for (int kk = 0; kk < M; kk++) col_vector[kk] = Q[kk][i];
    -
    189  for (int k = i; k < N; k++)
    +
    189  for (int k = i; k < N; k++)
    190  {
    191  for (int kk = 0; kk < M; kk++) col_vector2[kk] = A[kk][k];
    192  R[i][k] = vector_dot(col_vector, col_vector2, M);
    @@ -541,7 +541,6 @@ Here is the call graph for this function:
    L
    Definition: list.h:8
    vector_mag
    double vector_mag(double *vector, int L)
    Compute magnitude of vector.
    Definition: qr_decompose.h:64
    vector_proj
    double * vector_proj(double *a, double *b, double *out, int L)
    Compute projection of vector on defined as.
    Definition: qr_decompose.h:76
    -
    N
    #define N
    number of digits of the large number
    Definition: sol1.c:109
    vector_dot
    double vector_dot(double *a, double *b, int L)
    Compute dot product of two vectors of equal lengths.
    Definition: qr_decompose.h:43
    vector_sub
    double * vector_sub(double *a, double *b, double *out, int L)
    Compute vector subtraction.
    Definition: qr_decompose.h:101
    diff --git a/d4/d68/qr__decompose_8h_source.html b/d4/d68/qr__decompose_8h_source.html index bf92bf88..3ea428d3 100644 --- a/d4/d68/qr__decompose_8h_source.html +++ b/d4/d68/qr__decompose_8h_source.html @@ -117,11 +117,11 @@ $(document).ready(function(){initNavTree('d4/d68/qr__decompose_8h_source.html','
    21  */
    22 void print_matrix(double **A, /**< matrix to print */
    23  int M, /**< number of rows of matrix */
    -
    24  int N) /**< number of columns of matrix */
    +
    24  int N) /**< number of columns of matrix */
    25 {
    26  for (int row = 0; row < M; row++)
    27  {
    -
    28  for (int col = 0; col < N; col++) printf("% 9.3g\t", A[row][col]);
    +
    28  for (int col = 0; col < N; col++) printf("% 9.3g\t", A[row][col]);
    29  putchar('\n');
    30  }
    31  putchar('\n');
    @@ -239,13 +239,13 @@ $(document).ready(function(){initNavTree('d4/d68/qr__decompose_8h_source.html','
    143  double **Q, /**< output decomposed matrix */
    144  double **R, /**< output decomposed matrix */
    145  int M, /**< number of rows of matrix A */
    -
    146  int N /**< number of columns of matrix A */
    +
    146  int N /**< number of columns of matrix A */
    147 )
    148 {
    149  double *col_vector = (double *)malloc(M * sizeof(double));
    150  double *col_vector2 = (double *)malloc(M * sizeof(double));
    151  double *tmp_vector = (double *)malloc(M * sizeof(double));
    -
    152  for (int i = 0; i < N;
    +
    152  for (int i = 0; i < N;
    153  i++) /* for each column => R is a square matrix of NxN */
    154  {
    155  int j;
    @@ -282,7 +282,7 @@ $(document).ready(function(){initNavTree('d4/d68/qr__decompose_8h_source.html','
    186 
    187  /* compute upper triangular values of R */
    188  for (int kk = 0; kk < M; kk++) col_vector[kk] = Q[kk][i];
    -
    189  for (int k = i; k < N; k++)
    +
    189  for (int k = i; k < N; k++)
    190  {
    191  for (int kk = 0; kk < M; kk++) col_vector2[kk] = A[kk][k];
    192  R[i][k] = vector_dot(col_vector, col_vector2, M);
    @@ -341,7 +341,6 @@ $(document).ready(function(){initNavTree('d4/d68/qr__decompose_8h_source.html','
    kohonen_array_3d::dim2
    int dim2
    lengths of second dimension
    Definition: kohonen_som_topology.c:50
    test_3d_classes2
    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:564
    kohonen_array_3d::dim3
    int dim3
    lengths of thirddimension
    Definition: kohonen_som_topology.c:51
    -
    N
    #define N
    number of digits of the large number
    Definition: sol1.c:109
    sudoku::N
    uint8_t N
    number of elements
    Definition: sudoku_solver.c:35
    qr_decompose
    void qr_decompose(double **A, double **Q, double **R, int M, int N)
    Decompose matrix using Gram-Schmidt process.
    Definition: qr_decompose.h:142
    complex_str
    const char * complex_str(long double complex x)
    create a textual form of complex number
    Definition: durand_kerner_roots.c:66
    diff --git a/d4/d83/problem__401_2sol1_8c.html b/d4/d83/problem__401_2sol1_8c.html index 756e6cea..dd3b418f 100644 --- a/d4/d83/problem__401_2sol1_8c.html +++ b/d4/d83/problem__401_2sol1_8c.html @@ -117,28 +117,28 @@ Macros #define __STDC_FORMAT_MACROS   - -#define MOD   (uint64_t)1e9 - modulo limit
    -  - -#define MAX_L   5000 - chunk size of array allocation
    -  + +#define MOD_LIMIT   (uint64_t)1e9 + modulo limit
    +  + +#define MAX_LENGTH   5000 + chunk size of array allocation
    +  - + - + - + +uint64_t 
    193  avg_pred_error = 0.f;
    194 
    195  // perform fit for each sample
    -
    196  for (int i = 0; i < N; i++)
    +
    196  for (int i = 0; i < N; i++)
    197  {
    198  double err = adaline_fit_sample(ada, X[i], y[i]);
    199  avg_pred_error += fabs(err);
    200  }
    -
    201  avg_pred_error /= N;
    +
    201  avg_pred_error /= N;
    202 
    203  // Print updates every 200th iteration
    204  // if (iter % 100 == 0)
    @@ -529,7 +529,6 @@ Here is the call graph for this function:
    adaline::weights
    double * weights
    weights of the neural network
    Definition: adaline_learning.c:46
    adaline_activation
    int adaline_activation(double x)
    Heaviside activation function
    Definition: adaline_learning.c:105
    -
    N
    #define N
    number of digits of the large number
    Definition: sol1.c:109
    ADALINE_ACCURACY
    #define ADALINE_ACCURACY
    convergence accuracy
    Definition: adaline_learning.c:51
    adaline_fit_sample
    double adaline_fit_sample(struct adaline *ada, const double *x, const int y)
    Update the weights of the model using supervised learning for one feature vector.
    Definition: adaline_learning.c:158
    adaline::eta
    double eta
    learning rate of the algorithm
    Definition: adaline_learning.c:45
    diff --git a/db/d01/problem__13_2sol1_8c.html b/db/d01/problem__13_2sol1_8c.html index e2d4b50f..ebd34ffa 100644 --- a/db/d01/problem__13_2sol1_8c.html +++ b/db/d01/problem__13_2sol1_8c.html @@ -91,7 +91,6 @@ $(document).ready(function(){initNavTree('db/d01/problem__13_2sol1_8c.html','../
    -Macros | Functions
    sol1.c File Reference
    @@ -111,27 +110,16 @@ Include dependency graph for sol1.c:

    Functions

    char is_in (uint64_t N, uint64_t *D, uint64_t L)
    char is_in (uint64_t N, uint64_t *D, uint64_t L)
     Check if a number is present in given array. More...
     
    uint64_t get_divisors (uint64_t N, uint64_t *D)
    uint64_t get_divisors (uint64_t N, uint64_t *D)
     Get all integer divisors of a number. More...
     
    uint64_t sigma2 (uint64_t N)
    uint64_t sigma2 (uint64_t N)
     compute sum of squares of all integer factors of a number More...
     
    -uint64_t sigma (uint64_t N)
    sigma (uint64_t N)
     sum of squares of factors of numbers from 1 thru N
     
    @@ -185,43 +185,45 @@ int 
    Returns
    number of divisors found
    -
    44 {
    -
    45  uint64_t q, r;
    -
    46  int64_t i, num = 0;
    -
    47 
    -
    48  if (N == 1)
    -
    49  {
    -
    50  D[0] = 1;
    -
    51  return 1;
    -
    52  }
    -
    53 
    -
    54  // search till sqrt(N)
    -
    55  // because after this, the pair of divisors will repeat themselves
    -
    56  for (i = 1; i * i <= N + 1; i++)
    -
    57  {
    -
    58  r = N % i; // get reminder
    -
    59 
    -
    60  // reminder = 0 if 'i' is a divisor of 'N'
    -
    61  if (r == 0)
    -
    62  {
    -
    63  q = N / i;
    -
    64  if (!is_in(i, D, num)) // if divisor was already stored
    -
    65  {
    -
    66  D[num] = i;
    -
    67  num++;
    -
    68  }
    -
    69  if (!is_in(q, D, num)) // if divisor was already stored
    -
    70  {
    -
    71  D[num] = q;
    -
    72  num++;
    -
    73  }
    -
    74  }
    -
    75 
    -
    76  if (num == MAX_L) // limit of array reached, allocate more space
    -
    77  D = (uint64_t *)realloc(D, MAX_L * sizeof(uint64_t) << 1);
    -
    78  }
    -
    79  return num;
    -
    80 }
    +
    48 {
    +
    49  uint64_t q, r;
    +
    50  int64_t i, num = 0;
    +
    51 
    +
    52  if (N == 1)
    +
    53  {
    +
    54  D[0] = 1;
    +
    55  return 1;
    +
    56  }
    +
    57 
    +
    58  // search till sqrt(N)
    +
    59  // because after this, the pair of divisors will repeat themselves
    +
    60  for (i = 1; i * i <= N + 1; i++)
    +
    61  {
    +
    62  r = N % i; // get reminder
    +
    63 
    +
    64  // reminder = 0 if 'i' is a divisor of 'N'
    +
    65  if (r == 0)
    +
    66  {
    +
    67  q = N / i;
    +
    68  if (!is_in(i, D, num)) // if divisor was already stored
    +
    69  {
    +
    70  D[num] = i;
    +
    71  num++;
    +
    72  }
    +
    73  if (!is_in(q, D, num)) // if divisor was already stored
    +
    74  {
    +
    75  D[num] = q;
    +
    76  num++;
    +
    77  }
    +
    78  }
    +
    79 
    +
    80  if (num == MAX_LENGTH)
    +
    81  { // limit of array reached, allocate more space
    +
    82  D = (uint64_t *)realloc(D, MAX_LENGTH * sizeof(uint64_t) << 1);
    +
    83  }
    +
    84  }
    +
    85  return num;
    +
    86 }
    Here is the call graph for this function:
    @@ -278,10 +280,14 @@ Here is the call graph for this function:
    29 {
    30  uint64_t i;
    31  for (i = 0; i < L; i++)
    -
    32  if (D[i] == N)
    -
    33  return 1;
    -
    34  return 0;
    -
    35 }
    +
    32  {
    +
    33  if (D[i] == N)
    +
    34  {
    +
    35  return 1;
    +
    36  }
    +
    37  }
    +
    38  return 0;
    +
    39 }
    @@ -309,21 +315,21 @@ Here is the call graph for this function:
    Returns
    sum of squares
    -
    88 {
    -
    89  uint64_t sum = 0, L;
    -
    90  int64_t i;
    -
    91  uint64_t *D = (uint64_t *)malloc(MAX_L * sizeof(uint64_t));
    -
    92 
    -
    93  L = get_divisors(N, D);
    -
    94  for (i = 1; i < L; i++)
    -
    95  {
    -
    96  uint64_t DD = (D[i] * D[i]) % MOD;
    -
    97  sum += DD;
    -
    98  }
    -
    99 
    -
    100  free(D);
    -
    101  return sum % MOD;
    -
    102 }
    +
    94 {
    +
    95  uint64_t sum = 0, L;
    +
    96  int64_t i;
    +
    97  uint64_t *D = (uint64_t *)malloc(MAX_LENGTH * sizeof(uint64_t));
    +
    98 
    +
    99  L = get_divisors(N, D);
    +
    100  for (i = 1; i < L; i++)
    +
    101  {
    +
    102  uint64_t DD = (D[i] * D[i]) % MOD_LIMIT;
    +
    103  sum += DD;
    +
    104  }
    +
    105 
    +
    106  free(D);
    +
    107  return sum % MOD_LIMIT;
    +
    108 }
    Here is the call graph for this function:
    @@ -336,11 +342,10 @@ Here is the call graph for this function:
    L
    Definition: list.h:8
    -
    MOD
    #define MOD
    modulo limit
    Definition: sol1.c:17
    -
    get_divisors
    uint64_t get_divisors(uint64_t N, uint64_t *D)
    Get all integer divisors of a number.
    Definition: sol1.c:43
    -
    MAX_L
    #define MAX_L
    chunk size of array allocation
    Definition: sol1.c:18
    -
    N
    #define N
    number of digits of the large number
    Definition: sol1.c:109
    +
    get_divisors
    uint64_t get_divisors(uint64_t N, uint64_t *D)
    Get all integer divisors of a number.
    Definition: sol1.c:47
    +
    MOD_LIMIT
    #define MOD_LIMIT
    modulo limit
    Definition: sol1.c:17
    is_in
    char is_in(uint64_t N, uint64_t *D, uint64_t L)
    Check if a number is present in given array.
    Definition: sol1.c:28
    +
    MAX_LENGTH
    #define MAX_LENGTH
    chunk size of array allocation
    Definition: sol1.c:18
    - + +char  +unsigned long  - + - - - @@ -165,24 +161,26 @@ long 

    Functions

    char get_perfect_number (unsigned long N)
    char get_perfect_number (unsigned long N)
     
    -char is_abundant (unsigned long N)
    is_abundant (unsigned long N)
     Is the given number an abundant number (1) or not (0)
     
    -unsigned long get_next_abundant (unsigned long N)
    get_next_abundant (unsigned long N)
     Find the next abundant number after N and not including N.
     
    char is_sum_of_abundant (unsigned long N)
    char is_sum_of_abundant (unsigned long N)
     check if a given number can be represented as a sum of two abundant numbers. More...
     
    @@ -132,10 +132,6 @@ int 

    Variables

    -long MAX_N = 28123
     Limit of numbers to check.
     
    char * abundant_flags = NULL
     This is the global array to be used to store a flag to identify if a particular number is abundant (1) or not (0). More...
     
    34 {
    -
    35  unsigned long sum = 1;
    -
    36  char ret = 0;
    -
    37 
    -
    38  for (unsigned long i = 2; i * i <= N; i++)
    -
    39  {
    -
    40  if (N % i == 0)
    -
    41  {
    -
    42  sum += i;
    -
    43  unsigned long tmp = N / i;
    -
    44  if (tmp != i)
    -
    45  sum += tmp;
    +
    32 {
    +
    33  unsigned long sum = 1;
    +
    34  char ret = 0;
    +
    35 
    +
    36  for (unsigned long i = 2; i * i <= N; i++)
    +
    37  {
    +
    38  if (N % i == 0)
    +
    39  {
    +
    40  sum += i;
    +
    41  unsigned long tmp = N / i;
    +
    42  if (tmp != i)
    +
    43  {
    +
    44  sum += tmp;
    +
    45  }
    46  }
    47  }
    48 
    -
    49  ret = sum == N ? 0 : (sum > N ? 1 : -1);
    +
    49  ret = sum == N ? 0 : (sum > N ? 1 : -1);
    50 #ifdef DEBUG
    -
    51  printf("%5lu: %5lu : %d\n", N, sum, ret);
    +
    51  printf("%5lu: %5lu : %d\n", N, sum, ret);
    52 #endif
    53  return ret;
    54 }
    @@ -209,22 +207,24 @@ long 
    Returns
    1 - if yes
    0 - if not
    -
    86 {
    -
    87  /* optimized logic:
    -
    88  * i + j = N where both i and j should be abundant
    -
    89  * hence we can simply check for j = N - i as we loop through i
    -
    90  */
    -
    91  for (unsigned long i = get_next_abundant(1); i <= (N >> 1);
    -
    92  i = get_next_abundant(i))
    -
    93  if (is_abundant(N - i))
    -
    94  {
    -
    95 #ifdef DEBUG
    -
    96  printf("\t%4lu + %4lu = %4lu\n", i, N - i, N);
    -
    97 #endif
    -
    98  return 1;
    -
    99  }
    -
    100  return 0;
    -
    101 }
    +
    88 {
    +
    89  /* optimized logic:
    +
    90  * i + j = N where both i and j should be abundant
    +
    91  * hence we can simply check for j = N - i as we loop through i
    +
    92  */
    +
    93  for (unsigned long i = get_next_abundant(1); i <= (N >> 1);
    +
    94  i = get_next_abundant(i))
    +
    95  {
    +
    96  if (is_abundant(N - i))
    +
    97  {
    +
    98 #ifdef DEBUG
    +
    99  printf("\t%4lu + %4lu = %4lu\n", i, N - i, N);
    +
    100 #endif
    +
    101  return 1;
    +
    102  }
    +
    103  }
    +
    104  return 0;
    +
    105 }
    Here is the call graph for this function:
    @@ -254,7 +254,6 @@ Here is the call graph for this function:
    -
    N
    #define N
    number of digits of the large number
    Definition: sol1.c:109
    get_next_abundant
    unsigned long get_next_abundant(unsigned long N)
    Find the next abundant number after N and not including N.
    Definition: sol2.c:70
    is_abundant
    char is_abundant(unsigned long N)
    Is the given number an abundant number (1) or not (0)
    Definition: sol2.c:59
    diff --git a/d4/dbd/problem__23_2sol2_8c.js b/d4/dbd/problem__23_2sol2_8c.js index 8537ab86..f6f5abcf 100644 --- a/d4/dbd/problem__23_2sol2_8c.js +++ b/d4/dbd/problem__23_2sol2_8c.js @@ -5,6 +5,5 @@ var problem__23_2sol2_8c = [ "is_abundant", "d4/dbd/problem__23_2sol2_8c.html#a34f4ad85151e3a43368ae67f42347f56", null ], [ "is_sum_of_abundant", "d4/dbd/problem__23_2sol2_8c.html#a3ab61b5a1c4f2288625d160aa0ea8478", null ], [ "main", "d4/dbd/problem__23_2sol2_8c.html#a3c04138a5bfe5d72780bb7e82a18e627", null ], - [ "abundant_flags", "d4/dbd/problem__23_2sol2_8c.html#af920a16d6ef69dd604b283f427892e06", null ], - [ "MAX_N", "d4/dbd/problem__23_2sol2_8c.html#a8c7ddb39906f281b801f2cd58d416c2b", null ] + [ "abundant_flags", "d4/dbd/problem__23_2sol2_8c.html#af920a16d6ef69dd604b283f427892e06", null ] ]; \ No newline at end of file diff --git a/d7/d50/qr__eigen__values_8c.html b/d7/d50/qr__eigen__values_8c.html index 2c27bfed..57a0a8f1 100644 --- a/d7/d50/qr__eigen__values_8c.html +++ b/d7/d50/qr__eigen__values_8c.html @@ -126,7 +126,7 @@ Macros
    - + @@ -190,10 +190,10 @@ int 

    Functions

    void create_matrix (double **A, int N)
    void create_matrix (double **A, int N)
     create a square matrix of given size with random elements More...
     
    double ** mat_mul (double **A, double **B, double **OUT, int R1, int C1, int R2, int C2)
    31 #ifdef _OPENMP
    32 #pragma omp for
    33 #endif
    -
    34  for (i = 0; i < N; i++)
    +
    34  for (i = 0; i < N; i++)
    35  {
    36  A[i][i] = (rand() % LIMS) - lim2;
    -
    37  for (j = i + 1; j < N; j++)
    +
    37  for (j = i + 1; j < N; j++)
    38  {
    39  tmp = (rand() % LIMS) - lim2;
    40  A[i][j] = tmp;
    @@ -620,7 +620,6 @@ Here is the call graph for this function:
    EPSILON
    #define EPSILON
    accuracy tolerance limit
    Definition: qr_eigen_values.c:20
    -
    N
    #define N
    number of digits of the large number
    Definition: sol1.c:109
    qr_decompose
    void qr_decompose(double **A, double **Q, double **R, int M, int N)
    Decompose matrix using Gram-Schmidt process.
    Definition: qr_decompose.h:142
    print_matrix
    void print_matrix(double **A, int M, int N)
    function to display matrix on stdout
    Definition: qr_decompose.h:22
    mat_mul
    double ** mat_mul(double **A, double **B, double **OUT, int R1, int C1, int R2, int C2)
    Perform multiplication of two matrices.
    Definition: qr_eigen_values.c:59
    diff --git a/d7/d91/problem__15_2sol1_8c.html b/d7/d91/problem__15_2sol1_8c.html index d5ef6edd..b3547bec 100644 --- a/d7/d91/problem__15_2sol1_8c.html +++ b/d7/d91/problem__15_2sol1_8c.html @@ -111,7 +111,7 @@ Include dependency graph for sol1.c: - +

    Functions

    unsigned long long number_of_paths (int N)
    unsigned long long number_of_paths (int N)
     At every node, there are 2 possible ways to move -> down or right. More...
     
    @@ -143,9 +143,9 @@ int 
    18 {
    19  unsigned long long path = 1;
    -
    20  for (int i = 0; i < N; i++)
    +
    20  for (int i = 0; i < N; i++)
    21  {
    -
    22  path *= (N << 1) - i;
    +
    22  path *= (N << 1) - i;
    23  path /= i + 1;
    24  }
    25 
    @@ -156,7 +156,6 @@ int 
    N
    #define N
    number of digits of the large number
    Definition: sol1.c:109
    - + +char  +unsigned long  +unsigned long  - + -

    Functions

    void spirograph (double *x, double *y, double l, double k, size_t N, double rot)
    void spirograph (double *x, double *y, double l, double k, size_t N, double rot)
     Generate spirograph curve into arrays x and y such that the i^th point in 2D is represented by (x[i],y[i]). More...
     
    @@ -215,11 +215,11 @@ int 
    58 {
    -
    59  double dt = rot * 2.f * M_PI / N;
    +
    59  double dt = rot * 2.f * M_PI / N;
    60  double t = 0.f, R = 1.f;
    61  const double k1 = 1.f - k;
    62 
    -
    63  for (size_t dk = 0; dk < N; dk++, t += dt)
    +
    63  for (size_t dk = 0; dk < N; dk++, t += dt)
    64  {
    65  x[dk] = R * (k1 * cos(t) + l * k * cos(k1 * t / k));
    66  y[dk] = R * (k1 * sin(t) - l * k * sin(k1 * t / k));
    @@ -230,7 +230,6 @@ int 
    N
    #define N
    number of digits of the large number
    Definition: sol1.c:109
    main
    int main()
    Main function.
    Definition: jump_search.c:81
    main
    int main(void)
    Main function.
    Definition: merge_sort.c:101
    is_palindromic
    int is_palindromic(unsigned int n)
    Check if number is palindromic.
    Definition: sol.c:12
    -
    MOD
    #define MOD
    modulo limit
    Definition: sol1.c:17
    -
    sigma2
    uint64_t sigma2(uint64_t N)
    compute sum of squares of all integer factors of a number
    Definition: sol1.c:87
    -
    get_divisors
    uint64_t get_divisors(uint64_t N, uint64_t *D)
    Get all integer divisors of a number.
    Definition: sol1.c:43
    +
    sigma2
    uint64_t sigma2(uint64_t N)
    compute sum of squares of all integer factors of a number
    Definition: sol1.c:93
    +
    sudoku::N2
    uint8_t N2
    block of elements
    Definition: sudoku_solver.c:36
    +
    get_divisors
    uint64_t get_divisors(uint64_t N, uint64_t *D)
    Get all integer divisors of a number.
    Definition: sol1.c:47
    EPSILON
    #define EPSILON
    accuracy tolerance limit
    Definition: qr_eigen_values.c:20
    compare
    int compare(const void *a, const void *b)
    comparison function for use with internal qsort algorithm
    Definition: sol1.c:19
    jump_search
    int jump_search(const int *arr, int x, size_t n)
    Implement Jump-search algorithm.
    Definition: jump_search.c:24
    shell_sort
    void shell_sort(char data[][MAX_NAME_LEN], int LEN)
    Alphabetical sorting using 'shell sort' algorithm.
    Definition: sol1.c:20
    get_product
    long long int get_product(FILE *fp, long start_pos, int num_digits)
    Compute the product of two numbers in a file.
    Definition: sol1.c:16
    main
    int main(int argc, char **argv)
    main function
    Definition: qr_eigen_values.c:315
    -
    MAX_L
    #define MAX_L
    chunk size of array allocation
    Definition: sol1.c:18
    data
    Definition: prime_factoriziation.c:25
    modifiedBinarySearch
    void modifiedBinarySearch(const int **mat, int n, int m, int x)
    Function to perform binary search on the mid values of row to get the desired pair of rows where the ...
    Definition: modified_binary_search.c:48
    test
    void test()
    Test implementation of the function.
    Definition: jump_search.c:58
    -
    get_perfect_number
    char get_perfect_number(unsigned long N)
    Definition: sol2.c:33
    +
    get_perfect_number
    char get_perfect_number(unsigned long N)
    Definition: sol2.c:31
    lazy_sort
    void lazy_sort(char data[][MAX_NAME_LEN], int LEN)
    Alphabetical sorting using 'lazy sort' algorithm.
    Definition: sol1.c:48
    main
    int main()
    Main function.
    Definition: so1.c:17
    main
    int main(void)
    Main function.
    Definition: sol.c:25
    -
    N2
    #define N2
    number of digits in output number
    Definition: sol1.c:111
    node
    Kyler Smith, 2017 Stack data structure implementation.
    Definition: binary_search_tree.c:14
    MAX_NAME_LEN
    #define MAX_NAME_LEN
    Maximum length of each name.
    Definition: sol1.c:15
    min
    #define min(X, Y)
    Macro to return the minimum of two values.
    Definition: jump_search.c:13
    bead_sort
    void bead_sort(int *a, size_t len)
    This is where the sorting of the array takes place.
    Definition: bead_sort.c:37
    stats_computer1
    void stats_computer1(float x, float *mean, float *variance, float *std)
    continuous mean and variance computance using first value as an approximation for the mean.
    Definition: realtime_stats.c:24
    +
    MOD_LIMIT
    #define MOD_LIMIT
    modulo limit
    Definition: sol1.c:17
    test2
    void test2()
    test function to compute eigen values of a 2x2 matrix
    Definition: qr_eigen_values.c:271
    remove_digits
    char remove_digits(big_int *digit, int N)
    Function to remove digits preceeding the current digit.
    Definition: sol1.c:76
    -
    N
    #define N
    number of digits of the large number
    Definition: sol1.c:109
    +
    sudoku::N
    uint8_t N
    number of elements
    Definition: sudoku_solver.c:35
    _big_int::value
    char value
    tens place (single digit)
    Definition: sol1.c:19
    qr_decompose
    void qr_decompose(double **A, double **Q, double **R, int M, int N)
    Decompose matrix using Gram-Schmidt process.
    Definition: qr_decompose.h:142
    -
    add_numbers
    int add_numbers(uint8_t *a, uint8_t *b, uint8_t N)
    Function to add arbitraty length decimal integers stored in an array.
    Definition: sol1.c:44
    +
    add_numbers
    int add_numbers(uint8_t *a, uint8_t *b, uint8_t N)
    Function to add arbitrary length decimal integers stored in an array.
    Definition: sol1.c:48
    get_month_days
    char get_month_days(short month)
    Function to get the number of days in a month.
    Definition: sol1.c:15
    MAX_NAMES
    #define MAX_NAMES
    Maximum number of names to store.
    Definition: sol1.c:14
    is_in
    char is_in(uint64_t N, uint64_t *D, uint64_t L)
    Check if a number is present in given array.
    Definition: sol1.c:28
    @@ -289,23 +288,23 @@ Here is the call graph for this function:
    lcm
    unsigned long lcm(unsigned long a, unsigned long b)
    Compute Least Common Multiple (LCM) of two numbers.
    Definition: sol.c:31
    qr_decompose.h
    Library functions to compute QR decomposition of a given matrix.
    _big_int::next_digit
    struct _big_int * next_digit
    hundreds place
    Definition: sol1.c:20
    -
    get_digits
    unsigned int get_digits(unsigned char *number)
    Get number of digits in a large number.
    Definition: sol1.c:71
    +
    get_digits
    unsigned int get_digits(unsigned char *number)
    Get number of digits in a large number.
    Definition: sol1.c:75
    is_abundant
    unsigned long is_abundant(unsigned long N)
    Is the given number an abundant number (1) or not (0)
    Definition: sol1.c:47
    print_matrix
    void print_matrix(double **A, int M, int N)
    function to display matrix on stdout
    Definition: qr_decompose.h:22
    -
    print_number
    int print_number(uint8_t *number, uint8_t N, int8_t num_digits_to_print)
    Function to print a long number.
    Definition: sol1.c:82
    +
    print_number
    int print_number(uint8_t *number, uint8_t N, int8_t num_digits_to_print)
    Function to print a long number.
    Definition: sol1.c:92
    main
    int main()
    Main function.
    Definition: sol3.c:14
    sum_of_divisors
    unsigned long sum_of_divisors(unsigned int N)
    function to return the sum of proper divisors of N
    Definition: sol1.c:13
    binarySearch
    int binarySearch(const int **mat, int i, int j_low, int j_high, int x)
    This function does Binary search for x in i-th row from j_low to j_high.
    Definition: modified_binary_search.c:18
    -
    sigma
    uint64_t sigma(uint64_t N)
    sum of squares of factors of numbers from 1 thru N
    Definition: sol1.c:108
    +
    sigma
    uint64_t sigma(uint64_t N)
    sum of squares of factors of numbers from 1 thru N
    Definition: sol1.c:114
    isprime
    char isprime(int no)
    Check if the given number is prime.
    Definition: sol1.c:15
    big_int
    struct _big_int big_int
    store arbitratily large integer values as a linked list of digits.
    main
    int main(void)
    main function
    Definition: qr_decomposition.c:18
    +
    MAX_LENGTH
    #define MAX_LENGTH
    chunk size of array allocation
    Definition: sol1.c:18
    main
    int main(int argc, char **argv)
    Main function.
    Definition: realtime_stats.c:128
    mat_mul
    double ** mat_mul(double **A, double **B, double **OUT, int R1, int C1, int R2, int C2)
    Perform multiplication of two matrices.
    Definition: qr_eigen_values.c:59
    MAX_LEN
    #define MAX_LEN
    length of resulting recurring fraction number
    Definition: sol1.c:15
    node
    struct Node node
    Node, the basic data structure of the tree.
    display
    void display(const int *arr, int n)
    Displays the array, passed to this method.
    Definition: bead_sort.c:23
    -
    MAX_N
    unsigned long MAX_N
    upper limit of numbers to check
    Definition: sol1.c:13
    gcd
    unsigned long gcd(unsigned long a, unsigned long b)
    Compute Greatest Common Divisor (GCD) of two numbers using Euclids algorithm.
    Definition: sol.c:11
    main
    int main(void)
    Main function.
    Definition: binary_search.c:105
    min
    #define min(a, b)
    shorthand for minimum value
    Definition: kohonen_som_topology.c:43
    @@ -320,7 +319,7 @@ Here is the call graph for this function:
    is_abundant
    char is_abundant(unsigned long N)
    Is the given number an abundant number (1) or not (0)
    Definition: sol2.c:59
    display
    void display(double **A, int N)
    Function to display square matrix.
    Definition: lu_decompose.c:66
    number_of_paths
    unsigned long long number_of_paths(int N)
    At every node, there are 2 possible ways to move -> down or right.
    Definition: sol1.c:17
    -
    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: sol2.c:85
    +
    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: sol2.c:87
    get_number
    int get_number(FILE *fp, char *buffer, uint8_t *out_int)
    Function to read the number from a file and store it in array.
    Definition: sol1.c:16
    show_data
    void show_data(int *arr, long len)
    Helper function to print array values.
    Definition: shell_sort2.c:16
    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
    @@ -329,7 +328,6 @@ Here is the call graph for this function:
    main
    int main(int argc, const char *argv[])
    Main function.
    Definition: bead_sort.c:75
    main
    int main(int argc, char *argv[])
    Main function.
    Definition: shell_sort2.c:66
    test
    void test()
    Test implementations.
    Definition: binary_search.c:75
    -
    MAX_N
    long MAX_N
    Limit of numbers to check.
    Definition: sol2.c:17
    main
    int main()
    Main function.
    Definition: sol4.c:12
    main
    int main()
    Main function.
    Definition: modified_binary_search.c:97
    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
    @@ -341,12 +339,12 @@ Here is the call graph for this function:
    test_c_atoi
    void test_c_atoi()
    test the function implementation
    Definition: c_atoi_str_to_integer.c:56
    shell_sort
    void shell_sort(int *array, long LEN)
    Shell sort algorithm.
    Definition: shell_sort2.c:41
    is_leap_year
    char is_leap_year(short year)
    Check if input year is a leap year.
    Definition: sol1.c:41
    -
    get_perfect_number
    char get_perfect_number(unsigned long N)
    Returns: -1 if N is deficient 1 if N is abundant 0 if N is perfect.
    Definition: sol1.c:21
    +
    get_perfect_number
    char get_perfect_number(unsigned long N)
    Returns: -1 if N is deficient 1 if N is abundant 0 if N is perfect.
    Definition: sol1.c:19
    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
    +
    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:71
    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
    +
    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:24
    binarysearch1
    int binarysearch1(const int *arr, int l, int r, int x)
    Recursive implementation.
    Definition: binary_search.c:21
    @@ -113,31 +112,24 @@ Include dependency graph for sol1.c:

    Functions

    -char get_perfect_number (unsigned long N)
    get_perfect_number (unsigned long N)
     Returns: -1 if N is deficient 1 if N is abundant 0 if N is perfect.
     
    -unsigned long is_abundant (unsigned long N)
    is_abundant (unsigned long N)
     Is the given number an abundant number (1) or not (0)
     
    -unsigned long get_next_abundant (unsigned long N)
    get_next_abundant (unsigned long N)
     Find the next abundant number after N and not including N.
     
    char is_sum_of_abundant (unsigned long N)
    char is_sum_of_abundant (unsigned long N)
     check if a given number can be represented as a sum of two abundant numbers. More...
     
    int main (int argc, char **argv)
     Main function.
     
    - - - -

    -Variables

    -unsigned long MAX_N = 28123
     upper limit of numbers to check
     

    Detailed Description

    Problem 23 solution

    @@ -163,22 +155,24 @@ unsigned long 
    Returns
    1 - if yes
    0 - if not
    -
    70 {
    -
    71  /* optimized logic:
    -
    72  * i + j = N where both i and j should be abundant
    -
    73  * hence we can simply check for j = N - i as we loop through i
    -
    74  */
    -
    75  for (unsigned long i = get_next_abundant(1); i <= (N >> 1);
    -
    76  i = get_next_abundant(i))
    -
    77  if (is_abundant(N - i))
    -
    78  {
    -
    79 #ifdef DEBUG
    -
    80  printf("\t%4lu + %4lu = %4lu\n", i, N - i, N);
    -
    81 #endif
    -
    82  return 1;
    -
    83  }
    -
    84  return 0;
    -
    85 }
    +
    72 {
    +
    73  /* optimized logic:
    +
    74  * i + j = N where both i and j should be abundant
    +
    75  * hence we can simply check for j = N - i as we loop through i
    +
    76  */
    +
    77  for (unsigned long i = get_next_abundant(1); i <= (N >> 1);
    +
    78  i = get_next_abundant(i))
    +
    79  {
    +
    80  if (is_abundant(N - i))
    +
    81  {
    +
    82 #ifdef DEBUG
    +
    83  printf("\t%4lu + %4lu = %4lu\n", i, N - i, N);
    +
    84 #endif
    +
    85  return 1;
    +
    86  }
    +
    87  }
    +
    88  return 0;
    +
    89 }
    Here is the call graph for this function:
    @@ -191,7 +185,6 @@ Here is the call graph for this function:
    get_next_abundant
    unsigned long get_next_abundant(unsigned long N)
    Find the next abundant number after N and not including N.
    Definition: sol1.c:55
    -
    N
    #define N
    number of digits of the large number
    Definition: sol1.c:109
    is_abundant
    unsigned long is_abundant(unsigned long N)
    Is the given number an abundant number (1) or not (0)
    Definition: sol1.c:47
    - + +int  - +

    Functions

    unsigned int add_numbers (unsigned char *a, unsigned char *b, unsigned char *c, int N)
    unsigned int add_numbers (unsigned char *a, unsigned char *b, unsigned char *c, int N)
     Function to add arbitraty length decimal integers stored in an array. More...
     
    -int print_number (unsigned char *number, int N)
    print_number (unsigned char *number, int N)
     Print a large number.
     
    @@ -186,7 +186,7 @@ a + b = c = new b

    22  unsigned char carry = 0;
    23  unsigned int i;
    24 
    -
    25  for (i = 0; i < N; i++)
    +
    25  for (i = 0; i < N; i++)
    26  {
    27  // printf("\t%d + %d + %d ", a[i], b[i], carry);
    28  c[i] = carry + a[i] + b[i];
    @@ -196,33 +196,36 @@ a + b = c = new b

    32  c[i] -= 10;
    33  }
    34  else
    -
    35  carry = 0;
    -
    36  // printf("= %d, %d\n", carry, c[i]);
    -
    37  }
    -
    38 
    -
    39  while (carry != 0)
    -
    40  {
    -
    41  // printf("\t\t...adding new digit\n");
    -
    42  // printf("\t0 + %d + %d ", b[i], carry);
    -
    43  c[i] = carry + c[i];
    -
    44  if (c[i] > 9)
    -
    45  {
    -
    46  carry = 1;
    -
    47  c[i] -= 10;
    -
    48  }
    -
    49  else
    -
    50  carry = 0;
    -
    51  // printf("= %d, %d\n", carry, c[i]);
    -
    52  i++;
    -
    53  }
    -
    54  return i;
    -
    55 }
    +
    35  {
    +
    36  carry = 0;
    +
    37  }
    +
    38  // printf("= %d, %d\n", carry, c[i]);
    +
    39  }
    +
    40 
    +
    41  while (carry != 0)
    +
    42  {
    +
    43  // printf("\t\t...adding new digit\n");
    +
    44  // printf("\t0 + %d + %d ", b[i], carry);
    +
    45  c[i] = carry + c[i];
    +
    46  if (c[i] > 9)
    +
    47  {
    +
    48  carry = 1;
    +
    49  c[i] -= 10;
    +
    50  }
    +
    51  else
    +
    52  {
    +
    53  carry = 0;
    +
    54  }
    +
    55  // printf("= %d, %d\n", carry, c[i]);
    +
    56  i++;
    +
    57  }
    +
    58  return i;
    +
    59 }
    -
    N
    #define N
    number of digits of the large number
    Definition: sol1.c:109
    double adaline_fit_sample (struct adaline *ada, const double *x, const int y)
     Update the weights of the model using supervised learning for one feature vector. More...
     
    void adaline_fit (struct adaline *ada, double **X, const int *y, const int N)
    void adaline_fit (struct adaline *ada, double **X, const int *y, const int N)
     Update the weights of the model using supervised learning for an array of vectors. More...
     
    @@ -235,12 +235,12 @@ Functions
    - - - - - - - -

    -Macros

    -#define N   10
     number of digits of the large number
     
    -#define N2   (N + 10)
     number of digits in output number
     
    - - + + +int  +char  +void  - + @@ -202,15 +202,15 @@ int  +unsigned long 

    Functions

    int get_number (FILE *fp, char *buffer, uint8_t *out_int)
     Function to read the number from a file and store it in array. More...
     
    int add_numbers (uint8_t *a, uint8_t *b, uint8_t N)
     Function to add arbitraty length decimal integers stored in an array. More...
    int add_numbers (uint8_t *a, uint8_t *b, uint8_t N)
     Function to add arbitrary length decimal integers stored in an array. More...
     
    -int print_number (uint8_t *number, uint8_t N, int8_t num_digits_to_print)
    print_number (uint8_t *number, uint8_t N, int8_t num_digits_to_print)
     Function to print a long number.
     
    @@ -175,43 +163,49 @@ int  -

    Function to add arbitraty length decimal integers stored in an array.

    +

    Function to add arbitrary length decimal integers stored in an array.

    a + b = c = new b

    -
    45 {
    -
    46  int carry = 0;
    -
    47  uint8_t *c = b; /* accumulate the result in the array 'b' */
    -
    48 
    -
    49  for (int i = 0; i < N; i++)
    -
    50  {
    -
    51  // printf("\t%d + %d + %d ", a[i], b[i], carry);
    -
    52  c[i] = carry + a[i] + b[i];
    -
    53  if (c[i] > 9) /* check for carry */
    -
    54  {
    -
    55  carry = 1;
    -
    56  c[i] -= 10;
    -
    57  }
    -
    58  else
    -
    59  carry = 0;
    -
    60  // printf("= %d, %d\n", carry, c[i]);
    -
    61  }
    -
    62 
    -
    63  for (int i = N; i < N + 10; i++)
    -
    64  {
    -
    65  if (carry == 0)
    -
    66  break;
    -
    67  // printf("\t0 + %d + %d ", b[i], carry);
    -
    68  c[i] = carry + c[i];
    -
    69  if (c[i] > 9)
    -
    70  {
    -
    71  carry = 1;
    -
    72  c[i] -= 10;
    -
    73  }
    -
    74  else
    -
    75  carry = 0;
    -
    76  // printf("= %d, %d\n", carry, c[i]);
    -
    77  }
    -
    78  return 0;
    -
    79 }
    +
    49 {
    +
    50  int carry = 0;
    +
    51  uint8_t *c = b; /* accumulate the result in the array 'b' */
    +
    52 
    +
    53  for (int i = 0; i < N; i++)
    +
    54  {
    +
    55  // printf("\t%d + %d + %d ", a[i], b[i], carry);
    +
    56  c[i] = carry + a[i] + b[i]; // NOLINT // This is a known false-positive
    +
    57  if (c[i] > 9) /* check for carry */
    +
    58  {
    +
    59  carry = 1;
    +
    60  c[i] -= 10;
    +
    61  }
    +
    62  else
    +
    63  {
    +
    64  carry = 0;
    +
    65  }
    +
    66  // printf("= %d, %d\n", carry, c[i]);
    +
    67  }
    +
    68 
    +
    69  for (int i = N; i < N + 10; i++)
    +
    70  {
    +
    71  if (carry == 0)
    +
    72  {
    +
    73  break;
    +
    74  }
    +
    75  // printf("\t0 + %d + %d ", b[i], carry);
    +
    76  c[i] = carry + c[i];
    +
    77  if (c[i] > 9)
    +
    78  {
    +
    79  carry = 1;
    +
    80  c[i] -= 10;
    +
    81  }
    +
    82  else
    +
    83  {
    +
    84  carry = 0;
    +
    85  }
    +
    86  // printf("= %d, %d\n", carry, c[i]);
    +
    87  }
    +
    88  return 0;
    +
    89 }
    @@ -263,23 +257,26 @@ int     		 26  long L = strlen(buffer);
    27 
    28  for (int i = 0; i < L; i++)
    -
    29  if (buffer[i] < 0x30 || buffer[i] > 0x39)
    -
    30  {
    -
    31  perror("found inavlid character in the number!");
    -
    32  return -1;
    -
    33  }
    -
    34  else
    -
    35  out_int[L - i - 1] = buffer[i] - 0x30;
    -
    36 
    -
    37  return 0;
    -
    38 }
    +
    29  {
    +
    30  if (buffer[i] < 0x30 || buffer[i] > 0x39)
    +
    31  {
    +
    32  perror("found inavlid character in the number!");
    +
    33  return -1;
    +
    34  }
    +
    35  else
    +
    36  {
    +
    37  out_int[L - i - 1] = buffer[i] - 0x30;
    +
    38  }
    +
    39  }
    +
    40 
    +
    41  return 0;
    +
    42 }
    L
    Definition: list.h:8
    -
    N
    #define N
    number of digits of the large number
    Definition: sol1.c:109
     Function that allocates memory to add another digit at the MSB.
     
    -char remove_digits (big_int *digit, int N)
    remove_digits (big_int *digit, int N)
     Function to remove digits preceeding the current digit.
     
    diff --git a/db/dfb/hash_8h_source.html b/db/dfb/hash_8h_source.html index 4c76dcd9..e74b4a4d 100644 --- a/db/dfb/hash_8h_source.html +++ b/db/dfb/hash_8h_source.html @@ -146,7 +146,6 @@ $(document).ready(function(){initNavTree('db/dfb/hash_8h_source.html','../../');
    data
    Definition: prime_factoriziation.c:25
    -
    N
    #define N
    number of digits of the large number
    Definition: sol1.c:109
    spirograph
    void spirograph(double *x, double *y, double l, double k, size_t N, double rot)
    Generate spirograph curve into arrays x and y such that the i^th point in 2D is represented by (x[i],...
    Definition: spirograph.c:57
    test
    void test(void)
    Test function to save resulting points to a CSV file.
    Definition: spirograph.c:74
    main
    int main(int argc, char **argv)
    the main function take one argument of type char* example : .
    Definition: c_atoi_str_to_integer.c:72
    diff --git a/dc/d2e/lu__decompose_8c.html b/dc/d2e/lu__decompose_8c.html index f63bb2f4..53c688f4 100644 --- a/dc/d2e/lu__decompose_8c.html +++ b/dc/d2e/lu__decompose_8c.html @@ -115,7 +115,7 @@ Functions
     Perform LU decomposition on matrix. More...
     
    -void display (double **A, int N)
    display (double **A, int N)
     Function to display square matrix.
     
    diff --git a/dd/d8c/adaline__learning_8c.html b/dd/d8c/adaline__learning_8c.html index 3112f20f..8fb07fa3 100644 --- a/dd/d8c/adaline__learning_8c.html +++ b/dd/d8c/adaline__learning_8c.html @@ -152,7 +152,7 @@ Functions
    double adaline_fit_sample (struct adaline *ada, const double *x, const int y)
     Update the weights of the model using supervised learning for one feature vector. More...
     
    void adaline_fit (struct adaline *ada, double **X, const int *y, const int N)
    void adaline_fit (struct adaline *ada, double **X, const int *y, const int N)
     Update the weights of the model using supervised learning for an array of vectors. More...
     
    void test1 (double eta)
    226 {
    227  struct adaline ada = new_adaline(2, eta); // 2 features
    228 
    -
    229  const int N = 10; // number of sample points
    +
    229  const int N = 10; // number of sample points
    230  const double saved_X[10][2] = {{0, 1}, {1, -2}, {2, 3}, {3, -1},
    231  {4, 1}, {6, -5}, {-7, -3}, {-8, 5},
    232  {-9, 2}, {-10, -15}};
    233 
    -
    234  double **X = (double **)malloc(N * sizeof(double *));
    +
    234  double **X = (double **)malloc(N * sizeof(double *));
    235  const int Y[10] = {1, -1, 1, -1, -1,
    236  -1, 1, 1, 1, -1}; // corresponding y-values
    -
    237  for (int i = 0; i < N; i++)
    +
    237  for (int i = 0; i < N; i++)
    238  {
    239  X[i] = (double *)saved_X[i];
    240  }
    @@ -218,7 +218,7 @@ int     		 242  printf("------- Test 1 -------\n");
    243  printf("Model before fit: %s", adaline_get_weights_str(&ada));
    244 
    -
    245  adaline_fit(&ada, X, Y, N);
    +
    245  adaline_fit(&ada, X, Y, N);
    246  printf("Model after fit: %s\n", adaline_get_weights_str(&ada));
    247 
    248  double test_x[] = {5, -3};
    @@ -273,17 +273,17 @@ Here is the call graph for this function:
    274 {
    275  struct adaline ada = new_adaline(2, eta); // 2 features
    276 
    -
    277  const int N = 50; // number of sample points
    +
    277  const int N = 50; // number of sample points
    278 
    -
    279  double **X = (double **)malloc(N * sizeof(double *));
    -
    280  int *Y = (int *)malloc(N * sizeof(int)); // corresponding y-values
    -
    281  for (int i = 0; i < N; i++) X[i] = (double *)malloc(2 * sizeof(double));
    +
    279  double **X = (double **)malloc(N * sizeof(double *));
    +
    280  int *Y = (int *)malloc(N * sizeof(int)); // corresponding y-values
    +
    281  for (int i = 0; i < N; i++) X[i] = (double *)malloc(2 * sizeof(double));
    282 
    283  // generate sample points in the interval
    284  // [-range2/100 , (range2-1)/100]
    285  int range = 500; // sample points full-range
    286  int range2 = range >> 1; // sample points half-range
    -
    287  for (int i = 0; i < N; i++)
    +
    287  for (int i = 0; i < N; i++)
    288  {
    289  double x0 = ((rand() % range) - range2) / 100.f;
    290  double x1 = ((rand() % range) - range2) / 100.f;
    @@ -295,7 +295,7 @@ Here is the call graph for this function:
    296  printf("------- Test 2 -------\n");
    297  printf("Model before fit: %s", adaline_get_weights_str(&ada));
    298 
    -
    299  adaline_fit(&ada, X, Y, N);
    +
    299  adaline_fit(&ada, X, Y, N);
    300  printf("Model after fit: %s\n", adaline_get_weights_str(&ada));
    301 
    302  int N_test_cases = 5;
    @@ -315,7 +315,7 @@ Here is the call graph for this function:
    316  printf(" ...passed\n");
    317  }
    318 
    -
    319  for (int i = 0; i < N; i++) free(X[i]);
    +
    319  for (int i = 0; i < N; i++) free(X[i]);
    320  free(X);
    321  free(Y);
    322  delete_adaline(&ada);
    @@ -356,17 +356,17 @@ Here is the call graph for this function:
    337 {
    338  struct adaline ada = new_adaline(6, eta); // 2 features
    339 
    -
    340  const int N = 50; // number of sample points
    +
    340  const int N = 50; // number of sample points
    341 
    -
    342  double **X = (double **)malloc(N * sizeof(double *));
    -
    343  int *Y = (int *)malloc(N * sizeof(int)); // corresponding y-values
    -
    344  for (int i = 0; i < N; i++) X[i] = (double *)malloc(6 * sizeof(double));
    +
    342  double **X = (double **)malloc(N * sizeof(double *));
    +
    343  int *Y = (int *)malloc(N * sizeof(int)); // corresponding y-values
    +
    344  for (int i = 0; i < N; i++) X[i] = (double *)malloc(6 * sizeof(double));
    345 
    346  // generate sample points in the interval
    347  // [-range2/100 , (range2-1)/100]
    348  int range = 200; // sample points full-range
    349  int range2 = range >> 1; // sample points half-range
    -
    350  for (int i = 0; i < N; i++)
    +
    350  for (int i = 0; i < N; i++)
    351  {
    352  double x0 = ((rand() % range) - range2) / 100.f;
    353  double x1 = ((rand() % range) - range2) / 100.f;
    @@ -383,7 +383,7 @@ Here is the call graph for this function:
    364  printf("------- Test 3 -------\n");
    365  printf("Model before fit: %s", adaline_get_weights_str(&ada));
    366 
    -
    367  adaline_fit(&ada, X, Y, N);
    +
    367  adaline_fit(&ada, X, Y, N);
    368  printf("Model after fit: %s\n", adaline_get_weights_str(&ada));
    369 
    370  int N_test_cases = 5;
    @@ -407,7 +407,7 @@ Here is the call graph for this function:
    388  printf(" ...passed\n");
    389  }
    390 
    -
    391  for (int i = 0; i < N; i++) free(X[i]);
    +
    391  for (int i = 0; i < N; i++) free(X[i]);
    392  free(X);
    393  free(Y);
    394  delete_adaline(&ada);
    @@ -425,7 +425,6 @@ Here is the call graph for this function:
    adaline_fit
    void adaline_fit(struct adaline *ada, double **X, const int *y, const int N)
    Update the weights of the model using supervised learning for an array of vectors.
    Definition: adaline_learning.c:184
    data
    Definition: prime_factoriziation.c:25
    -
    N
    #define N
    number of digits of the large number
    Definition: sol1.c:109
    adaline::eta
    double eta
    learning rate of the algorithm
    Definition: adaline_learning.c:45
    delete_adaline
    void delete_adaline(struct adaline *ada)
    delete dynamically allocated memory
    Definition: adaline_learning.c:89
    adaline_predict
    int adaline_predict(struct adaline *ada, const double *x, double *out)
    predict the output of the model for given set of features
    Definition: adaline_learning.c:136
    diff --git a/df/d1a/problem__21_2sol1_8c.html b/df/d1a/problem__21_2sol1_8c.html index dd9edbe5..9742a45a 100644 --- a/df/d1a/problem__21_2sol1_8c.html +++ b/df/d1a/problem__21_2sol1_8c.html @@ -112,7 +112,7 @@ Include dependency graph for sol1.c:

    Functions

    -unsigned long sum_of_divisors (unsigned int N)
    sum_of_divisors (unsigned int N)
     function to return the sum of proper divisors of N
     
    diff --git a/globals_defs.html b/globals_defs.html index 98d27315..4d330f4f 100644 --- a/globals_defs.html +++ b/globals_defs.html @@ -93,9 +93,9 @@ $(document).ready(function(){initNavTree('globals_defs.html',''); initResizable(   diff --git a/globals_m.html b/globals_m.html index 02228f78..bd537b2c 100644 --- a/globals_m.html +++ b/globals_m.html @@ -113,8 +113,6 @@ $(document).ready(function(){initNavTree('globals_m.html',''); initResizable(); , ode_semi_implicit_euler.c , sol1.c , sol2.c -, qr_decomposition.c -, sol1.c , shell_sort2.c , merge_sort.c , bead_sort.c @@ -129,10 +127,11 @@ $(document).ready(function(){initNavTree('globals_m.html',''); initResizable(); , sol1.c , sol.c , sol2.c -, sol1.c +, sol1.c +, qr_decomposition.c +, sol1.c , fibonacci_fast.c , qr_eigen_values.c -, sol1.c , realtime_stats.c , spirograph.c , kohonen_som_trace.c @@ -140,13 +139,13 @@ $(document).ready(function(){initNavTree('globals_m.html',''); initResizable(); , sol1.c , sol2.c , sudoku_solver.c -, sol3.c -, sol4.c , sol1.c , sol2.c +, sol1.c +, sol3.c +, sol4.c , cantor_set.c , union_find.c -, sol1.c , durand_kerner_roots.c
  • mat_mul() @@ -165,15 +164,11 @@ $(document).ready(function(){initNavTree('globals_m.html',''); initResizable();
  • MAX_DIGITS : sol1.c
    • -
  • MAX_L -: sol1.c -
  • MAX_LEN : sol1.c
    • -
  • MAX_N -: sol1.c -, sol2.c +
  • MAX_LENGTH +: sol1.c
  • MAX_NAME_LEN : sol1.c @@ -201,8 +196,8 @@ $(document).ready(function(){initNavTree('globals_m.html',''); initResizable(); , kohonen_som_trace.c , kohonen_som_topology.c
    • -
  • MOD -: sol1.c +
  • MOD_LIMIT +: sol1.c
  • modifiedBinarySearch() : modified_binary_search.c diff --git a/globals_n.html b/globals_n.html index 82eb5698..55759aee 100644 --- a/globals_n.html +++ b/globals_n.html @@ -93,12 +93,6 @@ $(document).ready(function(){initNavTree('globals_n.html',''); initResizable();
    Here is a list of all documented functions, variables, defines, enums, and typedefs with links to the documentation:

    - n -

      -
    • N -: sol1.c -
      • -
    • N2 -: sol1.c -
    • new_adaline() : adaline_learning.c
      • diff --git a/globals_vars.html b/globals_vars.html index 4634a4a1..fc27fe4f 100644 --- a/globals_vars.html +++ b/globals_vars.html @@ -94,10 +94,6 @@ $(document).ready(function(){initNavTree('globals_vars.html',''); initResizable(
    • abundant_flags : sol2.c
      • -
    • MAX_N -: sol1.c -, sol2.c -
    diff --git a/navtreedata.js b/navtreedata.js index c3f43fe6..3b7db75c 100644 --- a/navtreedata.js +++ b/navtreedata.js @@ -86,8 +86,8 @@ var NAVTREE = var NAVTREEINDEX = [ "annotated.html", -"d5/da1/structnode.html#a1aa632fdf50713d86192a96f8191851b", -"de/dac/sudoku__solver_8c.html" +"d5/da1/structnode.html#a2783f1aec750191646305988f7e28756", +"de/dce/structmin__heap.html#a456c6372c103c6d1bb430f581f5d3c71" ]; var SYNCONMSG = 'click to disable panel synchronisation'; diff --git a/navtreeindex0.js b/navtreeindex0.js index bc5f1f0f..31840a35 100644 --- a/navtreeindex0.js +++ b/navtreeindex0.js @@ -170,10 +170,10 @@ var NAVTREEINDEX0 = "d4/d83/problem__401_2sol1_8c.html#a3c04138a5bfe5d72780bb7e82a18e627":[12,0,8,17,0,5], "d4/d83/problem__401_2sol1_8c.html#a4441a6d27134cf3aed05727800d99456":[12,0,8,17,0,4], "d4/d83/problem__401_2sol1_8c.html#a7380e14d595d560007b02ce516b6b215":[12,0,8,17,0,3], +"d4/d83/problem__401_2sol1_8c.html#a7a9a231e30b47bc0345749c8bd1e5077":[12,0,8,17,0,1], "d4/d83/problem__401_2sol1_8c.html#aacbb9e1f38be71e22df1584a37c56693":[12,0,8,17,0,0], "d4/d83/problem__401_2sol1_8c.html#aaf964739be92adc2f500e7da11e3f6be":[12,0,8,17,0,6], -"d4/d83/problem__401_2sol1_8c.html#aca7d5718ab8c38506adb3bef2469b319":[12,0,8,17,0,2], -"d4/d83/problem__401_2sol1_8c.html#adf2a0717e3307419a9d7c52707f5631e":[12,0,8,17,0,1], +"d4/d83/problem__401_2sol1_8c.html#ade1bdf2529e3c58f53bfb4d844f3a9d3":[12,0,8,17,0,2], "d4/d99/fibonacci__fast_8c.html":[12,0,6,4], "d4/d99/fibonacci__fast_8c.html#a0ddf1224851353fc92bfbff6f499fa97":[12,0,6,4,1], "d4/d99/fibonacci__fast_8c.html#a7a3d55bd19854075cba2eed6b63cb2d3":[12,0,6,4,0], @@ -189,7 +189,6 @@ var NAVTREEINDEX0 = "d4/dbd/problem__23_2sol2_8c.html#a34f4ad85151e3a43368ae67f42347f56":[12,0,8,12,1,2], "d4/dbd/problem__23_2sol2_8c.html#a3ab61b5a1c4f2288625d160aa0ea8478":[12,0,8,12,1,3], "d4/dbd/problem__23_2sol2_8c.html#a3c04138a5bfe5d72780bb7e82a18e627":[12,0,8,12,1,4], -"d4/dbd/problem__23_2sol2_8c.html#a8c7ddb39906f281b801f2cd58d416c2b":[12,0,8,12,1,6], "d4/dbd/problem__23_2sol2_8c.html#ac5d600bf3077f4188afc4c5cd2c40eaf":[12,0,8,12,1,0], "d4/dbd/problem__23_2sol2_8c.html#af920a16d6ef69dd604b283f427892e06":[12,0,8,12,1,5], "d4/dcb/md_hash__r_e_a_d_m_e.html":[7], @@ -249,5 +248,6 @@ var NAVTREEINDEX0 = "d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md26":[5,12], "d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md27":[5,13], "d5/da1/structnode.html":[11,0,20], -"d5/da1/structnode.html#a111a569ab2765add9b91c9f94cf9f063":[11,0,20,7] +"d5/da1/structnode.html#a111a569ab2765add9b91c9f94cf9f063":[11,0,20,7], +"d5/da1/structnode.html#a1aa632fdf50713d86192a96f8191851b":[11,0,20,6] }; diff --git a/navtreeindex1.js b/navtreeindex1.js index 7c555fac..8f0d2a73 100644 --- a/navtreeindex1.js +++ b/navtreeindex1.js @@ -1,6 +1,5 @@ var NAVTREEINDEX1 = { -"d5/da1/structnode.html#a1aa632fdf50713d86192a96f8191851b":[11,0,20,6], "d5/da1/structnode.html#a2783f1aec750191646305988f7e28756":[11,0,20,5], "d5/da1/structnode.html#a2d890bb9f6af0ffd73fe79b21124c2a2":[11,0,20,2], "d5/da1/structnode.html#a310a09cb5a882788781a5287096ad425":[11,0,20,0], @@ -99,7 +98,6 @@ var NAVTREEINDEX1 = "d7/dd8/c__atoi__str__to__integer_8c.html#ad19049ebfc2088bc1e75e7e958f7b60f":[12,0,0,0,0], "d7/ddb/problem__23_2sol1_8c.html":[12,0,8,12,0], "d7/ddb/problem__23_2sol1_8c.html#a1aca7f530f82b27100262adba9e7556b":[12,0,8,12,0,1], -"d7/ddb/problem__23_2sol1_8c.html#a337e545af040d754dc012b42523ee1ee":[12,0,8,12,0,5], "d7/ddb/problem__23_2sol1_8c.html#a3ab61b5a1c4f2288625d160aa0ea8478":[12,0,8,12,0,3], "d7/ddb/problem__23_2sol1_8c.html#a3c04138a5bfe5d72780bb7e82a18e627":[12,0,8,12,0,4], "d7/ddb/problem__23_2sol1_8c.html#a4f128410e6582fe26488e2316cc96e17":[12,0,8,12,0,2], @@ -149,8 +147,8 @@ var NAVTREEINDEX1 = "da/d2a/group__adaline.html#ga555ba960994e9bccb2029764588f694f":[10,0,5,2], "da/d2a/group__adaline.html#ga6f35caa3084772cc126ac7b20f67f665":[12,0,5,0,7], "da/d2a/group__adaline.html#ga6f35caa3084772cc126ac7b20f67f665":[10,0,5,8], -"da/d2a/group__adaline.html#gaa52120912e32d2893fe1c6d78da5befd":[12,0,5,0,3], "da/d2a/group__adaline.html#gaa52120912e32d2893fe1c6d78da5befd":[10,0,5,4], +"da/d2a/group__adaline.html#gaa52120912e32d2893fe1c6d78da5befd":[12,0,5,0,3], "da/d2a/group__adaline.html#gab4d49d73dec94c092b7ffadba55fb020":[12,0,5,0,0], "da/d2a/group__adaline.html#gab4d49d73dec94c092b7ffadba55fb020":[10,0,5,1], "da/d2a/group__adaline.html#gac70b578aee679005fd336073969c3d94":[12,0,5,0,6], @@ -171,12 +169,10 @@ var NAVTREEINDEX1 = "da/d9b/struct_trie_node.html#a9dc2a9bc247486fac3e4b350c73a3060":[11,0,29,1], "da/d9b/struct_trie_node.html#ab2732ce1e141346865d997859836d663":[11,0,29,2], "db/d01/problem__13_2sol1_8c.html":[12,0,8,3,0], -"db/d01/problem__13_2sol1_8c.html#a0240ac851181b84ac374872dc5434ee4":[12,0,8,3,0,0], -"db/d01/problem__13_2sol1_8c.html#a248adc917818cc6666d8bc679a660319":[12,0,8,3,0,5], -"db/d01/problem__13_2sol1_8c.html#a840291bc02cba5474a4cb46a9b9566fe":[12,0,8,3,0,4], -"db/d01/problem__13_2sol1_8c.html#ac260f58785fb20eb09bb35385a7d47f8":[12,0,8,3,0,3], -"db/d01/problem__13_2sol1_8c.html#acd864640121c7df2c19f61f7baa507e4":[12,0,8,3,0,1], -"db/d01/problem__13_2sol1_8c.html#ad51742ca5a5c99e860bdf30299163bf2":[12,0,8,3,0,2], +"db/d01/problem__13_2sol1_8c.html#a248adc917818cc6666d8bc679a660319":[12,0,8,3,0,3], +"db/d01/problem__13_2sol1_8c.html#a840291bc02cba5474a4cb46a9b9566fe":[12,0,8,3,0,2], +"db/d01/problem__13_2sol1_8c.html#ac260f58785fb20eb09bb35385a7d47f8":[12,0,8,3,0,1], +"db/d01/problem__13_2sol1_8c.html#ad51742ca5a5c99e860bdf30299163bf2":[12,0,8,3,0,0], "db/d80/problem__20_2sol1_8c.html":[12,0,8,9,0], "db/d80/problem__20_2sol1_8c.html#a3c04138a5bfe5d72780bb7e82a18e627":[12,0,8,9,0,3], "db/d80/problem__20_2sol1_8c.html#a54a02c4b963fdb16f24959e0137763f1":[12,0,8,9,0,4], @@ -249,5 +245,9 @@ var NAVTREEINDEX1 = "dd/df0/problem__19_2sol1_8c.html#a6561b1adc8a19c092679b9874da24e2e":[12,0,8,7,0,1], "dd/df0/problem__19_2sol1_8c.html#ab7f9ad087f124b8e0615aa535b4c8a75":[12,0,8,7,0,0], "de/d20/md_data_structures_dictionary__r_e_a_d_m_e.html":[3], -"de/d20/md_data_structures_dictionary__r_e_a_d_m_e.html#autotoc_md9":[0] +"de/d20/md_data_structures_dictionary__r_e_a_d_m_e.html#autotoc_md9":[0], +"de/dac/sudoku__solver_8c.html":[12,0,6,6], +"de/dac/sudoku__solver_8c.html#ae1a3968e7947464bee7714f6d43b7002":[12,0,6,6,8], +"de/dac/sudoku__solver_8c.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[12,0,6,6,1], +"de/dce/structmin__heap.html":[11,0,18] }; diff --git a/navtreeindex2.js b/navtreeindex2.js index 9d26675a..84c66c77 100644 --- a/navtreeindex2.js +++ b/navtreeindex2.js @@ -1,9 +1,5 @@ var NAVTREEINDEX2 = { -"de/dac/sudoku__solver_8c.html":[12,0,6,6], -"de/dac/sudoku__solver_8c.html#ae1a3968e7947464bee7714f6d43b7002":[12,0,6,6,8], -"de/dac/sudoku__solver_8c.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[12,0,6,6,1], -"de/dce/structmin__heap.html":[11,0,18], "de/dce/structmin__heap.html#a456c6372c103c6d1bb430f581f5d3c71":[11,0,18,2], "de/dce/structmin__heap.html#a9fd34546dad4dfd9e6a456936b766123":[11,0,18,0], "de/dce/structmin__heap.html#ad960bfacd24fb843208db83f113ebc8f":[11,0,18,1], @@ -102,8 +98,8 @@ var NAVTREEINDEX2 = "files.html":[12,0], "functions.html":[11,2,0], "functions_vars.html":[11,2,1], -"globals.html":[12,1,0], "globals.html":[12,1,0,0], +"globals.html":[12,1,0], "globals_a.html":[12,1,0,1], "globals_b.html":[12,1,0,2], "globals_c.html":[12,1,0,3], @@ -111,8 +107,8 @@ var NAVTREEINDEX2 = "globals_defs.html":[12,1,4], "globals_e.html":[12,1,0,5], "globals_f.html":[12,1,0,6], -"globals_func.html":[12,1,1], "globals_func.html":[12,1,1,0], +"globals_func.html":[12,1,1], "globals_func_a.html":[12,1,1,1], "globals_func_b.html":[12,1,1,2], "globals_func_c.html":[12,1,1,3], diff --git a/search/all_10.js b/search/all_10.js index 520cfd10..f5de5ea0 100644 --- a/search/all_10.js +++ b/search/all_10.js @@ -1,15 +1,15 @@ var searchData= [ - ['projecteuler_166',['ProjectEuler',['../d8/d81/md_project_euler__r_e_a_d_m_e.html',1,'']]], - ['palindrome_2ec_167',['palindrome.c',['../df/d16/palindrome_8c.html',1,'']]], - ['pid_168',['pid',['../d0/d43/structpid.html',1,'']]], - ['poly_5ffunction_169',['poly_function',['../da/d38/durand__kerner__roots_8c.html#a321f9781a9744ccdaf0aba89f35ec29c',1,'durand_kerner_roots.c']]], - ['postorder_5fdisplay_170',['postorder_display',['../df/d3c/threaded__binary__trees_8c.html#a5a82ae0ee13788be51ca4ba6cddb0719',1,'threaded_binary_trees.c']]], - ['preorder_5fdisplay_171',['preorder_display',['../df/d3c/threaded__binary__trees_8c.html#a8169ba0dfd5b8183672e444d1434bf9c',1,'threaded_binary_trees.c']]], - ['prev_5fdigit_172',['prev_digit',['../dc/d77/struct__big__int.html#ad8405989a924410942b39ec0e9fef30b',1,'_big_int']]], - ['print_173',['print',['../dc/d80/cantor__set_8c.html#a75ee530cd7148a63249784ad3dda8fab',1,'print(CantorSet *head): cantor_set.c'],['../d5/df4/group__sudoku.html#ga702ff4f95dde780c7d04fcdd1021b6c1',1,'print(const struct sudoku *a): sudoku_solver.c']]], - ['print_5fmatrix_174',['print_matrix',['../d4/d68/qr__decompose_8h.html#a90562ce8c3707401e9c5809dece68d6a',1,'qr_decompose.h']]], - ['print_5fnumber_175',['print_number',['../db/d01/problem__13_2sol1_8c.html#a248adc917818cc6666d8bc679a660319',1,'print_number(uint8_t *number, uint8_t N, int8_t num_digits_to_print): sol1.c'],['../d8/d32/problem__25_2sol1_8c.html#abe5bc1f170b2108a19d0a16d30bd3235',1,'print_number(unsigned char *number, int N): sol1.c']]], - ['problem_176',['problem',['../d4/d07/ode__forward__euler_8c.html#a97075291390a68c262ed66e157a57eb4',1,'problem(const double *x, double *y, double *dy): ode_forward_euler.c'],['../d1/dc2/ode__midpoint__euler_8c.html#a97075291390a68c262ed66e157a57eb4',1,'problem(const double *x, double *y, double *dy): ode_midpoint_euler.c'],['../d4/d99/ode__semi__implicit__euler_8c.html#a97075291390a68c262ed66e157a57eb4',1,'problem(const double *x, double *y, double *dy): ode_semi_implicit_euler.c']]], - ['propagate_177',['propagate',['../dc/d80/cantor__set_8c.html#a1f156d2b53b80305bd2fa3ff5fdf3c97',1,'cantor_set.c']]] + ['projecteuler_165',['ProjectEuler',['../d8/d81/md_project_euler__r_e_a_d_m_e.html',1,'']]], + ['palindrome_2ec_166',['palindrome.c',['../df/d16/palindrome_8c.html',1,'']]], + ['pid_167',['pid',['../d0/d43/structpid.html',1,'']]], + ['poly_5ffunction_168',['poly_function',['../da/d38/durand__kerner__roots_8c.html#a321f9781a9744ccdaf0aba89f35ec29c',1,'durand_kerner_roots.c']]], + ['postorder_5fdisplay_169',['postorder_display',['../df/d3c/threaded__binary__trees_8c.html#a5a82ae0ee13788be51ca4ba6cddb0719',1,'threaded_binary_trees.c']]], + ['preorder_5fdisplay_170',['preorder_display',['../df/d3c/threaded__binary__trees_8c.html#a8169ba0dfd5b8183672e444d1434bf9c',1,'threaded_binary_trees.c']]], + ['prev_5fdigit_171',['prev_digit',['../dc/d77/struct__big__int.html#ad8405989a924410942b39ec0e9fef30b',1,'_big_int']]], + ['print_172',['print',['../dc/d80/cantor__set_8c.html#a75ee530cd7148a63249784ad3dda8fab',1,'print(CantorSet *head): cantor_set.c'],['../d5/df4/group__sudoku.html#ga702ff4f95dde780c7d04fcdd1021b6c1',1,'print(const struct sudoku *a): sudoku_solver.c']]], + ['print_5fmatrix_173',['print_matrix',['../d4/d68/qr__decompose_8h.html#a90562ce8c3707401e9c5809dece68d6a',1,'qr_decompose.h']]], + ['print_5fnumber_174',['print_number',['../db/d01/problem__13_2sol1_8c.html#a248adc917818cc6666d8bc679a660319',1,'print_number(uint8_t *number, uint8_t N, int8_t num_digits_to_print): sol1.c'],['../d8/d32/problem__25_2sol1_8c.html#abe5bc1f170b2108a19d0a16d30bd3235',1,'print_number(unsigned char *number, int N): sol1.c']]], + ['problem_175',['problem',['../d4/d07/ode__forward__euler_8c.html#a97075291390a68c262ed66e157a57eb4',1,'problem(const double *x, double *y, double *dy): ode_forward_euler.c'],['../d1/dc2/ode__midpoint__euler_8c.html#a97075291390a68c262ed66e157a57eb4',1,'problem(const double *x, double *y, double *dy): ode_midpoint_euler.c'],['../d4/d99/ode__semi__implicit__euler_8c.html#a97075291390a68c262ed66e157a57eb4',1,'problem(const double *x, double *y, double *dy): ode_semi_implicit_euler.c']]], + ['propagate_176',['propagate',['../dc/d80/cantor__set_8c.html#a1f156d2b53b80305bd2fa3ff5fdf3c97',1,'cantor_set.c']]] ]; diff --git a/search/all_11.js b/search/all_11.js index 7c626f8e..76e10594 100644 --- a/search/all_11.js +++ b/search/all_11.js @@ -1,9 +1,9 @@ var searchData= [ - ['qr_5fdecompose_178',['qr_decompose',['../d4/d68/qr__decompose_8h.html#a45c7640d9d22c89c11beb1f567843c56',1,'qr_decompose.h']]], - ['qr_5fdecompose_2eh_179',['qr_decompose.h',['../d4/d68/qr__decompose_8h.html',1,'']]], - ['qr_5fdecomposition_2ec_180',['qr_decomposition.c',['../d5/d23/qr__decomposition_8c.html',1,'']]], - ['qr_5feigen_5fvalues_2ec_181',['qr_eigen_values.c',['../d7/d50/qr__eigen__values_8c.html',1,'']]], - ['queue_182',['queue',['../d2/d36/structqueue.html',1,'']]], - ['queuerep_183',['QueueRep',['../d0/d10/struct_queue_rep.html',1,'']]] + ['qr_5fdecompose_177',['qr_decompose',['../d4/d68/qr__decompose_8h.html#a45c7640d9d22c89c11beb1f567843c56',1,'qr_decompose.h']]], + ['qr_5fdecompose_2eh_178',['qr_decompose.h',['../d4/d68/qr__decompose_8h.html',1,'']]], + ['qr_5fdecomposition_2ec_179',['qr_decomposition.c',['../d5/d23/qr__decomposition_8c.html',1,'']]], + ['qr_5feigen_5fvalues_2ec_180',['qr_eigen_values.c',['../d7/d50/qr__eigen__values_8c.html',1,'']]], + ['queue_181',['queue',['../d2/d36/structqueue.html',1,'']]], + ['queuerep_182',['QueueRep',['../d0/d10/struct_queue_rep.html',1,'']]] ]; diff --git a/search/all_12.js b/search/all_12.js index ac1628df..2a1f379d 100644 --- a/search/all_12.js +++ b/search/all_12.js @@ -1,6 +1,6 @@ var searchData= [ - ['realtime_5fstats_2ec_184',['realtime_stats.c',['../dc/d47/realtime__stats_8c.html',1,'']]], - ['remove_5fdigits_185',['remove_digits',['../db/d80/problem__20_2sol1_8c.html#a54a02c4b963fdb16f24959e0137763f1',1,'sol1.c']]], - ['rlink_186',['rlink',['../db/d8b/struct_node.html#a0ed3c7305b43527f0f237bbfd438b8f7',1,'Node']]] + ['realtime_5fstats_2ec_183',['realtime_stats.c',['../dc/d47/realtime__stats_8c.html',1,'']]], + ['remove_5fdigits_184',['remove_digits',['../db/d80/problem__20_2sol1_8c.html#a54a02c4b963fdb16f24959e0137763f1',1,'sol1.c']]], + ['rlink_185',['rlink',['../db/d8b/struct_node.html#a0ed3c7305b43527f0f237bbfd438b8f7',1,'Node']]] ]; diff --git a/search/all_13.js b/search/all_13.js index c8667a05..fc2f0d81 100644 --- a/search/all_13.js +++ b/search/all_13.js @@ -1,36 +1,36 @@ var searchData= [ - ['simple_20generic_20stack_187',['Simple generic Stack',['../d1/d12/md_data_structures_stack__r_e_a_d_m_e.html',1,'']]], - ['sample_20solutions_20for_20_3ca_20href_3d_22http_3a_2f_2fexercism_2eio_2f_22_3eexercism_2eio_3c_2fa_3e_188',['Sample solutions for <a href="http://exercism.io/">exercism.io</a>',['../d7/db5/md_exercism__r_e_a_d_m_e.html',1,'']]], - ['save_5f2d_5fdata_189',['save_2d_data',['../d1/d6b/group__kohonen__2d.html#ga6824dc6d973eb3339af7aef5fea78b0c',1,'kohonen_som_topology.c']]], - ['save_5fnd_5fdata_190',['save_nd_data',['../d0/dcb/group__kohonen__1d.html#ga7b84b14e60f47812b581d1f93057c85a',1,'kohonen_som_trace.c']]], - ['save_5fu_5fmatrix_191',['save_u_matrix',['../d1/d6b/group__kohonen__2d.html#ga49d35f68f5d11d8ef6f8cce0d0e7bcba',1,'kohonen_som_topology.c']]], - ['search_192',['search',['../df/d3c/threaded__binary__trees_8c.html#a306d567466f22e1e927aaed97d8bb58c',1,'threaded_binary_trees.c']]], - ['semi_5fimplicit_5feuler_193',['semi_implicit_euler',['../d4/d99/ode__semi__implicit__euler_8c.html#ad80059877222f885b549f2d0a3dc6b55',1,'ode_semi_implicit_euler.c']]], - ['semi_5fimplicit_5feuler_5fstep_194',['semi_implicit_euler_step',['../d4/d99/ode__semi__implicit__euler_8c.html#a720b7e995d2bbc615f94a2c7dbcf84eb',1,'ode_semi_implicit_euler.c']]], - ['shell_5fsort_195',['shell_sort',['../dd/d8b/problem__22_2sol1_8c.html#a5bc3659aa0949ea33118c95b1dee5f63',1,'shell_sort(char data[][MAX_NAME_LEN], int LEN): sol1.c'],['../d5/d4c/group__sorting.html#ga5bc16eaf3ffe6a6ab66780dd445904c0',1,'shell_sort(int *array, long LEN): shell_sort2.c']]], - ['shell_5fsort2_2ec_196',['shell_sort2.c',['../d6/ded/shell__sort2_8c.html',1,'']]], - ['show_5fdata_197',['show_data',['../d5/d4c/group__sorting.html#gaeccaf61ff47279384d1dba8d869d5c2f',1,'shell_sort2.c']]], - ['sigma_198',['sigma',['../d4/d83/problem__401_2sol1_8c.html#aaf964739be92adc2f500e7da11e3f6be',1,'sol1.c']]], - ['sigma2_199',['sigma2',['../d4/d83/problem__401_2sol1_8c.html#a236548478af932f1115a71f601a68788',1,'sol1.c']]], - ['so1_2ec_200',['so1.c',['../d0/d7f/so1_8c.html',1,'']]], - ['sol_2ec_201',['sol.c',['../d0/d6c/problem__4_2sol_8c.html',1,'(Global Namespace)'],['../df/de7/problem__5_2sol_8c.html',1,'(Global Namespace)'],['../d4/d7b/problem__6_2sol_8c.html',1,'(Global Namespace)'],['../d1/d2f/problem__7_2sol_8c.html',1,'(Global Namespace)']]], - ['sol1_2ec_202',['sol1.c',['../da/d35/problem__1_2sol1_8c.html',1,'(Global Namespace)'],['../d0/d6d/problem__10_2sol1_8c.html',1,'(Global Namespace)'],['../d7/d1f/problem__12_2sol1_8c.html',1,'(Global Namespace)'],['../db/d01/problem__13_2sol1_8c.html',1,'(Global Namespace)'],['../d4/dea/problem__14_2sol1_8c.html',1,'(Global Namespace)'],['../d7/d91/problem__15_2sol1_8c.html',1,'(Global Namespace)'],['../d6/d88/problem__16_2sol1_8c.html',1,'(Global Namespace)'],['../dd/df0/problem__19_2sol1_8c.html',1,'(Global Namespace)'],['../db/d80/problem__20_2sol1_8c.html',1,'(Global Namespace)'],['../df/d1a/problem__21_2sol1_8c.html',1,'(Global Namespace)'],['../dd/d8b/problem__22_2sol1_8c.html',1,'(Global Namespace)'],['../d7/ddb/problem__23_2sol1_8c.html',1,'(Global Namespace)'],['../d8/d32/problem__25_2sol1_8c.html',1,'(Global Namespace)'],['../d1/df9/problem__26_2sol1_8c.html',1,'(Global Namespace)'],['../d7/dd3/problem__3_2sol1_8c.html',1,'(Global Namespace)'],['../d4/d83/problem__401_2sol1_8c.html',1,'(Global Namespace)'],['../dc/d63/problem__8_2sol1_8c.html',1,'(Global Namespace)'],['../df/da5/problem__9_2sol1_8c.html',1,'(Global Namespace)']]], - ['sol2_2ec_203',['sol2.c',['../d2/dae/problem__1_2sol2_8c.html',1,'(Global Namespace)'],['../d9/da7/problem__10_2sol2_8c.html',1,'(Global Namespace)'],['../d4/dbd/problem__23_2sol2_8c.html',1,'(Global Namespace)'],['../d2/dbc/problem__3_2sol2_8c.html',1,'(Global Namespace)'],['../d2/d93/problem__8_2sol2_8c.html',1,'(Global Namespace)'],['../d8/de0/problem__9_2sol2_8c.html',1,'(Global Namespace)']]], - ['sol3_2ec_204',['sol3.c',['../d6/de3/sol3_8c.html',1,'']]], - ['sol4_2ec_205',['sol4.c',['../d6/d1b/sol4_8c.html',1,'']]], - ['solve_206',['solve',['../d5/df4/group__sudoku.html#gadfe0ed5085b4775d8fa00b434cc0fdfc',1,'sudoku_solver.c']]], - ['sorting_20algorithms_207',['Sorting algorithms',['../d5/d4c/group__sorting.html',1,'']]], - ['spirograph_208',['spirograph',['../d7/d98/spirograph_8c.html#a0daa148091ec953809fc172289f773d3',1,'spirograph.c']]], - ['spirograph_2ec_209',['spirograph.c',['../d7/d98/spirograph_8c.html',1,'']]], - ['stack_210',['Stack',['../dd/d10/struct_stack.html',1,'']]], - ['start_211',['start',['../d9/dd7/struct__cantor__set.html#abd2176c3cc3a1d85d15bbeaace35fa03',1,'_cantor_set']]], - ['stats_5fcomputer1_212',['stats_computer1',['../dc/d47/realtime__stats_8c.html#a63ddcdaab24f722f0963fa2fbe0ae628',1,'realtime_stats.c']]], - ['stats_5fcomputer2_213',['stats_computer2',['../dc/d47/realtime__stats_8c.html#a34be233a9200ee2065f6b7b27e2d9a96',1,'realtime_stats.c']]], - ['subset_214',['subset',['../dc/de5/structsubset.html',1,'']]], - ['sudoku_215',['sudoku',['../dc/d18/structsudoku.html',1,'sudoku'],['../d5/df4/group__sudoku.html',1,'(Global Namespace)']]], - ['sudoku_5fsolver_2ec_216',['sudoku_solver.c',['../de/dac/sudoku__solver_8c.html',1,'']]], - ['sum_5fof_5fdivisors_217',['sum_of_divisors',['../df/d1a/problem__21_2sol1_8c.html#aacf4b7e708651d2164e86958f2c29c93',1,'sol1.c']]], - ['sum_5fof_5fprimes_218',['sum_of_primes',['../d0/d6d/problem__10_2sol1_8c.html#ae3d987cb2ad0ddb0c3caa4c2506a20e5',1,'sol1.c']]], - ['swap_219',['swap',['../d5/d4c/group__sorting.html#ga4b9708d87be7a409eff20e5e7e8b43c8',1,'merge_sort.c']]] + ['simple_20generic_20stack_186',['Simple generic Stack',['../d1/d12/md_data_structures_stack__r_e_a_d_m_e.html',1,'']]], + ['sample_20solutions_20for_20_3ca_20href_3d_22http_3a_2f_2fexercism_2eio_2f_22_3eexercism_2eio_3c_2fa_3e_187',['Sample solutions for <a href="http://exercism.io/">exercism.io</a>',['../d7/db5/md_exercism__r_e_a_d_m_e.html',1,'']]], + ['save_5f2d_5fdata_188',['save_2d_data',['../d1/d6b/group__kohonen__2d.html#ga6824dc6d973eb3339af7aef5fea78b0c',1,'kohonen_som_topology.c']]], + ['save_5fnd_5fdata_189',['save_nd_data',['../d0/dcb/group__kohonen__1d.html#ga7b84b14e60f47812b581d1f93057c85a',1,'kohonen_som_trace.c']]], + ['save_5fu_5fmatrix_190',['save_u_matrix',['../d1/d6b/group__kohonen__2d.html#ga49d35f68f5d11d8ef6f8cce0d0e7bcba',1,'kohonen_som_topology.c']]], + ['search_191',['search',['../df/d3c/threaded__binary__trees_8c.html#a306d567466f22e1e927aaed97d8bb58c',1,'threaded_binary_trees.c']]], + ['semi_5fimplicit_5feuler_192',['semi_implicit_euler',['../d4/d99/ode__semi__implicit__euler_8c.html#ad80059877222f885b549f2d0a3dc6b55',1,'ode_semi_implicit_euler.c']]], + ['semi_5fimplicit_5feuler_5fstep_193',['semi_implicit_euler_step',['../d4/d99/ode__semi__implicit__euler_8c.html#a720b7e995d2bbc615f94a2c7dbcf84eb',1,'ode_semi_implicit_euler.c']]], + ['shell_5fsort_194',['shell_sort',['../dd/d8b/problem__22_2sol1_8c.html#a5bc3659aa0949ea33118c95b1dee5f63',1,'shell_sort(char data[][MAX_NAME_LEN], int LEN): sol1.c'],['../d5/d4c/group__sorting.html#ga5bc16eaf3ffe6a6ab66780dd445904c0',1,'shell_sort(int *array, long LEN): shell_sort2.c']]], + ['shell_5fsort2_2ec_195',['shell_sort2.c',['../d6/ded/shell__sort2_8c.html',1,'']]], + ['show_5fdata_196',['show_data',['../d5/d4c/group__sorting.html#gaeccaf61ff47279384d1dba8d869d5c2f',1,'shell_sort2.c']]], + ['sigma_197',['sigma',['../d4/d83/problem__401_2sol1_8c.html#aaf964739be92adc2f500e7da11e3f6be',1,'sol1.c']]], + ['sigma2_198',['sigma2',['../d4/d83/problem__401_2sol1_8c.html#a236548478af932f1115a71f601a68788',1,'sol1.c']]], + ['so1_2ec_199',['so1.c',['../d0/d7f/so1_8c.html',1,'']]], + ['sol_2ec_200',['sol.c',['../d0/d6c/problem__4_2sol_8c.html',1,'(Global Namespace)'],['../df/de7/problem__5_2sol_8c.html',1,'(Global Namespace)'],['../d4/d7b/problem__6_2sol_8c.html',1,'(Global Namespace)'],['../d1/d2f/problem__7_2sol_8c.html',1,'(Global Namespace)']]], + ['sol1_2ec_201',['sol1.c',['../da/d35/problem__1_2sol1_8c.html',1,'(Global Namespace)'],['../d0/d6d/problem__10_2sol1_8c.html',1,'(Global Namespace)'],['../d7/d1f/problem__12_2sol1_8c.html',1,'(Global Namespace)'],['../db/d01/problem__13_2sol1_8c.html',1,'(Global Namespace)'],['../d4/dea/problem__14_2sol1_8c.html',1,'(Global Namespace)'],['../d7/d91/problem__15_2sol1_8c.html',1,'(Global Namespace)'],['../d6/d88/problem__16_2sol1_8c.html',1,'(Global Namespace)'],['../dd/df0/problem__19_2sol1_8c.html',1,'(Global Namespace)'],['../db/d80/problem__20_2sol1_8c.html',1,'(Global Namespace)'],['../df/d1a/problem__21_2sol1_8c.html',1,'(Global Namespace)'],['../dd/d8b/problem__22_2sol1_8c.html',1,'(Global Namespace)'],['../d7/ddb/problem__23_2sol1_8c.html',1,'(Global Namespace)'],['../d8/d32/problem__25_2sol1_8c.html',1,'(Global Namespace)'],['../d1/df9/problem__26_2sol1_8c.html',1,'(Global Namespace)'],['../d7/dd3/problem__3_2sol1_8c.html',1,'(Global Namespace)'],['../d4/d83/problem__401_2sol1_8c.html',1,'(Global Namespace)'],['../dc/d63/problem__8_2sol1_8c.html',1,'(Global Namespace)'],['../df/da5/problem__9_2sol1_8c.html',1,'(Global Namespace)']]], + ['sol2_2ec_202',['sol2.c',['../d2/dae/problem__1_2sol2_8c.html',1,'(Global Namespace)'],['../d9/da7/problem__10_2sol2_8c.html',1,'(Global Namespace)'],['../d4/dbd/problem__23_2sol2_8c.html',1,'(Global Namespace)'],['../d2/dbc/problem__3_2sol2_8c.html',1,'(Global Namespace)'],['../d2/d93/problem__8_2sol2_8c.html',1,'(Global Namespace)'],['../d8/de0/problem__9_2sol2_8c.html',1,'(Global Namespace)']]], + ['sol3_2ec_203',['sol3.c',['../d6/de3/sol3_8c.html',1,'']]], + ['sol4_2ec_204',['sol4.c',['../d6/d1b/sol4_8c.html',1,'']]], + ['solve_205',['solve',['../d5/df4/group__sudoku.html#gadfe0ed5085b4775d8fa00b434cc0fdfc',1,'sudoku_solver.c']]], + ['sorting_20algorithms_206',['Sorting algorithms',['../d5/d4c/group__sorting.html',1,'']]], + ['spirograph_207',['spirograph',['../d7/d98/spirograph_8c.html#a0daa148091ec953809fc172289f773d3',1,'spirograph.c']]], + ['spirograph_2ec_208',['spirograph.c',['../d7/d98/spirograph_8c.html',1,'']]], + ['stack_209',['Stack',['../dd/d10/struct_stack.html',1,'']]], + ['start_210',['start',['../d9/dd7/struct__cantor__set.html#abd2176c3cc3a1d85d15bbeaace35fa03',1,'_cantor_set']]], + ['stats_5fcomputer1_211',['stats_computer1',['../dc/d47/realtime__stats_8c.html#a63ddcdaab24f722f0963fa2fbe0ae628',1,'realtime_stats.c']]], + ['stats_5fcomputer2_212',['stats_computer2',['../dc/d47/realtime__stats_8c.html#a34be233a9200ee2065f6b7b27e2d9a96',1,'realtime_stats.c']]], + ['subset_213',['subset',['../dc/de5/structsubset.html',1,'']]], + ['sudoku_214',['sudoku',['../dc/d18/structsudoku.html',1,'sudoku'],['../d5/df4/group__sudoku.html',1,'(Global Namespace)']]], + ['sudoku_5fsolver_2ec_215',['sudoku_solver.c',['../de/dac/sudoku__solver_8c.html',1,'']]], + ['sum_5fof_5fdivisors_216',['sum_of_divisors',['../df/d1a/problem__21_2sol1_8c.html#aacf4b7e708651d2164e86958f2c29c93',1,'sol1.c']]], + ['sum_5fof_5fprimes_217',['sum_of_primes',['../d0/d6d/problem__10_2sol1_8c.html#ae3d987cb2ad0ddb0c3caa4c2506a20e5',1,'sol1.c']]], + ['swap_218',['swap',['../d5/d4c/group__sorting.html#ga4b9708d87be7a409eff20e5e7e8b43c8',1,'merge_sort.c']]] ]; diff --git a/search/all_14.js b/search/all_14.js index cf65bf7a..ea3d91df 100644 --- a/search/all_14.js +++ b/search/all_14.js @@ -1,21 +1,21 @@ var searchData= [ - ['the_20algorithms_20_2d_20c_220',['The Algorithms - C',['../index.html',1,'']]], - ['t_221',['T',['../d5/d7e/struct_t.html',1,'']]], - ['test_222',['test',['../d7/d98/spirograph_8c.html#a708a4c1a4d0c4acc4c447310dd4db27f',1,'test(void): spirograph.c'],['../d6/d2e/cartesian__to__polar_8c.html#ae1a3968e7947464bee7714f6d43b7002',1,'test(): cartesian_to_polar.c'],['../df/d3b/binary__search_8c.html#ae1a3968e7947464bee7714f6d43b7002',1,'test(): binary_search.c'],['../d6/d7b/jump__search_8c.html#ae1a3968e7947464bee7714f6d43b7002',1,'test(): jump_search.c']]], - ['test1_223',['test1',['../dd/d8c/adaline__learning_8c.html#ab4ecb3accf5d9e0263087e7265bbe3a9',1,'test1(double eta): adaline_learning.c'],['../d2/df6/kohonen__som__topology_8c.html#a1440a7779ac56f47a3f355ce4a8c7da0',1,'test1(): kohonen_som_topology.c'],['../d0/d46/kohonen__som__trace_8c.html#a1440a7779ac56f47a3f355ce4a8c7da0',1,'test1(): kohonen_som_trace.c'],['../d7/d50/qr__eigen__values_8c.html#a1440a7779ac56f47a3f355ce4a8c7da0',1,'test1(): qr_eigen_values.c']]], - ['test2_224',['test2',['../dd/d8c/adaline__learning_8c.html#a05cc9a0acb524fde727a4d7b4a747ee6',1,'test2(double eta): adaline_learning.c'],['../d2/df6/kohonen__som__topology_8c.html#a0283886819c7c140a023582b7269e2d0',1,'test2(): kohonen_som_topology.c'],['../d0/d46/kohonen__som__trace_8c.html#a0283886819c7c140a023582b7269e2d0',1,'test2(): kohonen_som_trace.c'],['../d7/d50/qr__eigen__values_8c.html#a0283886819c7c140a023582b7269e2d0',1,'test2(): qr_eigen_values.c']]], - ['test3_225',['test3',['../dd/d8c/adaline__learning_8c.html#a3f37b9f073f7e57fd0b39d70718af1b1',1,'test3(double eta): adaline_learning.c'],['../d2/df6/kohonen__som__topology_8c.html#a6d0455dd5c30adda100e95f0423c786e',1,'test3(): kohonen_som_topology.c'],['../d0/d46/kohonen__som__trace_8c.html#a6d0455dd5c30adda100e95f0423c786e',1,'test3(): kohonen_som_trace.c']]], - ['test_5f2d_5fclasses_226',['test_2d_classes',['../d2/df6/kohonen__som__topology_8c.html#adb5ded007be1fd666fab9affe6764018',1,'kohonen_som_topology.c']]], - ['test_5f3d_5fclasses_227',['test_3d_classes',['../d0/d46/kohonen__som__trace_8c.html#a41ae16442e3e5b891a58d2e5932a2cd0',1,'kohonen_som_trace.c']]], - ['test_5f3d_5fclasses1_228',['test_3d_classes1',['../d2/df6/kohonen__som__topology_8c.html#ad9e25202bb8b481461f932668f249dbc',1,'kohonen_som_topology.c']]], - ['test_5f3d_5fclasses2_229',['test_3d_classes2',['../d2/df6/kohonen__som__topology_8c.html#a5bb02a8322d717ead1b11182c5f02a3a',1,'kohonen_som_topology.c']]], - ['test_5fc_5fatoi_230',['test_c_atoi',['../d7/dd8/c__atoi__str__to__integer_8c.html#a8c66c03637e48e375b80b5d7791e57be',1,'c_atoi_str_to_integer.c']]], - ['test_5fcircle_231',['test_circle',['../d0/d46/kohonen__som__trace_8c.html#a107f00650b8041f77767927073ddddb8',1,'kohonen_som_trace.c']]], - ['test_5ffunction_232',['test_function',['../dc/d47/realtime__stats_8c.html#aa54c915581fcc495489175a4386d59fd',1,'realtime_stats.c']]], - ['test_5flamniscate_233',['test_lamniscate',['../d0/d46/kohonen__som__trace_8c.html#aa2246f940155472084ee461f3685d614',1,'kohonen_som_trace.c']]], - ['threaded_5fbinary_5ftrees_2ec_234',['threaded_binary_trees.c',['../df/d3c/threaded__binary__trees_8c.html',1,'']]], - ['tnode_235',['tnode',['../d8/d7a/structtnode.html',1,'']]], - ['to_5fpolar_236',['to_polar',['../d6/d2e/cartesian__to__polar_8c.html#afb80d77f0c994240309ccddcc9525e70',1,'cartesian_to_polar.c']]], - ['trienode_237',['TrieNode',['../da/d9b/struct_trie_node.html',1,'']]] + ['the_20algorithms_20_2d_20c_219',['The Algorithms - C',['../index.html',1,'']]], + ['t_220',['T',['../d5/d7e/struct_t.html',1,'']]], + ['test_221',['test',['../d7/d98/spirograph_8c.html#a708a4c1a4d0c4acc4c447310dd4db27f',1,'test(void): spirograph.c'],['../d6/d2e/cartesian__to__polar_8c.html#ae1a3968e7947464bee7714f6d43b7002',1,'test(): cartesian_to_polar.c'],['../df/d3b/binary__search_8c.html#ae1a3968e7947464bee7714f6d43b7002',1,'test(): binary_search.c'],['../d6/d7b/jump__search_8c.html#ae1a3968e7947464bee7714f6d43b7002',1,'test(): jump_search.c']]], + ['test1_222',['test1',['../dd/d8c/adaline__learning_8c.html#ab4ecb3accf5d9e0263087e7265bbe3a9',1,'test1(double eta): adaline_learning.c'],['../d2/df6/kohonen__som__topology_8c.html#a1440a7779ac56f47a3f355ce4a8c7da0',1,'test1(): kohonen_som_topology.c'],['../d0/d46/kohonen__som__trace_8c.html#a1440a7779ac56f47a3f355ce4a8c7da0',1,'test1(): kohonen_som_trace.c'],['../d7/d50/qr__eigen__values_8c.html#a1440a7779ac56f47a3f355ce4a8c7da0',1,'test1(): qr_eigen_values.c']]], + ['test2_223',['test2',['../dd/d8c/adaline__learning_8c.html#a05cc9a0acb524fde727a4d7b4a747ee6',1,'test2(double eta): adaline_learning.c'],['../d2/df6/kohonen__som__topology_8c.html#a0283886819c7c140a023582b7269e2d0',1,'test2(): kohonen_som_topology.c'],['../d0/d46/kohonen__som__trace_8c.html#a0283886819c7c140a023582b7269e2d0',1,'test2(): kohonen_som_trace.c'],['../d7/d50/qr__eigen__values_8c.html#a0283886819c7c140a023582b7269e2d0',1,'test2(): qr_eigen_values.c']]], + ['test3_224',['test3',['../dd/d8c/adaline__learning_8c.html#a3f37b9f073f7e57fd0b39d70718af1b1',1,'test3(double eta): adaline_learning.c'],['../d2/df6/kohonen__som__topology_8c.html#a6d0455dd5c30adda100e95f0423c786e',1,'test3(): kohonen_som_topology.c'],['../d0/d46/kohonen__som__trace_8c.html#a6d0455dd5c30adda100e95f0423c786e',1,'test3(): kohonen_som_trace.c']]], + ['test_5f2d_5fclasses_225',['test_2d_classes',['../d2/df6/kohonen__som__topology_8c.html#adb5ded007be1fd666fab9affe6764018',1,'kohonen_som_topology.c']]], + ['test_5f3d_5fclasses_226',['test_3d_classes',['../d0/d46/kohonen__som__trace_8c.html#a41ae16442e3e5b891a58d2e5932a2cd0',1,'kohonen_som_trace.c']]], + ['test_5f3d_5fclasses1_227',['test_3d_classes1',['../d2/df6/kohonen__som__topology_8c.html#ad9e25202bb8b481461f932668f249dbc',1,'kohonen_som_topology.c']]], + ['test_5f3d_5fclasses2_228',['test_3d_classes2',['../d2/df6/kohonen__som__topology_8c.html#a5bb02a8322d717ead1b11182c5f02a3a',1,'kohonen_som_topology.c']]], + ['test_5fc_5fatoi_229',['test_c_atoi',['../d7/dd8/c__atoi__str__to__integer_8c.html#a8c66c03637e48e375b80b5d7791e57be',1,'c_atoi_str_to_integer.c']]], + ['test_5fcircle_230',['test_circle',['../d0/d46/kohonen__som__trace_8c.html#a107f00650b8041f77767927073ddddb8',1,'kohonen_som_trace.c']]], + ['test_5ffunction_231',['test_function',['../dc/d47/realtime__stats_8c.html#aa54c915581fcc495489175a4386d59fd',1,'realtime_stats.c']]], + ['test_5flamniscate_232',['test_lamniscate',['../d0/d46/kohonen__som__trace_8c.html#aa2246f940155472084ee461f3685d614',1,'kohonen_som_trace.c']]], + ['threaded_5fbinary_5ftrees_2ec_233',['threaded_binary_trees.c',['../df/d3c/threaded__binary__trees_8c.html',1,'']]], + ['tnode_234',['tnode',['../d8/d7a/structtnode.html',1,'']]], + ['to_5fpolar_235',['to_polar',['../d6/d2e/cartesian__to__polar_8c.html#afb80d77f0c994240309ccddcc9525e70',1,'cartesian_to_polar.c']]], + ['trienode_236',['TrieNode',['../da/d9b/struct_trie_node.html',1,'']]] ]; diff --git a/search/all_15.js b/search/all_15.js index f62c2b8e..a3d8d19c 100644 --- a/search/all_15.js +++ b/search/all_15.js @@ -1,4 +1,4 @@ var searchData= [ - ['union_5ffind_2ec_238',['union_find.c',['../df/df3/union__find_8c.html',1,'']]] + ['union_5ffind_2ec_237',['union_find.c',['../df/df3/union__find_8c.html',1,'']]] ]; diff --git a/search/all_16.js b/search/all_16.js index 56e176fe..0009bc1e 100644 --- a/search/all_16.js +++ b/search/all_16.js @@ -1,8 +1,8 @@ var searchData= [ - ['value_239',['value',['../dc/d77/struct__big__int.html#a273ee73fd755f2a99512cca5f0e09008',1,'_big_int']]], - ['vector_5fdot_240',['vector_dot',['../d4/d68/qr__decompose_8h.html#a3a584b79941a43d775f9d4ce446dbe05',1,'qr_decompose.h']]], - ['vector_5fmag_241',['vector_mag',['../d4/d68/qr__decompose_8h.html#abeec1f78a7a7e7251687e75340331212',1,'qr_decompose.h']]], - ['vector_5fproj_242',['vector_proj',['../d4/d68/qr__decompose_8h.html#a82b20e027437df768d7e994cf4cae29f',1,'qr_decompose.h']]], - ['vector_5fsub_243',['vector_sub',['../d4/d68/qr__decompose_8h.html#a6b6a0e75e75ff7919057dd275bb69145',1,'qr_decompose.h']]] + ['value_238',['value',['../dc/d77/struct__big__int.html#a273ee73fd755f2a99512cca5f0e09008',1,'_big_int']]], + ['vector_5fdot_239',['vector_dot',['../d4/d68/qr__decompose_8h.html#a3a584b79941a43d775f9d4ce446dbe05',1,'qr_decompose.h']]], + ['vector_5fmag_240',['vector_mag',['../d4/d68/qr__decompose_8h.html#abeec1f78a7a7e7251687e75340331212',1,'qr_decompose.h']]], + ['vector_5fproj_241',['vector_proj',['../d4/d68/qr__decompose_8h.html#a82b20e027437df768d7e994cf4cae29f',1,'qr_decompose.h']]], + ['vector_5fsub_242',['vector_sub',['../d4/d68/qr__decompose_8h.html#a6b6a0e75e75ff7919057dd275bb69145',1,'qr_decompose.h']]] ]; diff --git a/search/all_17.js b/search/all_17.js index b221470f..e6decde5 100644 --- a/search/all_17.js +++ b/search/all_17.js @@ -1,5 +1,5 @@ var searchData= [ - ['weights_244',['weights',['../d2/daa/structadaline.html#a32e58c03fd9258709eae6138ad0ec657',1,'adaline']]], - ['word_5fcount_5fword_245',['word_count_word',['../df/ddb/structword__count__word.html',1,'']]] + ['weights_243',['weights',['../d2/daa/structadaline.html#a32e58c03fd9258709eae6138ad0ec657',1,'adaline']]], + ['word_5fcount_5fword_244',['word_count_word',['../df/ddb/structword__count__word.html',1,'']]] ]; diff --git a/search/all_d.js b/search/all_d.js index 9c3f04c7..85d24357 100644 --- a/search/all_d.js +++ b/search/all_d.js @@ -8,21 +8,20 @@ var searchData= ['max_5fdeno_127',['MAX_DENO',['../d1/df9/problem__26_2sol1_8c.html#a619eec3220cebd7c5e455edbb14e9b12',1,'sol1.c']]], ['max_5fdigits_128',['MAX_DIGITS',['../d8/d32/problem__25_2sol1_8c.html#a001791a21d538b8b9176287ae60d9b61',1,'sol1.c']]], ['max_5fheap_129',['max_heap',['../d0/d8a/structmax__heap.html',1,'']]], - ['max_5fl_130',['MAX_L',['../d4/d83/problem__401_2sol1_8c.html#adf2a0717e3307419a9d7c52707f5631e',1,'sol1.c']]], - ['max_5flen_131',['MAX_LEN',['../d1/df9/problem__26_2sol1_8c.html#aabf4f709c8199e41cf279c77112345fe',1,'sol1.c']]], - ['max_5fn_132',['MAX_N',['../d7/ddb/problem__23_2sol1_8c.html#a337e545af040d754dc012b42523ee1ee',1,'MAX_N(): sol1.c'],['../d4/dbd/problem__23_2sol2_8c.html#a8c7ddb39906f281b801f2cd58d416c2b',1,'MAX_N(): sol2.c']]], - ['max_5fname_5flen_133',['MAX_NAME_LEN',['../dd/d8b/problem__22_2sol1_8c.html#afd709f201d7643c3909621f620ea648a',1,'sol1.c']]], - ['max_5fnames_134',['MAX_NAMES',['../dd/d8b/problem__22_2sol1_8c.html#a6cb9b08aacb61416795ee78bfceacd38',1,'sol1.c']]], - ['max_5fsize_135',['MAX_SIZE',['../df/df3/union__find_8c.html#a0592dba56693fad79136250c11e5a7fe',1,'union_find.c']]], - ['merge_136',['merge',['../d5/d4c/group__sorting.html#ga8dc3ec66cb3350313fdb34bfd1674729',1,'merge_sort.c']]], - ['merge_5fsort_137',['merge_sort',['../d5/d4c/group__sorting.html#gab99b8a397bdd0bf2903d66c22ba4ba43',1,'merge_sort.c']]], - ['merge_5fsort_2ec_138',['merge_sort.c',['../d2/d83/merge__sort_8c.html',1,'']]], - ['midpoint_5feuler_139',['midpoint_euler',['../d1/dc2/ode__midpoint__euler_8c.html#a148003d8b261d040c1c41e73b40af1dd',1,'ode_midpoint_euler.c']]], - ['midpoint_5feuler_5fstep_140',['midpoint_euler_step',['../d1/dc2/ode__midpoint__euler_8c.html#affe6cc2ab040b94a29e6c41782f72d51',1,'ode_midpoint_euler.c']]], - ['min_141',['min',['../d1/d6b/group__kohonen__2d.html#gac6afabdc09a49a433ee19d8a9486056d',1,'min(): kohonen_som_topology.c'],['../d0/dcb/group__kohonen__1d.html#gac6afabdc09a49a433ee19d8a9486056d',1,'min(): kohonen_som_trace.c'],['../d6/d7b/jump__search_8c.html#a8195a86b6d75b9a3939505e8bb50021e',1,'min(): jump_search.c']]], - ['min_5fheap_142',['min_heap',['../de/dce/structmin__heap.html',1,'']]], - ['mod_143',['MOD',['../d4/d83/problem__401_2sol1_8c.html#aca7d5718ab8c38506adb3bef2469b319',1,'sol1.c']]], - ['modified_5fbinary_5fsearch_2ec_144',['modified_binary_search.c',['../d3/d47/modified__binary__search_8c.html',1,'']]], - ['modifiedbinarysearch_145',['modifiedBinarySearch',['../d3/d47/modified__binary__search_8c.html#a7df9a198e30cded6229d79bef7591f8f',1,'modified_binary_search.c']]], - ['multiply_146',['multiply',['../d6/d3d/factorial__large__number_8c.html#ad398ddbd594ca69a5e6dfc894925341e',1,'factorial_large_number.c']]] + ['max_5flen_130',['MAX_LEN',['../d1/df9/problem__26_2sol1_8c.html#aabf4f709c8199e41cf279c77112345fe',1,'sol1.c']]], + ['max_5flength_131',['MAX_LENGTH',['../d4/d83/problem__401_2sol1_8c.html#a7a9a231e30b47bc0345749c8bd1e5077',1,'sol1.c']]], + ['max_5fname_5flen_132',['MAX_NAME_LEN',['../dd/d8b/problem__22_2sol1_8c.html#afd709f201d7643c3909621f620ea648a',1,'sol1.c']]], + ['max_5fnames_133',['MAX_NAMES',['../dd/d8b/problem__22_2sol1_8c.html#a6cb9b08aacb61416795ee78bfceacd38',1,'sol1.c']]], + ['max_5fsize_134',['MAX_SIZE',['../df/df3/union__find_8c.html#a0592dba56693fad79136250c11e5a7fe',1,'union_find.c']]], + ['merge_135',['merge',['../d5/d4c/group__sorting.html#ga8dc3ec66cb3350313fdb34bfd1674729',1,'merge_sort.c']]], + ['merge_5fsort_136',['merge_sort',['../d5/d4c/group__sorting.html#gab99b8a397bdd0bf2903d66c22ba4ba43',1,'merge_sort.c']]], + ['merge_5fsort_2ec_137',['merge_sort.c',['../d2/d83/merge__sort_8c.html',1,'']]], + ['midpoint_5feuler_138',['midpoint_euler',['../d1/dc2/ode__midpoint__euler_8c.html#a148003d8b261d040c1c41e73b40af1dd',1,'ode_midpoint_euler.c']]], + ['midpoint_5feuler_5fstep_139',['midpoint_euler_step',['../d1/dc2/ode__midpoint__euler_8c.html#affe6cc2ab040b94a29e6c41782f72d51',1,'ode_midpoint_euler.c']]], + ['min_140',['min',['../d1/d6b/group__kohonen__2d.html#gac6afabdc09a49a433ee19d8a9486056d',1,'min(): kohonen_som_topology.c'],['../d0/dcb/group__kohonen__1d.html#gac6afabdc09a49a433ee19d8a9486056d',1,'min(): kohonen_som_trace.c'],['../d6/d7b/jump__search_8c.html#a8195a86b6d75b9a3939505e8bb50021e',1,'min(): jump_search.c']]], + ['min_5fheap_141',['min_heap',['../de/dce/structmin__heap.html',1,'']]], + ['mod_5flimit_142',['MOD_LIMIT',['../d4/d83/problem__401_2sol1_8c.html#ade1bdf2529e3c58f53bfb4d844f3a9d3',1,'sol1.c']]], + ['modified_5fbinary_5fsearch_2ec_143',['modified_binary_search.c',['../d3/d47/modified__binary__search_8c.html',1,'']]], + ['modifiedbinarysearch_144',['modifiedBinarySearch',['../d3/d47/modified__binary__search_8c.html#a7df9a198e30cded6229d79bef7591f8f',1,'modified_binary_search.c']]], + ['multiply_145',['multiply',['../d6/d3d/factorial__large__number_8c.html#ad398ddbd594ca69a5e6dfc894925341e',1,'factorial_large_number.c']]] ]; diff --git a/search/all_e.js b/search/all_e.js index 1205c90a..6804627e 100644 --- a/search/all_e.js +++ b/search/all_e.js @@ -1,14 +1,14 @@ var searchData= [ - ['n_147',['N',['../dc/d18/structsudoku.html#a160365012280c3e10f1b31e914e8f129',1,'sudoku::N()'],['../db/d01/problem__13_2sol1_8c.html#a0240ac851181b84ac374872dc5434ee4',1,'N(): sol1.c']]], - ['n2_148',['N2',['../dc/d18/structsudoku.html#a0f01e2782e82306e6fab9a8578006f56',1,'sudoku::N2()'],['../db/d01/problem__13_2sol1_8c.html#acd864640121c7df2c19f61f7baa507e4',1,'N2(): sol1.c']]], - ['new_5fadaline_149',['new_adaline',['../da/d2a/group__adaline.html#gacd88962c5f6341e43cbc69b4a7d3485b',1,'adaline_learning.c']]], - ['new_5fnumber_150',['new_number',['../d6/d3d/factorial__large__number_8c.html#ad8101f58545bd891ae8b6e11caadd7eb',1,'factorial_large_number.c']]], - ['newton_5fraphson_5froot_2ec_151',['newton_raphson_root.c',['../dd/d08/newton__raphson__root_8c.html',1,'']]], - ['next_152',['next',['../d9/dd7/struct__cantor__set.html#a2f7f9f19125725d3e5673fdb4ac8cfb1',1,'_cantor_set']]], - ['next_5fdigit_153',['next_digit',['../dc/d77/struct__big__int.html#a187538b984c86d7cfdb13e297e7f3564',1,'_big_int']]], - ['node_154',['Node',['../db/d8b/struct_node.html',1,'Node'],['../d5/da1/structnode.html',1,'node'],['../df/d3c/threaded__binary__trees_8c.html#ad8ecdcce462dd8e170ae1f164935aaa6',1,'node(): threaded_binary_trees.c']]], - ['num_5fdigits_155',['num_digits',['../d3/d5a/struct__large__num.html#a3fd11c0b413bbabfb8737d4ae73e5aa0',1,'_large_num']]], - ['num_5fweights_156',['num_weights',['../d2/daa/structadaline.html#a53314e737a0a5ff4552a03bcc9dafbc1',1,'adaline']]], - ['number_5fof_5fpaths_157',['number_of_paths',['../d7/d91/problem__15_2sol1_8c.html#a4650d1d3897633d84253f93433f601d6',1,'sol1.c']]] + ['n_146',['N',['../dc/d18/structsudoku.html#a160365012280c3e10f1b31e914e8f129',1,'sudoku']]], + ['n2_147',['N2',['../dc/d18/structsudoku.html#a0f01e2782e82306e6fab9a8578006f56',1,'sudoku']]], + ['new_5fadaline_148',['new_adaline',['../da/d2a/group__adaline.html#gacd88962c5f6341e43cbc69b4a7d3485b',1,'adaline_learning.c']]], + ['new_5fnumber_149',['new_number',['../d6/d3d/factorial__large__number_8c.html#ad8101f58545bd891ae8b6e11caadd7eb',1,'factorial_large_number.c']]], + ['newton_5fraphson_5froot_2ec_150',['newton_raphson_root.c',['../dd/d08/newton__raphson__root_8c.html',1,'']]], + ['next_151',['next',['../d9/dd7/struct__cantor__set.html#a2f7f9f19125725d3e5673fdb4ac8cfb1',1,'_cantor_set']]], + ['next_5fdigit_152',['next_digit',['../dc/d77/struct__big__int.html#a187538b984c86d7cfdb13e297e7f3564',1,'_big_int']]], + ['node_153',['Node',['../db/d8b/struct_node.html',1,'Node'],['../d5/da1/structnode.html',1,'node'],['../df/d3c/threaded__binary__trees_8c.html#ad8ecdcce462dd8e170ae1f164935aaa6',1,'node(): threaded_binary_trees.c']]], + ['num_5fdigits_154',['num_digits',['../d3/d5a/struct__large__num.html#a3fd11c0b413bbabfb8737d4ae73e5aa0',1,'_large_num']]], + ['num_5fweights_155',['num_weights',['../d2/daa/structadaline.html#a53314e737a0a5ff4552a03bcc9dafbc1',1,'adaline']]], + ['number_5fof_5fpaths_156',['number_of_paths',['../d7/d91/problem__15_2sol1_8c.html#a4650d1d3897633d84253f93433f601d6',1,'sol1.c']]] ]; diff --git a/search/all_f.js b/search/all_f.js index 3cf70ee7..c8d58f7a 100644 --- a/search/all_f.js +++ b/search/all_f.js @@ -1,11 +1,11 @@ var searchData= [ - ['ode_5fforward_5feuler_2ec_158',['ode_forward_euler.c',['../d4/d07/ode__forward__euler_8c.html',1,'']]], - ['ode_5fmidpoint_5feuler_2ec_159',['ode_midpoint_euler.c',['../d1/dc2/ode__midpoint__euler_8c.html',1,'']]], - ['ode_5fsemi_5fimplicit_5feuler_2ec_160',['ode_semi_implicit_euler.c',['../d4/d99/ode__semi__implicit__euler_8c.html',1,'']]], - ['ok_161',['OK',['../d5/df4/group__sudoku.html#ga3a0ec150ac9d0cb6b28279d36d95d72f',1,'sudoku_solver.c']]], - ['okbox_162',['OKbox',['../d5/df4/group__sudoku.html#ga1cd43df3f4187845ce186042fe53e6f1',1,'sudoku_solver.c']]], - ['okcol_163',['OKcol',['../d5/df4/group__sudoku.html#ga6503128d4f5ce0a0826f72f73f9e0b2a',1,'sudoku_solver.c']]], - ['okrow_164',['OKrow',['../d5/df4/group__sudoku.html#ga85d25d3b40017436f264a103685e4c55',1,'sudoku_solver.c']]], - ['order_165',['order',['../d4/d07/ode__forward__euler_8c.html#a9ceb646336224ee890a269d0b4600d09',1,'order(): ode_forward_euler.c'],['../d1/dc2/ode__midpoint__euler_8c.html#a9ceb646336224ee890a269d0b4600d09',1,'order(): ode_midpoint_euler.c'],['../d4/d99/ode__semi__implicit__euler_8c.html#a9ceb646336224ee890a269d0b4600d09',1,'order(): ode_semi_implicit_euler.c']]] + ['ode_5fforward_5feuler_2ec_157',['ode_forward_euler.c',['../d4/d07/ode__forward__euler_8c.html',1,'']]], + ['ode_5fmidpoint_5feuler_2ec_158',['ode_midpoint_euler.c',['../d1/dc2/ode__midpoint__euler_8c.html',1,'']]], + ['ode_5fsemi_5fimplicit_5feuler_2ec_159',['ode_semi_implicit_euler.c',['../d4/d99/ode__semi__implicit__euler_8c.html',1,'']]], + ['ok_160',['OK',['../d5/df4/group__sudoku.html#ga3a0ec150ac9d0cb6b28279d36d95d72f',1,'sudoku_solver.c']]], + ['okbox_161',['OKbox',['../d5/df4/group__sudoku.html#ga1cd43df3f4187845ce186042fe53e6f1',1,'sudoku_solver.c']]], + ['okcol_162',['OKcol',['../d5/df4/group__sudoku.html#ga6503128d4f5ce0a0826f72f73f9e0b2a',1,'sudoku_solver.c']]], + ['okrow_163',['OKrow',['../d5/df4/group__sudoku.html#ga85d25d3b40017436f264a103685e4c55',1,'sudoku_solver.c']]], + ['order_164',['order',['../d4/d07/ode__forward__euler_8c.html#a9ceb646336224ee890a269d0b4600d09',1,'order(): ode_forward_euler.c'],['../d1/dc2/ode__midpoint__euler_8c.html#a9ceb646336224ee890a269d0b4600d09',1,'order(): ode_midpoint_euler.c'],['../d4/d99/ode__semi__implicit__euler_8c.html#a9ceb646336224ee890a269d0b4600d09',1,'order(): ode_semi_implicit_euler.c']]] ]; diff --git a/search/classes_0.js b/search/classes_0.js index e7e9222d..15a28ee3 100644 --- a/search/classes_0.js +++ b/search/classes_0.js @@ -1,6 +1,6 @@ var searchData= [ - ['_5fbig_5fint_246',['_big_int',['../dc/d77/struct__big__int.html',1,'']]], - ['_5fcantor_5fset_247',['_cantor_set',['../d9/dd7/struct__cantor__set.html',1,'']]], - ['_5flarge_5fnum_248',['_large_num',['../d3/d5a/struct__large__num.html',1,'']]] + ['_5fbig_5fint_245',['_big_int',['../dc/d77/struct__big__int.html',1,'']]], + ['_5fcantor_5fset_246',['_cantor_set',['../d9/dd7/struct__cantor__set.html',1,'']]], + ['_5flarge_5fnum_247',['_large_num',['../d3/d5a/struct__large__num.html',1,'']]] ]; diff --git a/search/classes_1.js b/search/classes_1.js index 221cd417..4ad1651d 100644 --- a/search/classes_1.js +++ b/search/classes_1.js @@ -1,5 +1,5 @@ var searchData= [ - ['adaline_249',['adaline',['../d2/daa/structadaline.html',1,'']]], - ['avlnode_250',['AVLnode',['../d2/d71/struct_a_v_lnode.html',1,'']]] + ['adaline_248',['adaline',['../d2/daa/structadaline.html',1,'']]], + ['avlnode_249',['AVLnode',['../d2/d71/struct_a_v_lnode.html',1,'']]] ]; diff --git a/search/classes_10.js b/search/classes_10.js index b5651d72..ff818fa9 100644 --- a/search/classes_10.js +++ b/search/classes_10.js @@ -1,4 +1,4 @@ var searchData= [ - ['word_5fcount_5fword_275',['word_count_word',['../df/ddb/structword__count__word.html',1,'']]] + ['word_5fcount_5fword_274',['word_count_word',['../df/ddb/structword__count__word.html',1,'']]] ]; diff --git a/search/classes_2.js b/search/classes_2.js index e42eba8e..5e68b72a 100644 --- a/search/classes_2.js +++ b/search/classes_2.js @@ -1,4 +1,4 @@ var searchData= [ - ['bstiterator_251',['BSTIterator',['../d4/d02/struct_b_s_t_iterator.html',1,'']]] + ['bstiterator_250',['BSTIterator',['../d4/d02/struct_b_s_t_iterator.html',1,'']]] ]; diff --git a/search/classes_3.js b/search/classes_3.js index 1f0dd2ae..1677f057 100644 --- a/search/classes_3.js +++ b/search/classes_3.js @@ -1,4 +1,4 @@ var searchData= [ - ['carray_252',['CArray',['../d4/d2d/struct_c_array.html',1,'']]] + ['carray_251',['CArray',['../d4/d2d/struct_c_array.html',1,'']]] ]; diff --git a/search/classes_4.js b/search/classes_4.js index 77368c95..8587c8a6 100644 --- a/search/classes_4.js +++ b/search/classes_4.js @@ -1,6 +1,6 @@ var searchData= [ - ['data_253',['data',['../df/dea/structdata.html',1,'']]], - ['dict_254',['Dict',['../d4/dfe/struct_dict.html',1,'']]], - ['dynamic_5farray_255',['dynamic_array',['../d6/d42/structdynamic__array.html',1,'']]] + ['data_252',['data',['../df/dea/structdata.html',1,'']]], + ['dict_253',['Dict',['../d4/dfe/struct_dict.html',1,'']]], + ['dynamic_5farray_254',['dynamic_array',['../d6/d42/structdynamic__array.html',1,'']]] ]; diff --git a/search/classes_5.js b/search/classes_5.js index d981ea25..08ddd760 100644 --- a/search/classes_5.js +++ b/search/classes_5.js @@ -1,5 +1,5 @@ var searchData= [ - ['edge_256',['Edge',['../d5/db4/struct_edge.html',1,'']]], - ['elem_257',['elem',['../d0/d6b/structelem.html',1,'']]] + ['edge_255',['Edge',['../d5/db4/struct_edge.html',1,'']]], + ['elem_256',['elem',['../d0/d6b/structelem.html',1,'']]] ]; diff --git a/search/classes_6.js b/search/classes_6.js index de9c115d..395bc858 100644 --- a/search/classes_6.js +++ b/search/classes_6.js @@ -1,5 +1,5 @@ var searchData= [ - ['graph_258',['Graph',['../d4/dd4/struct_graph.html',1,'']]], - ['graphrep_259',['GraphRep',['../d2/d6a/struct_graph_rep.html',1,'']]] + ['graph_257',['Graph',['../d4/dd4/struct_graph.html',1,'']]], + ['graphrep_258',['GraphRep',['../d2/d6a/struct_graph_rep.html',1,'']]] ]; diff --git a/search/classes_7.js b/search/classes_7.js index babbee58..89542ec1 100644 --- a/search/classes_7.js +++ b/search/classes_7.js @@ -1,4 +1,4 @@ var searchData= [ - ['hash_5fset_5ft_260',['hash_set_t',['../d0/df1/structhash__set__t.html',1,'']]] + ['hash_5fset_5ft_259',['hash_set_t',['../d0/df1/structhash__set__t.html',1,'']]] ]; diff --git a/search/classes_8.js b/search/classes_8.js index 51380f47..e5ac9025 100644 --- a/search/classes_8.js +++ b/search/classes_8.js @@ -1,4 +1,4 @@ var searchData= [ - ['kohonen_5farray_5f3d_261',['kohonen_array_3d',['../d8/db8/structkohonen__array__3d.html',1,'']]] + ['kohonen_5farray_5f3d_260',['kohonen_array_3d',['../d8/db8/structkohonen__array__3d.html',1,'']]] ]; diff --git a/search/classes_9.js b/search/classes_9.js index 9c22ae8d..ecaab602 100644 --- a/search/classes_9.js +++ b/search/classes_9.js @@ -1,4 +1,4 @@ var searchData= [ - ['l_262',['L',['../df/db3/struct_l.html',1,'']]] + ['l_261',['L',['../df/db3/struct_l.html',1,'']]] ]; diff --git a/search/classes_a.js b/search/classes_a.js index dda8ebfc..4ecf7842 100644 --- a/search/classes_a.js +++ b/search/classes_a.js @@ -1,5 +1,5 @@ var searchData= [ - ['max_5fheap_263',['max_heap',['../d0/d8a/structmax__heap.html',1,'']]], - ['min_5fheap_264',['min_heap',['../de/dce/structmin__heap.html',1,'']]] + ['max_5fheap_262',['max_heap',['../d0/d8a/structmax__heap.html',1,'']]], + ['min_5fheap_263',['min_heap',['../de/dce/structmin__heap.html',1,'']]] ]; diff --git a/search/classes_b.js b/search/classes_b.js index 36570d5e..e2f03ad7 100644 --- a/search/classes_b.js +++ b/search/classes_b.js @@ -1,4 +1,4 @@ var searchData= [ - ['node_265',['Node',['../db/d8b/struct_node.html',1,'Node'],['../d5/da1/structnode.html',1,'node']]] + ['node_264',['Node',['../db/d8b/struct_node.html',1,'Node'],['../d5/da1/structnode.html',1,'node']]] ]; diff --git a/search/classes_c.js b/search/classes_c.js index c941f3b0..d71cd37c 100644 --- a/search/classes_c.js +++ b/search/classes_c.js @@ -1,4 +1,4 @@ var searchData= [ - ['pid_266',['pid',['../d0/d43/structpid.html',1,'']]] + ['pid_265',['pid',['../d0/d43/structpid.html',1,'']]] ]; diff --git a/search/classes_d.js b/search/classes_d.js index e2884a01..df155ced 100644 --- a/search/classes_d.js +++ b/search/classes_d.js @@ -1,5 +1,5 @@ var searchData= [ - ['queue_267',['queue',['../d2/d36/structqueue.html',1,'']]], - ['queuerep_268',['QueueRep',['../d0/d10/struct_queue_rep.html',1,'']]] + ['queue_266',['queue',['../d2/d36/structqueue.html',1,'']]], + ['queuerep_267',['QueueRep',['../d0/d10/struct_queue_rep.html',1,'']]] ]; diff --git a/search/classes_e.js b/search/classes_e.js index 0365e243..be860e1e 100644 --- a/search/classes_e.js +++ b/search/classes_e.js @@ -1,6 +1,6 @@ var searchData= [ - ['stack_269',['Stack',['../dd/d10/struct_stack.html',1,'']]], - ['subset_270',['subset',['../dc/de5/structsubset.html',1,'']]], - ['sudoku_271',['sudoku',['../dc/d18/structsudoku.html',1,'']]] + ['stack_268',['Stack',['../dd/d10/struct_stack.html',1,'']]], + ['subset_269',['subset',['../dc/de5/structsubset.html',1,'']]], + ['sudoku_270',['sudoku',['../dc/d18/structsudoku.html',1,'']]] ]; diff --git a/search/classes_f.js b/search/classes_f.js index bec1cde3..34d9f497 100644 --- a/search/classes_f.js +++ b/search/classes_f.js @@ -1,6 +1,6 @@ var searchData= [ - ['t_272',['T',['../d5/d7e/struct_t.html',1,'']]], - ['tnode_273',['tnode',['../d8/d7a/structtnode.html',1,'']]], - ['trienode_274',['TrieNode',['../da/d9b/struct_trie_node.html',1,'']]] + ['t_271',['T',['../d5/d7e/struct_t.html',1,'']]], + ['tnode_272',['tnode',['../d8/d7a/structtnode.html',1,'']]], + ['trienode_273',['TrieNode',['../da/d9b/struct_trie_node.html',1,'']]] ]; diff --git a/search/defines_0.js b/search/defines_0.js index 501d902b..0d4f141b 100644 --- a/search/defines_0.js +++ b/search/defines_0.js @@ -1,4 +1,4 @@ var searchData= [ - ['_5fuse_5fmath_5fdefines_462',['_USE_MATH_DEFINES',['../d7/d98/spirograph_8c.html#a525335710b53cb064ca56b936120431e',1,'_USE_MATH_DEFINES(): spirograph.c'],['../d2/df6/kohonen__som__topology_8c.html#a525335710b53cb064ca56b936120431e',1,'_USE_MATH_DEFINES(): kohonen_som_topology.c'],['../d0/d46/kohonen__som__trace_8c.html#a525335710b53cb064ca56b936120431e',1,'_USE_MATH_DEFINES(): kohonen_som_trace.c'],['../d6/d2e/cartesian__to__polar_8c.html#a525335710b53cb064ca56b936120431e',1,'_USE_MATH_DEFINES(): cartesian_to_polar.c']]] + ['_5fuse_5fmath_5fdefines_460',['_USE_MATH_DEFINES',['../d7/d98/spirograph_8c.html#a525335710b53cb064ca56b936120431e',1,'_USE_MATH_DEFINES(): spirograph.c'],['../d2/df6/kohonen__som__topology_8c.html#a525335710b53cb064ca56b936120431e',1,'_USE_MATH_DEFINES(): kohonen_som_topology.c'],['../d0/d46/kohonen__som__trace_8c.html#a525335710b53cb064ca56b936120431e',1,'_USE_MATH_DEFINES(): kohonen_som_trace.c'],['../d6/d2e/cartesian__to__polar_8c.html#a525335710b53cb064ca56b936120431e',1,'_USE_MATH_DEFINES(): cartesian_to_polar.c']]] ]; diff --git a/search/defines_1.js b/search/defines_1.js index edebf3e0..3c0065a0 100644 --- a/search/defines_1.js +++ b/search/defines_1.js @@ -1,4 +1,4 @@ var searchData= [ - ['accuracy_463',['ACCURACY',['../da/d38/durand__kerner__roots_8c.html#af270a96662132d0385cb6b4637c5a689',1,'ACCURACY(): durand_kerner_roots.c'],['../dd/d08/newton__raphson__root_8c.html#af270a96662132d0385cb6b4637c5a689',1,'ACCURACY(): newton_raphson_root.c']]] + ['accuracy_461',['ACCURACY',['../da/d38/durand__kerner__roots_8c.html#af270a96662132d0385cb6b4637c5a689',1,'ACCURACY(): durand_kerner_roots.c'],['../dd/d08/newton__raphson__root_8c.html#af270a96662132d0385cb6b4637c5a689',1,'ACCURACY(): newton_raphson_root.c']]] ]; diff --git a/search/defines_2.js b/search/defines_2.js index 50da0254..14987fe5 100644 --- a/search/defines_2.js +++ b/search/defines_2.js @@ -1,4 +1,4 @@ var searchData= [ - ['epsilon_464',['EPSILON',['../d7/d50/qr__eigen__values_8c.html#a002b2f4894492820fe708b1b7e7c5e70',1,'qr_eigen_values.c']]] + ['epsilon_462',['EPSILON',['../d7/d50/qr__eigen__values_8c.html#a002b2f4894492820fe708b1b7e7c5e70',1,'qr_eigen_values.c']]] ]; diff --git a/search/defines_3.js b/search/defines_3.js index a76c6b99..b3b633a8 100644 --- a/search/defines_3.js +++ b/search/defines_3.js @@ -1,4 +1,4 @@ var searchData= [ - ['lims_465',['LIMS',['../d7/d50/qr__eigen__values_8c.html#aee57a411f07599034f5ceb8cc7d65b40',1,'qr_eigen_values.c']]] + ['lims_463',['LIMS',['../d7/d50/qr__eigen__values_8c.html#aee57a411f07599034f5ceb8cc7d65b40',1,'qr_eigen_values.c']]] ]; diff --git a/search/defines_4.js b/search/defines_4.js index dc9f20e7..05f253a0 100644 --- a/search/defines_4.js +++ b/search/defines_4.js @@ -1,12 +1,12 @@ var searchData= [ - ['max_5fdeno_466',['MAX_DENO',['../d1/df9/problem__26_2sol1_8c.html#a619eec3220cebd7c5e455edbb14e9b12',1,'sol1.c']]], - ['max_5fdigits_467',['MAX_DIGITS',['../d8/d32/problem__25_2sol1_8c.html#a001791a21d538b8b9176287ae60d9b61',1,'sol1.c']]], - ['max_5fl_468',['MAX_L',['../d4/d83/problem__401_2sol1_8c.html#adf2a0717e3307419a9d7c52707f5631e',1,'sol1.c']]], - ['max_5flen_469',['MAX_LEN',['../d1/df9/problem__26_2sol1_8c.html#aabf4f709c8199e41cf279c77112345fe',1,'sol1.c']]], - ['max_5fname_5flen_470',['MAX_NAME_LEN',['../dd/d8b/problem__22_2sol1_8c.html#afd709f201d7643c3909621f620ea648a',1,'sol1.c']]], - ['max_5fnames_471',['MAX_NAMES',['../dd/d8b/problem__22_2sol1_8c.html#a6cb9b08aacb61416795ee78bfceacd38',1,'sol1.c']]], - ['max_5fsize_472',['MAX_SIZE',['../df/df3/union__find_8c.html#a0592dba56693fad79136250c11e5a7fe',1,'union_find.c']]], - ['min_473',['min',['../d6/d7b/jump__search_8c.html#a8195a86b6d75b9a3939505e8bb50021e',1,'jump_search.c']]], - ['mod_474',['MOD',['../d4/d83/problem__401_2sol1_8c.html#aca7d5718ab8c38506adb3bef2469b319',1,'sol1.c']]] + ['max_5fdeno_464',['MAX_DENO',['../d1/df9/problem__26_2sol1_8c.html#a619eec3220cebd7c5e455edbb14e9b12',1,'sol1.c']]], + ['max_5fdigits_465',['MAX_DIGITS',['../d8/d32/problem__25_2sol1_8c.html#a001791a21d538b8b9176287ae60d9b61',1,'sol1.c']]], + ['max_5flen_466',['MAX_LEN',['../d1/df9/problem__26_2sol1_8c.html#aabf4f709c8199e41cf279c77112345fe',1,'sol1.c']]], + ['max_5flength_467',['MAX_LENGTH',['../d4/d83/problem__401_2sol1_8c.html#a7a9a231e30b47bc0345749c8bd1e5077',1,'sol1.c']]], + ['max_5fname_5flen_468',['MAX_NAME_LEN',['../dd/d8b/problem__22_2sol1_8c.html#afd709f201d7643c3909621f620ea648a',1,'sol1.c']]], + ['max_5fnames_469',['MAX_NAMES',['../dd/d8b/problem__22_2sol1_8c.html#a6cb9b08aacb61416795ee78bfceacd38',1,'sol1.c']]], + ['max_5fsize_470',['MAX_SIZE',['../df/df3/union__find_8c.html#a0592dba56693fad79136250c11e5a7fe',1,'union_find.c']]], + ['min_471',['min',['../d6/d7b/jump__search_8c.html#a8195a86b6d75b9a3939505e8bb50021e',1,'jump_search.c']]], + ['mod_5flimit_472',['MOD_LIMIT',['../d4/d83/problem__401_2sol1_8c.html#ade1bdf2529e3c58f53bfb4d844f3a9d3',1,'sol1.c']]] ]; diff --git a/search/defines_5.js b/search/defines_5.js index 315967bd..d9e44969 100644 --- a/search/defines_5.js +++ b/search/defines_5.js @@ -1,5 +1,4 @@ var searchData= [ - ['n_475',['N',['../db/d01/problem__13_2sol1_8c.html#a0240ac851181b84ac374872dc5434ee4',1,'sol1.c']]], - ['n2_476',['N2',['../db/d01/problem__13_2sol1_8c.html#acd864640121c7df2c19f61f7baa507e4',1,'sol1.c']]] + ['order_473',['order',['../d4/d07/ode__forward__euler_8c.html#a9ceb646336224ee890a269d0b4600d09',1,'order(): ode_forward_euler.c'],['../d1/dc2/ode__midpoint__euler_8c.html#a9ceb646336224ee890a269d0b4600d09',1,'order(): ode_midpoint_euler.c'],['../d4/d99/ode__semi__implicit__euler_8c.html#a9ceb646336224ee890a269d0b4600d09',1,'order(): ode_semi_implicit_euler.c']]] ]; diff --git a/search/files_0.js b/search/files_0.js index 09e98251..dc6589bf 100644 --- a/search/files_0.js +++ b/search/files_0.js @@ -1,4 +1,4 @@ var searchData= [ - ['adaline_5flearning_2ec_276',['adaline_learning.c',['../dd/d8c/adaline__learning_8c.html',1,'']]] + ['adaline_5flearning_2ec_275',['adaline_learning.c',['../dd/d8c/adaline__learning_8c.html',1,'']]] ]; diff --git a/search/files_1.js b/search/files_1.js index ad14a97f..2e784644 100644 --- a/search/files_1.js +++ b/search/files_1.js @@ -1,5 +1,5 @@ var searchData= [ - ['bead_5fsort_2ec_277',['bead_sort.c',['../d2/da8/bead__sort_8c.html',1,'']]], - ['binary_5fsearch_2ec_278',['binary_search.c',['../df/d3b/binary__search_8c.html',1,'']]] + ['bead_5fsort_2ec_276',['bead_sort.c',['../d2/da8/bead__sort_8c.html',1,'']]], + ['binary_5fsearch_2ec_277',['binary_search.c',['../df/d3b/binary__search_8c.html',1,'']]] ]; diff --git a/search/files_10.js b/search/files_10.js index 6e10fd92..d723d5a4 100644 --- a/search/files_10.js +++ b/search/files_10.js @@ -1,4 +1,4 @@ var searchData= [ - ['union_5ffind_2ec_311',['union_find.c',['../df/df3/union__find_8c.html',1,'']]] + ['union_5ffind_2ec_310',['union_find.c',['../df/df3/union__find_8c.html',1,'']]] ]; diff --git a/search/files_2.js b/search/files_2.js index a2a980a7..229137ef 100644 --- a/search/files_2.js +++ b/search/files_2.js @@ -1,7 +1,7 @@ var searchData= [ - ['c_5fatoi_5fstr_5fto_5finteger_2ec_279',['c_atoi_str_to_integer.c',['../d7/dd8/c__atoi__str__to__integer_8c.html',1,'']]], - ['cantor_5fset_2ec_280',['cantor_set.c',['../dc/d80/cantor__set_8c.html',1,'']]], - ['cartesian_5fto_5fpolar_2ec_281',['cartesian_to_polar.c',['../d6/d2e/cartesian__to__polar_8c.html',1,'']]], - ['collatz_2ec_282',['collatz.c',['../dc/d80/collatz_8c.html',1,'']]] + ['c_5fatoi_5fstr_5fto_5finteger_2ec_278',['c_atoi_str_to_integer.c',['../d7/dd8/c__atoi__str__to__integer_8c.html',1,'']]], + ['cantor_5fset_2ec_279',['cantor_set.c',['../dc/d80/cantor__set_8c.html',1,'']]], + ['cartesian_5fto_5fpolar_2ec_280',['cartesian_to_polar.c',['../d6/d2e/cartesian__to__polar_8c.html',1,'']]], + ['collatz_2ec_281',['collatz.c',['../dc/d80/collatz_8c.html',1,'']]] ]; diff --git a/search/files_3.js b/search/files_3.js index 1cf707fe..e6f91b8f 100644 --- a/search/files_3.js +++ b/search/files_3.js @@ -1,4 +1,4 @@ var searchData= [ - ['durand_5fkerner_5froots_2ec_283',['durand_kerner_roots.c',['../da/d38/durand__kerner__roots_8c.html',1,'']]] + ['durand_5fkerner_5froots_2ec_282',['durand_kerner_roots.c',['../da/d38/durand__kerner__roots_8c.html',1,'']]] ]; diff --git a/search/files_4.js b/search/files_4.js index f4db315f..a42123c3 100644 --- a/search/files_4.js +++ b/search/files_4.js @@ -1,5 +1,5 @@ var searchData= [ - ['factorial_5flarge_5fnumber_2ec_284',['factorial_large_number.c',['../d6/d3d/factorial__large__number_8c.html',1,'']]], - ['fibonacci_5ffast_2ec_285',['fibonacci_fast.c',['../d4/d99/fibonacci__fast_8c.html',1,'']]] + ['factorial_5flarge_5fnumber_2ec_283',['factorial_large_number.c',['../d6/d3d/factorial__large__number_8c.html',1,'']]], + ['fibonacci_5ffast_2ec_284',['fibonacci_fast.c',['../d4/d99/fibonacci__fast_8c.html',1,'']]] ]; diff --git a/search/files_5.js b/search/files_5.js index ed45887a..bf55edaf 100644 --- a/search/files_5.js +++ b/search/files_5.js @@ -1,4 +1,4 @@ var searchData= [ - ['jump_5fsearch_2ec_286',['jump_search.c',['../d6/d7b/jump__search_8c.html',1,'']]] + ['jump_5fsearch_2ec_285',['jump_search.c',['../d6/d7b/jump__search_8c.html',1,'']]] ]; diff --git a/search/files_6.js b/search/files_6.js index f9ce437e..40cc4769 100644 --- a/search/files_6.js +++ b/search/files_6.js @@ -1,5 +1,5 @@ var searchData= [ - ['kohonen_5fsom_5ftopology_2ec_287',['kohonen_som_topology.c',['../d2/df6/kohonen__som__topology_8c.html',1,'']]], - ['kohonen_5fsom_5ftrace_2ec_288',['kohonen_som_trace.c',['../d0/d46/kohonen__som__trace_8c.html',1,'']]] + ['kohonen_5fsom_5ftopology_2ec_286',['kohonen_som_topology.c',['../d2/df6/kohonen__som__topology_8c.html',1,'']]], + ['kohonen_5fsom_5ftrace_2ec_287',['kohonen_som_trace.c',['../d0/d46/kohonen__som__trace_8c.html',1,'']]] ]; diff --git a/search/files_7.js b/search/files_7.js index f6e16df5..742d6b7f 100644 --- a/search/files_7.js +++ b/search/files_7.js @@ -1,4 +1,4 @@ var searchData= [ - ['lu_5fdecompose_2ec_289',['lu_decompose.c',['../dc/d2e/lu__decompose_8c.html',1,'']]] + ['lu_5fdecompose_2ec_288',['lu_decompose.c',['../dc/d2e/lu__decompose_8c.html',1,'']]] ]; diff --git a/search/files_8.js b/search/files_8.js index d8e2c8c5..c1695832 100644 --- a/search/files_8.js +++ b/search/files_8.js @@ -1,5 +1,5 @@ var searchData= [ - ['merge_5fsort_2ec_290',['merge_sort.c',['../d2/d83/merge__sort_8c.html',1,'']]], - ['modified_5fbinary_5fsearch_2ec_291',['modified_binary_search.c',['../d3/d47/modified__binary__search_8c.html',1,'']]] + ['merge_5fsort_2ec_289',['merge_sort.c',['../d2/d83/merge__sort_8c.html',1,'']]], + ['modified_5fbinary_5fsearch_2ec_290',['modified_binary_search.c',['../d3/d47/modified__binary__search_8c.html',1,'']]] ]; diff --git a/search/files_9.js b/search/files_9.js index 427a7de8..3487d7db 100644 --- a/search/files_9.js +++ b/search/files_9.js @@ -1,4 +1,4 @@ var searchData= [ - ['newton_5fraphson_5froot_2ec_292',['newton_raphson_root.c',['../dd/d08/newton__raphson__root_8c.html',1,'']]] + ['newton_5fraphson_5froot_2ec_291',['newton_raphson_root.c',['../dd/d08/newton__raphson__root_8c.html',1,'']]] ]; diff --git a/search/files_a.js b/search/files_a.js index 1c7b8917..7f3e311a 100644 --- a/search/files_a.js +++ b/search/files_a.js @@ -1,6 +1,6 @@ var searchData= [ - ['ode_5fforward_5feuler_2ec_293',['ode_forward_euler.c',['../d4/d07/ode__forward__euler_8c.html',1,'']]], - ['ode_5fmidpoint_5feuler_2ec_294',['ode_midpoint_euler.c',['../d1/dc2/ode__midpoint__euler_8c.html',1,'']]], - ['ode_5fsemi_5fimplicit_5feuler_2ec_295',['ode_semi_implicit_euler.c',['../d4/d99/ode__semi__implicit__euler_8c.html',1,'']]] + ['ode_5fforward_5feuler_2ec_292',['ode_forward_euler.c',['../d4/d07/ode__forward__euler_8c.html',1,'']]], + ['ode_5fmidpoint_5feuler_2ec_293',['ode_midpoint_euler.c',['../d1/dc2/ode__midpoint__euler_8c.html',1,'']]], + ['ode_5fsemi_5fimplicit_5feuler_2ec_294',['ode_semi_implicit_euler.c',['../d4/d99/ode__semi__implicit__euler_8c.html',1,'']]] ]; diff --git a/search/files_b.js b/search/files_b.js index 42d5a60c..85177318 100644 --- a/search/files_b.js +++ b/search/files_b.js @@ -1,4 +1,4 @@ var searchData= [ - ['palindrome_2ec_296',['palindrome.c',['../df/d16/palindrome_8c.html',1,'']]] + ['palindrome_2ec_295',['palindrome.c',['../df/d16/palindrome_8c.html',1,'']]] ]; diff --git a/search/files_c.js b/search/files_c.js index 1cffc230..f3145bcb 100644 --- a/search/files_c.js +++ b/search/files_c.js @@ -1,6 +1,6 @@ var searchData= [ - ['qr_5fdecompose_2eh_297',['qr_decompose.h',['../d4/d68/qr__decompose_8h.html',1,'']]], - ['qr_5fdecomposition_2ec_298',['qr_decomposition.c',['../d5/d23/qr__decomposition_8c.html',1,'']]], - ['qr_5feigen_5fvalues_2ec_299',['qr_eigen_values.c',['../d7/d50/qr__eigen__values_8c.html',1,'']]] + ['qr_5fdecompose_2eh_296',['qr_decompose.h',['../d4/d68/qr__decompose_8h.html',1,'']]], + ['qr_5fdecomposition_2ec_297',['qr_decomposition.c',['../d5/d23/qr__decomposition_8c.html',1,'']]], + ['qr_5feigen_5fvalues_2ec_298',['qr_eigen_values.c',['../d7/d50/qr__eigen__values_8c.html',1,'']]] ]; diff --git a/search/files_d.js b/search/files_d.js index 4e2735cb..f75ed8eb 100644 --- a/search/files_d.js +++ b/search/files_d.js @@ -1,4 +1,4 @@ var searchData= [ - ['realtime_5fstats_2ec_300',['realtime_stats.c',['../dc/d47/realtime__stats_8c.html',1,'']]] + ['realtime_5fstats_2ec_299',['realtime_stats.c',['../dc/d47/realtime__stats_8c.html',1,'']]] ]; diff --git a/search/files_e.js b/search/files_e.js index dca1bdb9..f11d7188 100644 --- a/search/files_e.js +++ b/search/files_e.js @@ -1,12 +1,12 @@ var searchData= [ - ['shell_5fsort2_2ec_301',['shell_sort2.c',['../d6/ded/shell__sort2_8c.html',1,'']]], - ['so1_2ec_302',['so1.c',['../d0/d7f/so1_8c.html',1,'']]], - ['sol_2ec_303',['sol.c',['../d0/d6c/problem__4_2sol_8c.html',1,'(Global Namespace)'],['../df/de7/problem__5_2sol_8c.html',1,'(Global Namespace)'],['../d4/d7b/problem__6_2sol_8c.html',1,'(Global Namespace)'],['../d1/d2f/problem__7_2sol_8c.html',1,'(Global Namespace)']]], - ['sol1_2ec_304',['sol1.c',['../da/d35/problem__1_2sol1_8c.html',1,'(Global Namespace)'],['../d0/d6d/problem__10_2sol1_8c.html',1,'(Global Namespace)'],['../d7/d1f/problem__12_2sol1_8c.html',1,'(Global Namespace)'],['../db/d01/problem__13_2sol1_8c.html',1,'(Global Namespace)'],['../d4/dea/problem__14_2sol1_8c.html',1,'(Global Namespace)'],['../d7/d91/problem__15_2sol1_8c.html',1,'(Global Namespace)'],['../d6/d88/problem__16_2sol1_8c.html',1,'(Global Namespace)'],['../dd/df0/problem__19_2sol1_8c.html',1,'(Global Namespace)'],['../db/d80/problem__20_2sol1_8c.html',1,'(Global Namespace)'],['../df/d1a/problem__21_2sol1_8c.html',1,'(Global Namespace)'],['../dd/d8b/problem__22_2sol1_8c.html',1,'(Global Namespace)'],['../d7/ddb/problem__23_2sol1_8c.html',1,'(Global Namespace)'],['../d8/d32/problem__25_2sol1_8c.html',1,'(Global Namespace)'],['../d1/df9/problem__26_2sol1_8c.html',1,'(Global Namespace)'],['../d7/dd3/problem__3_2sol1_8c.html',1,'(Global Namespace)'],['../d4/d83/problem__401_2sol1_8c.html',1,'(Global Namespace)'],['../dc/d63/problem__8_2sol1_8c.html',1,'(Global Namespace)'],['../df/da5/problem__9_2sol1_8c.html',1,'(Global Namespace)']]], - ['sol2_2ec_305',['sol2.c',['../d2/dae/problem__1_2sol2_8c.html',1,'(Global Namespace)'],['../d9/da7/problem__10_2sol2_8c.html',1,'(Global Namespace)'],['../d4/dbd/problem__23_2sol2_8c.html',1,'(Global Namespace)'],['../d2/dbc/problem__3_2sol2_8c.html',1,'(Global Namespace)'],['../d2/d93/problem__8_2sol2_8c.html',1,'(Global Namespace)'],['../d8/de0/problem__9_2sol2_8c.html',1,'(Global Namespace)']]], - ['sol3_2ec_306',['sol3.c',['../d6/de3/sol3_8c.html',1,'']]], - ['sol4_2ec_307',['sol4.c',['../d6/d1b/sol4_8c.html',1,'']]], - ['spirograph_2ec_308',['spirograph.c',['../d7/d98/spirograph_8c.html',1,'']]], - ['sudoku_5fsolver_2ec_309',['sudoku_solver.c',['../de/dac/sudoku__solver_8c.html',1,'']]] + ['shell_5fsort2_2ec_300',['shell_sort2.c',['../d6/ded/shell__sort2_8c.html',1,'']]], + ['so1_2ec_301',['so1.c',['../d0/d7f/so1_8c.html',1,'']]], + ['sol_2ec_302',['sol.c',['../d0/d6c/problem__4_2sol_8c.html',1,'(Global Namespace)'],['../df/de7/problem__5_2sol_8c.html',1,'(Global Namespace)'],['../d4/d7b/problem__6_2sol_8c.html',1,'(Global Namespace)'],['../d1/d2f/problem__7_2sol_8c.html',1,'(Global Namespace)']]], + ['sol1_2ec_303',['sol1.c',['../da/d35/problem__1_2sol1_8c.html',1,'(Global Namespace)'],['../d0/d6d/problem__10_2sol1_8c.html',1,'(Global Namespace)'],['../d7/d1f/problem__12_2sol1_8c.html',1,'(Global Namespace)'],['../db/d01/problem__13_2sol1_8c.html',1,'(Global Namespace)'],['../d4/dea/problem__14_2sol1_8c.html',1,'(Global Namespace)'],['../d7/d91/problem__15_2sol1_8c.html',1,'(Global Namespace)'],['../d6/d88/problem__16_2sol1_8c.html',1,'(Global Namespace)'],['../dd/df0/problem__19_2sol1_8c.html',1,'(Global Namespace)'],['../db/d80/problem__20_2sol1_8c.html',1,'(Global Namespace)'],['../df/d1a/problem__21_2sol1_8c.html',1,'(Global Namespace)'],['../dd/d8b/problem__22_2sol1_8c.html',1,'(Global Namespace)'],['../d7/ddb/problem__23_2sol1_8c.html',1,'(Global Namespace)'],['../d8/d32/problem__25_2sol1_8c.html',1,'(Global Namespace)'],['../d1/df9/problem__26_2sol1_8c.html',1,'(Global Namespace)'],['../d7/dd3/problem__3_2sol1_8c.html',1,'(Global Namespace)'],['../d4/d83/problem__401_2sol1_8c.html',1,'(Global Namespace)'],['../dc/d63/problem__8_2sol1_8c.html',1,'(Global Namespace)'],['../df/da5/problem__9_2sol1_8c.html',1,'(Global Namespace)']]], + ['sol2_2ec_304',['sol2.c',['../d2/dae/problem__1_2sol2_8c.html',1,'(Global Namespace)'],['../d9/da7/problem__10_2sol2_8c.html',1,'(Global Namespace)'],['../d4/dbd/problem__23_2sol2_8c.html',1,'(Global Namespace)'],['../d2/dbc/problem__3_2sol2_8c.html',1,'(Global Namespace)'],['../d2/d93/problem__8_2sol2_8c.html',1,'(Global Namespace)'],['../d8/de0/problem__9_2sol2_8c.html',1,'(Global Namespace)']]], + ['sol3_2ec_305',['sol3.c',['../d6/de3/sol3_8c.html',1,'']]], + ['sol4_2ec_306',['sol4.c',['../d6/d1b/sol4_8c.html',1,'']]], + ['spirograph_2ec_307',['spirograph.c',['../d7/d98/spirograph_8c.html',1,'']]], + ['sudoku_5fsolver_2ec_308',['sudoku_solver.c',['../de/dac/sudoku__solver_8c.html',1,'']]] ]; diff --git a/search/files_f.js b/search/files_f.js index 1ab2c588..6062a6d5 100644 --- a/search/files_f.js +++ b/search/files_f.js @@ -1,4 +1,4 @@ var searchData= [ - ['threaded_5fbinary_5ftrees_2ec_310',['threaded_binary_trees.c',['../df/d3c/threaded__binary__trees_8c.html',1,'']]] + ['threaded_5fbinary_5ftrees_2ec_309',['threaded_binary_trees.c',['../df/d3c/threaded__binary__trees_8c.html',1,'']]] ]; diff --git a/search/functions_0.js b/search/functions_0.js index f468e084..fe056bf6 100644 --- a/search/functions_0.js +++ b/search/functions_0.js @@ -1,4 +1,4 @@ var searchData= [ - ['_5frandom_312',['_random',['../d1/d6b/group__kohonen__2d.html#gaf5ce14f026d6d231bef29161bac2b485',1,'_random(double a, double b): kohonen_som_topology.c'],['../d0/dcb/group__kohonen__1d.html#gaf5ce14f026d6d231bef29161bac2b485',1,'_random(double a, double b): kohonen_som_trace.c']]] + ['_5frandom_311',['_random',['../d1/d6b/group__kohonen__2d.html#gaf5ce14f026d6d231bef29161bac2b485',1,'_random(double a, double b): kohonen_som_topology.c'],['../d0/dcb/group__kohonen__1d.html#gaf5ce14f026d6d231bef29161bac2b485',1,'_random(double a, double b): kohonen_som_trace.c']]] ]; diff --git a/search/functions_1.js b/search/functions_1.js index 4eae1178..24f5fcbf 100644 --- a/search/functions_1.js +++ b/search/functions_1.js @@ -1,10 +1,10 @@ var searchData= [ - ['adaline_5factivation_313',['adaline_activation',['../da/d2a/group__adaline.html#ga43576566b020c4157d4fb28f0dd45cfa',1,'adaline_learning.c']]], - ['adaline_5ffit_314',['adaline_fit',['../da/d2a/group__adaline.html#gaa52120912e32d2893fe1c6d78da5befd',1,'adaline_learning.c']]], - ['adaline_5ffit_5fsample_315',['adaline_fit_sample',['../da/d2a/group__adaline.html#ga20d3642e0a87f36fdb7bf91b023cd166',1,'adaline_learning.c']]], - ['adaline_5fget_5fweights_5fstr_316',['adaline_get_weights_str',['../da/d2a/group__adaline.html#ga251695a79baa885cafdcf6d8ed4ac120',1,'adaline_learning.c']]], - ['adaline_5fpredict_317',['adaline_predict',['../da/d2a/group__adaline.html#gac70b578aee679005fd336073969c3d94',1,'adaline_learning.c']]], - ['add_5fdigit_318',['add_digit',['../d6/d3d/factorial__large__number_8c.html#af2869d36c22a2b8f93d3166a84e124b3',1,'add_digit(large_num *num, unsigned int value): factorial_large_number.c'],['../db/d80/problem__20_2sol1_8c.html#afc373c28da6b17636528edcc97fb5f86',1,'add_digit(big_int *digit, char value): sol1.c']]], - ['add_5fnumbers_319',['add_numbers',['../db/d01/problem__13_2sol1_8c.html#ad51742ca5a5c99e860bdf30299163bf2',1,'add_numbers(uint8_t *a, uint8_t *b, uint8_t N): sol1.c'],['../d8/d32/problem__25_2sol1_8c.html#af9729befaffc1aab9ac9fedc4706e66c',1,'add_numbers(unsigned char *a, unsigned char *b, unsigned char *c, int N): sol1.c']]] + ['adaline_5factivation_312',['adaline_activation',['../da/d2a/group__adaline.html#ga43576566b020c4157d4fb28f0dd45cfa',1,'adaline_learning.c']]], + ['adaline_5ffit_313',['adaline_fit',['../da/d2a/group__adaline.html#gaa52120912e32d2893fe1c6d78da5befd',1,'adaline_learning.c']]], + ['adaline_5ffit_5fsample_314',['adaline_fit_sample',['../da/d2a/group__adaline.html#ga20d3642e0a87f36fdb7bf91b023cd166',1,'adaline_learning.c']]], + ['adaline_5fget_5fweights_5fstr_315',['adaline_get_weights_str',['../da/d2a/group__adaline.html#ga251695a79baa885cafdcf6d8ed4ac120',1,'adaline_learning.c']]], + ['adaline_5fpredict_316',['adaline_predict',['../da/d2a/group__adaline.html#gac70b578aee679005fd336073969c3d94',1,'adaline_learning.c']]], + ['add_5fdigit_317',['add_digit',['../d6/d3d/factorial__large__number_8c.html#af2869d36c22a2b8f93d3166a84e124b3',1,'add_digit(large_num *num, unsigned int value): factorial_large_number.c'],['../db/d80/problem__20_2sol1_8c.html#afc373c28da6b17636528edcc97fb5f86',1,'add_digit(big_int *digit, char value): sol1.c']]], + ['add_5fnumbers_318',['add_numbers',['../db/d01/problem__13_2sol1_8c.html#ad51742ca5a5c99e860bdf30299163bf2',1,'add_numbers(uint8_t *a, uint8_t *b, uint8_t N): sol1.c'],['../d8/d32/problem__25_2sol1_8c.html#af9729befaffc1aab9ac9fedc4706e66c',1,'add_numbers(unsigned char *a, unsigned char *b, unsigned char *c, int N): sol1.c']]] ]; diff --git a/search/functions_10.js b/search/functions_10.js index be95bd71..922f0faf 100644 --- a/search/functions_10.js +++ b/search/functions_10.js @@ -1,4 +1,4 @@ var searchData= [ - ['qr_5fdecompose_400',['qr_decompose',['../d4/d68/qr__decompose_8h.html#a45c7640d9d22c89c11beb1f567843c56',1,'qr_decompose.h']]] + ['qr_5fdecompose_399',['qr_decompose',['../d4/d68/qr__decompose_8h.html#a45c7640d9d22c89c11beb1f567843c56',1,'qr_decompose.h']]] ]; diff --git a/search/functions_11.js b/search/functions_11.js index a88107ee..7efd610c 100644 --- a/search/functions_11.js +++ b/search/functions_11.js @@ -1,4 +1,4 @@ var searchData= [ - ['remove_5fdigits_401',['remove_digits',['../db/d80/problem__20_2sol1_8c.html#a54a02c4b963fdb16f24959e0137763f1',1,'sol1.c']]] + ['remove_5fdigits_400',['remove_digits',['../db/d80/problem__20_2sol1_8c.html#a54a02c4b963fdb16f24959e0137763f1',1,'sol1.c']]] ]; diff --git a/search/functions_12.js b/search/functions_12.js index 9bc54f5e..ce22746e 100644 --- a/search/functions_12.js +++ b/search/functions_12.js @@ -1,20 +1,20 @@ var searchData= [ - ['save_5f2d_5fdata_402',['save_2d_data',['../d1/d6b/group__kohonen__2d.html#ga6824dc6d973eb3339af7aef5fea78b0c',1,'kohonen_som_topology.c']]], - ['save_5fnd_5fdata_403',['save_nd_data',['../d0/dcb/group__kohonen__1d.html#ga7b84b14e60f47812b581d1f93057c85a',1,'kohonen_som_trace.c']]], - ['save_5fu_5fmatrix_404',['save_u_matrix',['../d1/d6b/group__kohonen__2d.html#ga49d35f68f5d11d8ef6f8cce0d0e7bcba',1,'kohonen_som_topology.c']]], - ['search_405',['search',['../df/d3c/threaded__binary__trees_8c.html#a306d567466f22e1e927aaed97d8bb58c',1,'threaded_binary_trees.c']]], - ['semi_5fimplicit_5feuler_406',['semi_implicit_euler',['../d4/d99/ode__semi__implicit__euler_8c.html#ad80059877222f885b549f2d0a3dc6b55',1,'ode_semi_implicit_euler.c']]], - ['semi_5fimplicit_5feuler_5fstep_407',['semi_implicit_euler_step',['../d4/d99/ode__semi__implicit__euler_8c.html#a720b7e995d2bbc615f94a2c7dbcf84eb',1,'ode_semi_implicit_euler.c']]], - ['shell_5fsort_408',['shell_sort',['../dd/d8b/problem__22_2sol1_8c.html#a5bc3659aa0949ea33118c95b1dee5f63',1,'shell_sort(char data[][MAX_NAME_LEN], int LEN): sol1.c'],['../d5/d4c/group__sorting.html#ga5bc16eaf3ffe6a6ab66780dd445904c0',1,'shell_sort(int *array, long LEN): shell_sort2.c']]], - ['show_5fdata_409',['show_data',['../d5/d4c/group__sorting.html#gaeccaf61ff47279384d1dba8d869d5c2f',1,'shell_sort2.c']]], - ['sigma_410',['sigma',['../d4/d83/problem__401_2sol1_8c.html#aaf964739be92adc2f500e7da11e3f6be',1,'sol1.c']]], - ['sigma2_411',['sigma2',['../d4/d83/problem__401_2sol1_8c.html#a236548478af932f1115a71f601a68788',1,'sol1.c']]], - ['solve_412',['solve',['../d5/df4/group__sudoku.html#gadfe0ed5085b4775d8fa00b434cc0fdfc',1,'sudoku_solver.c']]], - ['spirograph_413',['spirograph',['../d7/d98/spirograph_8c.html#a0daa148091ec953809fc172289f773d3',1,'spirograph.c']]], - ['stats_5fcomputer1_414',['stats_computer1',['../dc/d47/realtime__stats_8c.html#a63ddcdaab24f722f0963fa2fbe0ae628',1,'realtime_stats.c']]], - ['stats_5fcomputer2_415',['stats_computer2',['../dc/d47/realtime__stats_8c.html#a34be233a9200ee2065f6b7b27e2d9a96',1,'realtime_stats.c']]], - ['sum_5fof_5fdivisors_416',['sum_of_divisors',['../df/d1a/problem__21_2sol1_8c.html#aacf4b7e708651d2164e86958f2c29c93',1,'sol1.c']]], - ['sum_5fof_5fprimes_417',['sum_of_primes',['../d0/d6d/problem__10_2sol1_8c.html#ae3d987cb2ad0ddb0c3caa4c2506a20e5',1,'sol1.c']]], - ['swap_418',['swap',['../d5/d4c/group__sorting.html#ga4b9708d87be7a409eff20e5e7e8b43c8',1,'merge_sort.c']]] + ['save_5f2d_5fdata_401',['save_2d_data',['../d1/d6b/group__kohonen__2d.html#ga6824dc6d973eb3339af7aef5fea78b0c',1,'kohonen_som_topology.c']]], + ['save_5fnd_5fdata_402',['save_nd_data',['../d0/dcb/group__kohonen__1d.html#ga7b84b14e60f47812b581d1f93057c85a',1,'kohonen_som_trace.c']]], + ['save_5fu_5fmatrix_403',['save_u_matrix',['../d1/d6b/group__kohonen__2d.html#ga49d35f68f5d11d8ef6f8cce0d0e7bcba',1,'kohonen_som_topology.c']]], + ['search_404',['search',['../df/d3c/threaded__binary__trees_8c.html#a306d567466f22e1e927aaed97d8bb58c',1,'threaded_binary_trees.c']]], + ['semi_5fimplicit_5feuler_405',['semi_implicit_euler',['../d4/d99/ode__semi__implicit__euler_8c.html#ad80059877222f885b549f2d0a3dc6b55',1,'ode_semi_implicit_euler.c']]], + ['semi_5fimplicit_5feuler_5fstep_406',['semi_implicit_euler_step',['../d4/d99/ode__semi__implicit__euler_8c.html#a720b7e995d2bbc615f94a2c7dbcf84eb',1,'ode_semi_implicit_euler.c']]], + ['shell_5fsort_407',['shell_sort',['../dd/d8b/problem__22_2sol1_8c.html#a5bc3659aa0949ea33118c95b1dee5f63',1,'shell_sort(char data[][MAX_NAME_LEN], int LEN): sol1.c'],['../d5/d4c/group__sorting.html#ga5bc16eaf3ffe6a6ab66780dd445904c0',1,'shell_sort(int *array, long LEN): shell_sort2.c']]], + ['show_5fdata_408',['show_data',['../d5/d4c/group__sorting.html#gaeccaf61ff47279384d1dba8d869d5c2f',1,'shell_sort2.c']]], + ['sigma_409',['sigma',['../d4/d83/problem__401_2sol1_8c.html#aaf964739be92adc2f500e7da11e3f6be',1,'sol1.c']]], + ['sigma2_410',['sigma2',['../d4/d83/problem__401_2sol1_8c.html#a236548478af932f1115a71f601a68788',1,'sol1.c']]], + ['solve_411',['solve',['../d5/df4/group__sudoku.html#gadfe0ed5085b4775d8fa00b434cc0fdfc',1,'sudoku_solver.c']]], + ['spirograph_412',['spirograph',['../d7/d98/spirograph_8c.html#a0daa148091ec953809fc172289f773d3',1,'spirograph.c']]], + ['stats_5fcomputer1_413',['stats_computer1',['../dc/d47/realtime__stats_8c.html#a63ddcdaab24f722f0963fa2fbe0ae628',1,'realtime_stats.c']]], + ['stats_5fcomputer2_414',['stats_computer2',['../dc/d47/realtime__stats_8c.html#a34be233a9200ee2065f6b7b27e2d9a96',1,'realtime_stats.c']]], + ['sum_5fof_5fdivisors_415',['sum_of_divisors',['../df/d1a/problem__21_2sol1_8c.html#aacf4b7e708651d2164e86958f2c29c93',1,'sol1.c']]], + ['sum_5fof_5fprimes_416',['sum_of_primes',['../d0/d6d/problem__10_2sol1_8c.html#ae3d987cb2ad0ddb0c3caa4c2506a20e5',1,'sol1.c']]], + ['swap_417',['swap',['../d5/d4c/group__sorting.html#ga4b9708d87be7a409eff20e5e7e8b43c8',1,'merge_sort.c']]] ]; diff --git a/search/functions_13.js b/search/functions_13.js index 3ffb94df..b3a80483 100644 --- a/search/functions_13.js +++ b/search/functions_13.js @@ -1,16 +1,16 @@ var searchData= [ - ['test_419',['test',['../d7/d98/spirograph_8c.html#a708a4c1a4d0c4acc4c447310dd4db27f',1,'test(void): spirograph.c'],['../d6/d2e/cartesian__to__polar_8c.html#ae1a3968e7947464bee7714f6d43b7002',1,'test(): cartesian_to_polar.c'],['../df/d3b/binary__search_8c.html#ae1a3968e7947464bee7714f6d43b7002',1,'test(): binary_search.c'],['../d6/d7b/jump__search_8c.html#ae1a3968e7947464bee7714f6d43b7002',1,'test(): jump_search.c']]], - ['test1_420',['test1',['../dd/d8c/adaline__learning_8c.html#ab4ecb3accf5d9e0263087e7265bbe3a9',1,'test1(double eta): adaline_learning.c'],['../d2/df6/kohonen__som__topology_8c.html#a1440a7779ac56f47a3f355ce4a8c7da0',1,'test1(): kohonen_som_topology.c'],['../d0/d46/kohonen__som__trace_8c.html#a1440a7779ac56f47a3f355ce4a8c7da0',1,'test1(): kohonen_som_trace.c'],['../d7/d50/qr__eigen__values_8c.html#a1440a7779ac56f47a3f355ce4a8c7da0',1,'test1(): qr_eigen_values.c']]], - ['test2_421',['test2',['../dd/d8c/adaline__learning_8c.html#a05cc9a0acb524fde727a4d7b4a747ee6',1,'test2(double eta): adaline_learning.c'],['../d2/df6/kohonen__som__topology_8c.html#a0283886819c7c140a023582b7269e2d0',1,'test2(): kohonen_som_topology.c'],['../d0/d46/kohonen__som__trace_8c.html#a0283886819c7c140a023582b7269e2d0',1,'test2(): kohonen_som_trace.c'],['../d7/d50/qr__eigen__values_8c.html#a0283886819c7c140a023582b7269e2d0',1,'test2(): qr_eigen_values.c']]], - ['test3_422',['test3',['../dd/d8c/adaline__learning_8c.html#a3f37b9f073f7e57fd0b39d70718af1b1',1,'test3(double eta): adaline_learning.c'],['../d2/df6/kohonen__som__topology_8c.html#a6d0455dd5c30adda100e95f0423c786e',1,'test3(): kohonen_som_topology.c'],['../d0/d46/kohonen__som__trace_8c.html#a6d0455dd5c30adda100e95f0423c786e',1,'test3(): kohonen_som_trace.c']]], - ['test_5f2d_5fclasses_423',['test_2d_classes',['../d2/df6/kohonen__som__topology_8c.html#adb5ded007be1fd666fab9affe6764018',1,'kohonen_som_topology.c']]], - ['test_5f3d_5fclasses_424',['test_3d_classes',['../d0/d46/kohonen__som__trace_8c.html#a41ae16442e3e5b891a58d2e5932a2cd0',1,'kohonen_som_trace.c']]], - ['test_5f3d_5fclasses1_425',['test_3d_classes1',['../d2/df6/kohonen__som__topology_8c.html#ad9e25202bb8b481461f932668f249dbc',1,'kohonen_som_topology.c']]], - ['test_5f3d_5fclasses2_426',['test_3d_classes2',['../d2/df6/kohonen__som__topology_8c.html#a5bb02a8322d717ead1b11182c5f02a3a',1,'kohonen_som_topology.c']]], - ['test_5fc_5fatoi_427',['test_c_atoi',['../d7/dd8/c__atoi__str__to__integer_8c.html#a8c66c03637e48e375b80b5d7791e57be',1,'c_atoi_str_to_integer.c']]], - ['test_5fcircle_428',['test_circle',['../d0/d46/kohonen__som__trace_8c.html#a107f00650b8041f77767927073ddddb8',1,'kohonen_som_trace.c']]], - ['test_5ffunction_429',['test_function',['../dc/d47/realtime__stats_8c.html#aa54c915581fcc495489175a4386d59fd',1,'realtime_stats.c']]], - ['test_5flamniscate_430',['test_lamniscate',['../d0/d46/kohonen__som__trace_8c.html#aa2246f940155472084ee461f3685d614',1,'kohonen_som_trace.c']]], - ['to_5fpolar_431',['to_polar',['../d6/d2e/cartesian__to__polar_8c.html#afb80d77f0c994240309ccddcc9525e70',1,'cartesian_to_polar.c']]] + ['test_418',['test',['../d7/d98/spirograph_8c.html#a708a4c1a4d0c4acc4c447310dd4db27f',1,'test(void): spirograph.c'],['../d6/d2e/cartesian__to__polar_8c.html#ae1a3968e7947464bee7714f6d43b7002',1,'test(): cartesian_to_polar.c'],['../df/d3b/binary__search_8c.html#ae1a3968e7947464bee7714f6d43b7002',1,'test(): binary_search.c'],['../d6/d7b/jump__search_8c.html#ae1a3968e7947464bee7714f6d43b7002',1,'test(): jump_search.c']]], + ['test1_419',['test1',['../dd/d8c/adaline__learning_8c.html#ab4ecb3accf5d9e0263087e7265bbe3a9',1,'test1(double eta): adaline_learning.c'],['../d2/df6/kohonen__som__topology_8c.html#a1440a7779ac56f47a3f355ce4a8c7da0',1,'test1(): kohonen_som_topology.c'],['../d0/d46/kohonen__som__trace_8c.html#a1440a7779ac56f47a3f355ce4a8c7da0',1,'test1(): kohonen_som_trace.c'],['../d7/d50/qr__eigen__values_8c.html#a1440a7779ac56f47a3f355ce4a8c7da0',1,'test1(): qr_eigen_values.c']]], + ['test2_420',['test2',['../dd/d8c/adaline__learning_8c.html#a05cc9a0acb524fde727a4d7b4a747ee6',1,'test2(double eta): adaline_learning.c'],['../d2/df6/kohonen__som__topology_8c.html#a0283886819c7c140a023582b7269e2d0',1,'test2(): kohonen_som_topology.c'],['../d0/d46/kohonen__som__trace_8c.html#a0283886819c7c140a023582b7269e2d0',1,'test2(): kohonen_som_trace.c'],['../d7/d50/qr__eigen__values_8c.html#a0283886819c7c140a023582b7269e2d0',1,'test2(): qr_eigen_values.c']]], + ['test3_421',['test3',['../dd/d8c/adaline__learning_8c.html#a3f37b9f073f7e57fd0b39d70718af1b1',1,'test3(double eta): adaline_learning.c'],['../d2/df6/kohonen__som__topology_8c.html#a6d0455dd5c30adda100e95f0423c786e',1,'test3(): kohonen_som_topology.c'],['../d0/d46/kohonen__som__trace_8c.html#a6d0455dd5c30adda100e95f0423c786e',1,'test3(): kohonen_som_trace.c']]], + ['test_5f2d_5fclasses_422',['test_2d_classes',['../d2/df6/kohonen__som__topology_8c.html#adb5ded007be1fd666fab9affe6764018',1,'kohonen_som_topology.c']]], + ['test_5f3d_5fclasses_423',['test_3d_classes',['../d0/d46/kohonen__som__trace_8c.html#a41ae16442e3e5b891a58d2e5932a2cd0',1,'kohonen_som_trace.c']]], + ['test_5f3d_5fclasses1_424',['test_3d_classes1',['../d2/df6/kohonen__som__topology_8c.html#ad9e25202bb8b481461f932668f249dbc',1,'kohonen_som_topology.c']]], + ['test_5f3d_5fclasses2_425',['test_3d_classes2',['../d2/df6/kohonen__som__topology_8c.html#a5bb02a8322d717ead1b11182c5f02a3a',1,'kohonen_som_topology.c']]], + ['test_5fc_5fatoi_426',['test_c_atoi',['../d7/dd8/c__atoi__str__to__integer_8c.html#a8c66c03637e48e375b80b5d7791e57be',1,'c_atoi_str_to_integer.c']]], + ['test_5fcircle_427',['test_circle',['../d0/d46/kohonen__som__trace_8c.html#a107f00650b8041f77767927073ddddb8',1,'kohonen_som_trace.c']]], + ['test_5ffunction_428',['test_function',['../dc/d47/realtime__stats_8c.html#aa54c915581fcc495489175a4386d59fd',1,'realtime_stats.c']]], + ['test_5flamniscate_429',['test_lamniscate',['../d0/d46/kohonen__som__trace_8c.html#aa2246f940155472084ee461f3685d614',1,'kohonen_som_trace.c']]], + ['to_5fpolar_430',['to_polar',['../d6/d2e/cartesian__to__polar_8c.html#afb80d77f0c994240309ccddcc9525e70',1,'cartesian_to_polar.c']]] ]; diff --git a/search/functions_14.js b/search/functions_14.js index 75bd3cc0..b0d8adfc 100644 --- a/search/functions_14.js +++ b/search/functions_14.js @@ -1,7 +1,7 @@ var searchData= [ - ['vector_5fdot_432',['vector_dot',['../d4/d68/qr__decompose_8h.html#a3a584b79941a43d775f9d4ce446dbe05',1,'qr_decompose.h']]], - ['vector_5fmag_433',['vector_mag',['../d4/d68/qr__decompose_8h.html#abeec1f78a7a7e7251687e75340331212',1,'qr_decompose.h']]], - ['vector_5fproj_434',['vector_proj',['../d4/d68/qr__decompose_8h.html#a82b20e027437df768d7e994cf4cae29f',1,'qr_decompose.h']]], - ['vector_5fsub_435',['vector_sub',['../d4/d68/qr__decompose_8h.html#a6b6a0e75e75ff7919057dd275bb69145',1,'qr_decompose.h']]] + ['vector_5fdot_431',['vector_dot',['../d4/d68/qr__decompose_8h.html#a3a584b79941a43d775f9d4ce446dbe05',1,'qr_decompose.h']]], + ['vector_5fmag_432',['vector_mag',['../d4/d68/qr__decompose_8h.html#abeec1f78a7a7e7251687e75340331212',1,'qr_decompose.h']]], + ['vector_5fproj_433',['vector_proj',['../d4/d68/qr__decompose_8h.html#a82b20e027437df768d7e994cf4cae29f',1,'qr_decompose.h']]], + ['vector_5fsub_434',['vector_sub',['../d4/d68/qr__decompose_8h.html#a6b6a0e75e75ff7919057dd275bb69145',1,'qr_decompose.h']]] ]; diff --git a/search/functions_2.js b/search/functions_2.js index ff77ad0f..ce584c7d 100644 --- a/search/functions_2.js +++ b/search/functions_2.js @@ -1,7 +1,7 @@ var searchData= [ - ['bead_5fsort_320',['bead_sort',['../d5/d4c/group__sorting.html#ga2fb01e00dedb437a42010f6309e7eba8',1,'bead_sort.c']]], - ['binarysearch_321',['binarySearch',['../d3/d47/modified__binary__search_8c.html#a0cfaa56aacf960e4628a0fb27add8890',1,'modified_binary_search.c']]], - ['binarysearch1_322',['binarysearch1',['../df/d3b/binary__search_8c.html#a40855c608ca64048d04cff6526f0a582',1,'binary_search.c']]], - ['binarysearch2_323',['binarysearch2',['../df/d3b/binary__search_8c.html#a908fd6d2ad0bba33f63f8454888a0032',1,'binary_search.c']]] + ['bead_5fsort_319',['bead_sort',['../d5/d4c/group__sorting.html#ga2fb01e00dedb437a42010f6309e7eba8',1,'bead_sort.c']]], + ['binarysearch_320',['binarySearch',['../d3/d47/modified__binary__search_8c.html#a0cfaa56aacf960e4628a0fb27add8890',1,'modified_binary_search.c']]], + ['binarysearch1_321',['binarysearch1',['../df/d3b/binary__search_8c.html#a40855c608ca64048d04cff6526f0a582',1,'binary_search.c']]], + ['binarysearch2_322',['binarysearch2',['../df/d3b/binary__search_8c.html#a908fd6d2ad0bba33f63f8454888a0032',1,'binary_search.c']]] ]; diff --git a/search/functions_3.js b/search/functions_3.js index 662c8400..db7dd623 100644 --- a/search/functions_3.js +++ b/search/functions_3.js @@ -1,11 +1,11 @@ var searchData= [ - ['c_5fatoi_324',['c_atoi',['../d7/dd8/c__atoi__str__to__integer_8c.html#ad19049ebfc2088bc1e75e7e958f7b60f',1,'c_atoi_str_to_integer.c']]], - ['check_5ftermination_325',['check_termination',['../da/d38/durand__kerner__roots_8c.html#a26d5695ebed0818a3e7cf4b10aacab52',1,'durand_kerner_roots.c']]], - ['collatz_326',['collatz',['../d4/dea/problem__14_2sol1_8c.html#a81c1df5c17cb16bcc16e346fcff6fa80',1,'sol1.c']]], - ['compare_327',['compare',['../d1/df9/problem__26_2sol1_8c.html#ac70138609ef6aa6fabca57aca8681e83',1,'sol1.c']]], - ['complex_5fstr_328',['complex_str',['../da/d38/durand__kerner__roots_8c.html#afa5b04ce11475d67049cba8273741fb7',1,'durand_kerner_roots.c']]], - ['count_5fdivisors_329',['count_divisors',['../d7/d1f/problem__12_2sol1_8c.html#aa6ce6271f6156e219f9b290717f5a222',1,'sol1.c']]], - ['create_5fmatrix_330',['create_matrix',['../d7/d50/qr__eigen__values_8c.html#a7d96c5e4ae1bd6d29791bcc23a4cb2b0',1,'qr_eigen_values.c']]], - ['create_5fnode_331',['create_node',['../df/d3c/threaded__binary__trees_8c.html#ab21d1d36d95001defbca2f6abd4d410c',1,'threaded_binary_trees.c']]] + ['c_5fatoi_323',['c_atoi',['../d7/dd8/c__atoi__str__to__integer_8c.html#ad19049ebfc2088bc1e75e7e958f7b60f',1,'c_atoi_str_to_integer.c']]], + ['check_5ftermination_324',['check_termination',['../da/d38/durand__kerner__roots_8c.html#a26d5695ebed0818a3e7cf4b10aacab52',1,'durand_kerner_roots.c']]], + ['collatz_325',['collatz',['../d4/dea/problem__14_2sol1_8c.html#a81c1df5c17cb16bcc16e346fcff6fa80',1,'sol1.c']]], + ['compare_326',['compare',['../d1/df9/problem__26_2sol1_8c.html#ac70138609ef6aa6fabca57aca8681e83',1,'sol1.c']]], + ['complex_5fstr_327',['complex_str',['../da/d38/durand__kerner__roots_8c.html#afa5b04ce11475d67049cba8273741fb7',1,'durand_kerner_roots.c']]], + ['count_5fdivisors_328',['count_divisors',['../d7/d1f/problem__12_2sol1_8c.html#aa6ce6271f6156e219f9b290717f5a222',1,'sol1.c']]], + ['create_5fmatrix_329',['create_matrix',['../d7/d50/qr__eigen__values_8c.html#a7d96c5e4ae1bd6d29791bcc23a4cb2b0',1,'qr_eigen_values.c']]], + ['create_5fnode_330',['create_node',['../df/d3c/threaded__binary__trees_8c.html#ab21d1d36d95001defbca2f6abd4d410c',1,'threaded_binary_trees.c']]] ]; diff --git a/search/functions_4.js b/search/functions_4.js index b64722f1..2d354130 100644 --- a/search/functions_4.js +++ b/search/functions_4.js @@ -1,8 +1,8 @@ var searchData= [ - ['d_5ffunc_332',['d_func',['../dd/d08/newton__raphson__root_8c.html#ae713a1fd0c275fbec7edf263ac2c0337',1,'newton_raphson_root.c']]], - ['delete_5fadaline_333',['delete_adaline',['../da/d2a/group__adaline.html#ga6f35caa3084772cc126ac7b20f67f665',1,'adaline_learning.c']]], - ['delete_5fbt_334',['delete_bt',['../df/d3c/threaded__binary__trees_8c.html#a284d683f74b6c884e79ba00d3d1c3317',1,'threaded_binary_trees.c']]], - ['delete_5fnumber_335',['delete_number',['../d6/d3d/factorial__large__number_8c.html#ab5c854e0df76165c31899e69eceeeaae',1,'factorial_large_number.c']]], - ['display_336',['display',['../dc/d2e/lu__decompose_8c.html#a0789beb8d3396582d77b7aedf5e5554a',1,'display(double **A, int N): lu_decompose.c'],['../d5/d4c/group__sorting.html#gad7ed8cc4603f500d610054680d28b971',1,'display(const int *arr, int n): bead_sort.c']]] + ['d_5ffunc_331',['d_func',['../dd/d08/newton__raphson__root_8c.html#ae713a1fd0c275fbec7edf263ac2c0337',1,'newton_raphson_root.c']]], + ['delete_5fadaline_332',['delete_adaline',['../da/d2a/group__adaline.html#ga6f35caa3084772cc126ac7b20f67f665',1,'adaline_learning.c']]], + ['delete_5fbt_333',['delete_bt',['../df/d3c/threaded__binary__trees_8c.html#a284d683f74b6c884e79ba00d3d1c3317',1,'threaded_binary_trees.c']]], + ['delete_5fnumber_334',['delete_number',['../d6/d3d/factorial__large__number_8c.html#ab5c854e0df76165c31899e69eceeeaae',1,'factorial_large_number.c']]], + ['display_335',['display',['../dc/d2e/lu__decompose_8c.html#a0789beb8d3396582d77b7aedf5e5554a',1,'display(double **A, int N): lu_decompose.c'],['../d5/d4c/group__sorting.html#gad7ed8cc4603f500d610054680d28b971',1,'display(const int *arr, int n): bead_sort.c']]] ]; diff --git a/search/functions_5.js b/search/functions_5.js index b73c56ba..21504272 100644 --- a/search/functions_5.js +++ b/search/functions_5.js @@ -1,5 +1,5 @@ var searchData= [ - ['eigen_5fvalues_337',['eigen_values',['../d7/d50/qr__eigen__values_8c.html#a0d8ed79786d17df48396b333c09d05bb',1,'qr_eigen_values.c']]], - ['exact_5fsolution_338',['exact_solution',['../d4/d07/ode__forward__euler_8c.html#a8caee977b26888d34040b122e0e28e3a',1,'exact_solution(const double *x, double *y): ode_forward_euler.c'],['../d1/dc2/ode__midpoint__euler_8c.html#a8caee977b26888d34040b122e0e28e3a',1,'exact_solution(const double *x, double *y): ode_midpoint_euler.c'],['../d4/d99/ode__semi__implicit__euler_8c.html#a8caee977b26888d34040b122e0e28e3a',1,'exact_solution(const double *x, double *y): ode_semi_implicit_euler.c']]] + ['eigen_5fvalues_336',['eigen_values',['../d7/d50/qr__eigen__values_8c.html#a0d8ed79786d17df48396b333c09d05bb',1,'qr_eigen_values.c']]], + ['exact_5fsolution_337',['exact_solution',['../d4/d07/ode__forward__euler_8c.html#a8caee977b26888d34040b122e0e28e3a',1,'exact_solution(const double *x, double *y): ode_forward_euler.c'],['../d1/dc2/ode__midpoint__euler_8c.html#a8caee977b26888d34040b122e0e28e3a',1,'exact_solution(const double *x, double *y): ode_midpoint_euler.c'],['../d4/d99/ode__semi__implicit__euler_8c.html#a8caee977b26888d34040b122e0e28e3a',1,'exact_solution(const double *x, double *y): ode_semi_implicit_euler.c']]] ]; diff --git a/search/functions_6.js b/search/functions_6.js index 8d9a2890..1d8c6eeb 100644 --- a/search/functions_6.js +++ b/search/functions_6.js @@ -1,9 +1,9 @@ var searchData= [ - ['fib_339',['fib',['../d4/d99/fibonacci__fast_8c.html#a7a3d55bd19854075cba2eed6b63cb2d3',1,'fibonacci_fast.c']]], - ['find_340',['find',['../df/df3/union__find_8c.html#a3e13b69cce5a1b25ae034798092f3d86',1,'union_find.c']]], - ['forward_5feuler_341',['forward_euler',['../d4/d07/ode__forward__euler_8c.html#aaf88ad8f9f7c39fc38f3f03d6fea9df9',1,'ode_forward_euler.c']]], - ['forward_5feuler_5fstep_342',['forward_euler_step',['../d4/d07/ode__forward__euler_8c.html#ae6c9413953c8d9d4bc9e374b29586350',1,'ode_forward_euler.c']]], - ['free_5fmemory_343',['free_memory',['../dc/d80/cantor__set_8c.html#a85df3c64a683100ac6246e1e034df43d',1,'cantor_set.c']]], - ['func_344',['func',['../dd/d08/newton__raphson__root_8c.html#a72f87d423a488946b319627a454d3925',1,'newton_raphson_root.c']]] + ['fib_338',['fib',['../d4/d99/fibonacci__fast_8c.html#a7a3d55bd19854075cba2eed6b63cb2d3',1,'fibonacci_fast.c']]], + ['find_339',['find',['../df/df3/union__find_8c.html#a3e13b69cce5a1b25ae034798092f3d86',1,'union_find.c']]], + ['forward_5feuler_340',['forward_euler',['../d4/d07/ode__forward__euler_8c.html#aaf88ad8f9f7c39fc38f3f03d6fea9df9',1,'ode_forward_euler.c']]], + ['forward_5feuler_5fstep_341',['forward_euler_step',['../d4/d07/ode__forward__euler_8c.html#ae6c9413953c8d9d4bc9e374b29586350',1,'ode_forward_euler.c']]], + ['free_5fmemory_342',['free_memory',['../dc/d80/cantor__set_8c.html#a85df3c64a683100ac6246e1e034df43d',1,'cantor_set.c']]], + ['func_343',['func',['../dd/d08/newton__raphson__root_8c.html#a72f87d423a488946b319627a454d3925',1,'newton_raphson_root.c']]] ]; diff --git a/search/functions_7.js b/search/functions_7.js index c8844157..b8f89151 100644 --- a/search/functions_7.js +++ b/search/functions_7.js @@ -1,15 +1,15 @@ var searchData= [ - ['gcd_345',['gcd',['../df/de7/problem__5_2sol_8c.html#a59347107cbfdf48d51108e50280e760d',1,'sol.c']]], - ['get_5fclock_5fdiff_346',['get_clock_diff',['../d2/df6/kohonen__som__topology_8c.html#a2256c10b16edba377b64a44b6c656908',1,'get_clock_diff(clock_t start_t, clock_t end_t): kohonen_som_topology.c'],['../d0/d46/kohonen__som__trace_8c.html#a2256c10b16edba377b64a44b6c656908',1,'get_clock_diff(clock_t start_t, clock_t end_t): kohonen_som_trace.c']]], - ['get_5fdigits_347',['get_digits',['../d8/d32/problem__25_2sol1_8c.html#a2b90df6bfbf0d18cd9a19c1a71453783',1,'sol1.c']]], - ['get_5fdivisors_348',['get_divisors',['../d4/d83/problem__401_2sol1_8c.html#a7380e14d595d560007b02ce516b6b215',1,'sol1.c']]], - ['get_5fmin_5f2d_349',['get_min_2d',['../d1/d6b/group__kohonen__2d.html#gadc22d512c00a9f5799ee067f4fb90b4b',1,'kohonen_som_topology.c']]], - ['get_5fmonth_5fdays_350',['get_month_days',['../dd/df0/problem__19_2sol1_8c.html#ab7f9ad087f124b8e0615aa535b4c8a75',1,'sol1.c']]], - ['get_5fnext_5fabundant_351',['get_next_abundant',['../d7/ddb/problem__23_2sol1_8c.html#ac5d600bf3077f4188afc4c5cd2c40eaf',1,'get_next_abundant(unsigned long N): sol1.c'],['../d4/dbd/problem__23_2sol2_8c.html#ac5d600bf3077f4188afc4c5cd2c40eaf',1,'get_next_abundant(unsigned long N): sol2.c']]], - ['get_5fnext_5funknown_352',['get_next_unknown',['../d5/df4/group__sudoku.html#ga62e94fc39f116e2c81daed8f5437431b',1,'sudoku_solver.c']]], - ['get_5fnumber_353',['get_number',['../db/d01/problem__13_2sol1_8c.html#ac260f58785fb20eb09bb35385a7d47f8',1,'sol1.c']]], - ['get_5fperfect_5fnumber_354',['get_perfect_number',['../d7/ddb/problem__23_2sol1_8c.html#a1aca7f530f82b27100262adba9e7556b',1,'get_perfect_number(unsigned long N): sol1.c'],['../d4/dbd/problem__23_2sol2_8c.html#a1aca7f530f82b27100262adba9e7556b',1,'get_perfect_number(unsigned long N): sol2.c']]], - ['get_5fproduct_355',['get_product',['../dc/d63/problem__8_2sol1_8c.html#a9ffc8845f17b01a353767a40a3adf7bd',1,'sol1.c']]], - ['get_5frand_356',['get_rand',['../d6/d2e/cartesian__to__polar_8c.html#a60e62b809ca9dcb1b20a140b30d30f60',1,'cartesian_to_polar.c']]] + ['gcd_344',['gcd',['../df/de7/problem__5_2sol_8c.html#a59347107cbfdf48d51108e50280e760d',1,'sol.c']]], + ['get_5fclock_5fdiff_345',['get_clock_diff',['../d2/df6/kohonen__som__topology_8c.html#a2256c10b16edba377b64a44b6c656908',1,'get_clock_diff(clock_t start_t, clock_t end_t): kohonen_som_topology.c'],['../d0/d46/kohonen__som__trace_8c.html#a2256c10b16edba377b64a44b6c656908',1,'get_clock_diff(clock_t start_t, clock_t end_t): kohonen_som_trace.c']]], + ['get_5fdigits_346',['get_digits',['../d8/d32/problem__25_2sol1_8c.html#a2b90df6bfbf0d18cd9a19c1a71453783',1,'sol1.c']]], + ['get_5fdivisors_347',['get_divisors',['../d4/d83/problem__401_2sol1_8c.html#a7380e14d595d560007b02ce516b6b215',1,'sol1.c']]], + ['get_5fmin_5f2d_348',['get_min_2d',['../d1/d6b/group__kohonen__2d.html#gadc22d512c00a9f5799ee067f4fb90b4b',1,'kohonen_som_topology.c']]], + ['get_5fmonth_5fdays_349',['get_month_days',['../dd/df0/problem__19_2sol1_8c.html#ab7f9ad087f124b8e0615aa535b4c8a75',1,'sol1.c']]], + ['get_5fnext_5fabundant_350',['get_next_abundant',['../d7/ddb/problem__23_2sol1_8c.html#ac5d600bf3077f4188afc4c5cd2c40eaf',1,'get_next_abundant(unsigned long N): sol1.c'],['../d4/dbd/problem__23_2sol2_8c.html#ac5d600bf3077f4188afc4c5cd2c40eaf',1,'get_next_abundant(unsigned long N): sol2.c']]], + ['get_5fnext_5funknown_351',['get_next_unknown',['../d5/df4/group__sudoku.html#ga62e94fc39f116e2c81daed8f5437431b',1,'sudoku_solver.c']]], + ['get_5fnumber_352',['get_number',['../db/d01/problem__13_2sol1_8c.html#ac260f58785fb20eb09bb35385a7d47f8',1,'sol1.c']]], + ['get_5fperfect_5fnumber_353',['get_perfect_number',['../d7/ddb/problem__23_2sol1_8c.html#a1aca7f530f82b27100262adba9e7556b',1,'get_perfect_number(unsigned long N): sol1.c'],['../d4/dbd/problem__23_2sol2_8c.html#a1aca7f530f82b27100262adba9e7556b',1,'get_perfect_number(unsigned long N): sol2.c']]], + ['get_5fproduct_354',['get_product',['../dc/d63/problem__8_2sol1_8c.html#a9ffc8845f17b01a353767a40a3adf7bd',1,'sol1.c']]], + ['get_5frand_355',['get_rand',['../d6/d2e/cartesian__to__polar_8c.html#a60e62b809ca9dcb1b20a140b30d30f60',1,'cartesian_to_polar.c']]] ]; diff --git a/search/functions_8.js b/search/functions_8.js index b7d0bacc..018a3abb 100644 --- a/search/functions_8.js +++ b/search/functions_8.js @@ -1,13 +1,13 @@ var searchData= [ - ['inorder_5fdisplay_357',['inorder_display',['../df/d3c/threaded__binary__trees_8c.html#a4c1e06b5f0876ec9c1bd6817f3b7eda7',1,'threaded_binary_trees.c']]], - ['insert_5fbt_358',['insert_bt',['../df/d3c/threaded__binary__trees_8c.html#a823432888332fc9f0aa6072cff28c3bb',1,'threaded_binary_trees.c']]], - ['is_5fabundant_359',['is_abundant',['../d7/ddb/problem__23_2sol1_8c.html#a4f128410e6582fe26488e2316cc96e17',1,'is_abundant(unsigned long N): sol1.c'],['../d4/dbd/problem__23_2sol2_8c.html#a34f4ad85151e3a43368ae67f42347f56',1,'is_abundant(unsigned long N): sol2.c']]], - ['is_5fin_360',['is_in',['../d4/d83/problem__401_2sol1_8c.html#a4441a6d27134cf3aed05727800d99456',1,'sol1.c']]], - ['is_5fleap_5fyear_361',['is_leap_year',['../dd/df0/problem__19_2sol1_8c.html#a6561b1adc8a19c092679b9874da24e2e',1,'sol1.c']]], - ['is_5fpalindromic_362',['is_palindromic',['../d0/d6c/problem__4_2sol_8c.html#adf9bea8d35848959bde5b3f277edf0c4',1,'sol.c']]], - ['is_5fprime_363',['is_prime',['../d0/d6d/problem__10_2sol1_8c.html#acc871ab6bfead702e983a7f9c412915f',1,'sol1.c']]], - ['is_5fsum_5fof_5fabundant_364',['is_sum_of_abundant',['../d7/ddb/problem__23_2sol1_8c.html#a3ab61b5a1c4f2288625d160aa0ea8478',1,'is_sum_of_abundant(unsigned long N): sol1.c'],['../d4/dbd/problem__23_2sol2_8c.html#a3ab61b5a1c4f2288625d160aa0ea8478',1,'is_sum_of_abundant(unsigned long N): sol2.c']]], - ['ispalindrome_365',['isPalindrome',['../df/d16/palindrome_8c.html#a6320493ddee0ca4614423721c5d6f4ba',1,'palindrome.c']]], - ['isprime_366',['isprime',['../d7/dd3/problem__3_2sol1_8c.html#aa0f4796aa2e89c327f827bd55f5cb305',1,'sol1.c']]] + ['inorder_5fdisplay_356',['inorder_display',['../df/d3c/threaded__binary__trees_8c.html#a4c1e06b5f0876ec9c1bd6817f3b7eda7',1,'threaded_binary_trees.c']]], + ['insert_5fbt_357',['insert_bt',['../df/d3c/threaded__binary__trees_8c.html#a823432888332fc9f0aa6072cff28c3bb',1,'threaded_binary_trees.c']]], + ['is_5fabundant_358',['is_abundant',['../d7/ddb/problem__23_2sol1_8c.html#a4f128410e6582fe26488e2316cc96e17',1,'is_abundant(unsigned long N): sol1.c'],['../d4/dbd/problem__23_2sol2_8c.html#a34f4ad85151e3a43368ae67f42347f56',1,'is_abundant(unsigned long N): sol2.c']]], + ['is_5fin_359',['is_in',['../d4/d83/problem__401_2sol1_8c.html#a4441a6d27134cf3aed05727800d99456',1,'sol1.c']]], + ['is_5fleap_5fyear_360',['is_leap_year',['../dd/df0/problem__19_2sol1_8c.html#a6561b1adc8a19c092679b9874da24e2e',1,'sol1.c']]], + ['is_5fpalindromic_361',['is_palindromic',['../d0/d6c/problem__4_2sol_8c.html#adf9bea8d35848959bde5b3f277edf0c4',1,'sol.c']]], + ['is_5fprime_362',['is_prime',['../d0/d6d/problem__10_2sol1_8c.html#acc871ab6bfead702e983a7f9c412915f',1,'sol1.c']]], + ['is_5fsum_5fof_5fabundant_363',['is_sum_of_abundant',['../d7/ddb/problem__23_2sol1_8c.html#a3ab61b5a1c4f2288625d160aa0ea8478',1,'is_sum_of_abundant(unsigned long N): sol1.c'],['../d4/dbd/problem__23_2sol2_8c.html#a3ab61b5a1c4f2288625d160aa0ea8478',1,'is_sum_of_abundant(unsigned long N): sol2.c']]], + ['ispalindrome_364',['isPalindrome',['../df/d16/palindrome_8c.html#a6320493ddee0ca4614423721c5d6f4ba',1,'palindrome.c']]], + ['isprime_365',['isprime',['../d7/dd3/problem__3_2sol1_8c.html#aa0f4796aa2e89c327f827bd55f5cb305',1,'sol1.c']]] ]; diff --git a/search/functions_9.js b/search/functions_9.js index 0e2a17f8..e00124bb 100644 --- a/search/functions_9.js +++ b/search/functions_9.js @@ -1,5 +1,5 @@ var searchData= [ - ['join_367',['join',['../df/df3/union__find_8c.html#af2f3ff6d98641f7d3be11f071c97908a',1,'union_find.c']]], - ['jump_5fsearch_368',['jump_search',['../d6/d7b/jump__search_8c.html#aff36d719e6fca6aea4377a089580c603',1,'jump_search.c']]] + ['join_366',['join',['../df/df3/union__find_8c.html#af2f3ff6d98641f7d3be11f071c97908a',1,'union_find.c']]], + ['jump_5fsearch_367',['jump_search',['../d6/d7b/jump__search_8c.html#aff36d719e6fca6aea4377a089580c603',1,'jump_search.c']]] ]; diff --git a/search/functions_a.js b/search/functions_a.js index 663c4980..abcf7448 100644 --- a/search/functions_a.js +++ b/search/functions_a.js @@ -1,8 +1,8 @@ var searchData= [ - ['kohonen_5fdata_5f3d_369',['kohonen_data_3d',['../d1/d6b/group__kohonen__2d.html#ga8df35f04c1762a01dcf108fa13b897d6',1,'kohonen_som_topology.c']]], - ['kohonen_5fget_5fmin_5f1d_370',['kohonen_get_min_1d',['../d0/dcb/group__kohonen__1d.html#ga4a57a413a3cef286a7da6d4666575586',1,'kohonen_som_trace.c']]], - ['kohonen_5fsom_371',['kohonen_som',['../d1/d6b/group__kohonen__2d.html#gacb42eda8af6ebd6a141a34ab00a0b710',1,'kohonen_som_topology.c']]], - ['kohonen_5fsom_5ftracer_372',['kohonen_som_tracer',['../d0/dcb/group__kohonen__1d.html#gaeaeffbff2be4d5d15b0d4f10f846abde',1,'kohonen_som_trace.c']]], - ['kohonen_5fupdate_5fweights_373',['kohonen_update_weights',['../d1/d6b/group__kohonen__2d.html#ga83abb572c60d202e100595a989dfe123',1,'kohonen_update_weights(const double *X, struct kohonen_array_3d *W, double **D, int num_out, int num_features, double alpha, int R): kohonen_som_topology.c'],['../d0/dcb/group__kohonen__1d.html#gae334493a0917a24736fe5ba82aa6f81f',1,'kohonen_update_weights(double const *x, double *const *W, double *D, int num_out, int num_features, double alpha, int R): kohonen_som_trace.c']]] + ['kohonen_5fdata_5f3d_368',['kohonen_data_3d',['../d1/d6b/group__kohonen__2d.html#ga8df35f04c1762a01dcf108fa13b897d6',1,'kohonen_som_topology.c']]], + ['kohonen_5fget_5fmin_5f1d_369',['kohonen_get_min_1d',['../d0/dcb/group__kohonen__1d.html#ga4a57a413a3cef286a7da6d4666575586',1,'kohonen_som_trace.c']]], + ['kohonen_5fsom_370',['kohonen_som',['../d1/d6b/group__kohonen__2d.html#gacb42eda8af6ebd6a141a34ab00a0b710',1,'kohonen_som_topology.c']]], + ['kohonen_5fsom_5ftracer_371',['kohonen_som_tracer',['../d0/dcb/group__kohonen__1d.html#gaeaeffbff2be4d5d15b0d4f10f846abde',1,'kohonen_som_trace.c']]], + ['kohonen_5fupdate_5fweights_372',['kohonen_update_weights',['../d1/d6b/group__kohonen__2d.html#ga83abb572c60d202e100595a989dfe123',1,'kohonen_update_weights(const double *X, struct kohonen_array_3d *W, double **D, int num_out, int num_features, double alpha, int R): kohonen_som_topology.c'],['../d0/dcb/group__kohonen__1d.html#gae334493a0917a24736fe5ba82aa6f81f',1,'kohonen_update_weights(double const *x, double *const *W, double *D, int num_out, int num_features, double alpha, int R): kohonen_som_trace.c']]] ]; diff --git a/search/functions_b.js b/search/functions_b.js index 8235eeab..48e6f4b3 100644 --- a/search/functions_b.js +++ b/search/functions_b.js @@ -1,6 +1,6 @@ var searchData= [ - ['lazy_5fsort_374',['lazy_sort',['../dd/d8b/problem__22_2sol1_8c.html#ae359b8a4656b164c91ef91a084c15c9d',1,'sol1.c']]], - ['lcm_375',['lcm',['../df/de7/problem__5_2sol_8c.html#ae9606f1867e9921867d6572f51377b4c',1,'sol.c']]], - ['lu_5fdecomposition_376',['lu_decomposition',['../dc/d2e/lu__decompose_8c.html#aae40b90a8efd645c749128cf8072bbb4',1,'lu_decompose.c']]] + ['lazy_5fsort_373',['lazy_sort',['../dd/d8b/problem__22_2sol1_8c.html#ae359b8a4656b164c91ef91a084c15c9d',1,'sol1.c']]], + ['lcm_374',['lcm',['../df/de7/problem__5_2sol_8c.html#ae9606f1867e9921867d6572f51377b4c',1,'sol.c']]], + ['lu_5fdecomposition_375',['lu_decomposition',['../dc/d2e/lu__decompose_8c.html#aae40b90a8efd645c749128cf8072bbb4',1,'lu_decompose.c']]] ]; diff --git a/search/functions_c.js b/search/functions_c.js index 53edfaef..b2db24a1 100644 --- a/search/functions_c.js +++ b/search/functions_c.js @@ -1,11 +1,11 @@ var searchData= [ - ['main_377',['main',['../d7/dd8/c__atoi__str__to__integer_8c.html#a3c04138a5bfe5d72780bb7e82a18e627',1,'main(int argc, char **argv): c_atoi_str_to_integer.c'],['../df/d3c/threaded__binary__trees_8c.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): threaded_binary_trees.c'],['../d7/d98/spirograph_8c.html#a3c04138a5bfe5d72780bb7e82a18e627',1,'main(int argc, char **argv): spirograph.c'],['../dd/d8c/adaline__learning_8c.html#a3c04138a5bfe5d72780bb7e82a18e627',1,'main(int argc, char **argv): adaline_learning.c'],['../d2/df6/kohonen__som__topology_8c.html#a3c04138a5bfe5d72780bb7e82a18e627',1,'main(int argc, char **argv): kohonen_som_topology.c'],['../d0/d46/kohonen__som__trace_8c.html#a3c04138a5bfe5d72780bb7e82a18e627',1,'main(int argc, char **argv): kohonen_som_trace.c'],['../dc/d80/cantor__set_8c.html#abf9e6b7e6f15df4b525a2e7705ba3089',1,'main(int argc, char const *argv[]): cantor_set.c'],['../d6/d2e/cartesian__to__polar_8c.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): cartesian_to_polar.c'],['../dc/d80/collatz_8c.html#a0ddf1224851353fc92bfbff6f499fa97',1,'main(int argc, char *argv[]): collatz.c'],['../d6/d3d/factorial__large__number_8c.html#a0ddf1224851353fc92bfbff6f499fa97',1,'main(int argc, char *argv[]): factorial_large_number.c'],['../d4/d99/fibonacci__fast_8c.html#a0ddf1224851353fc92bfbff6f499fa97',1,'main(int argc, char *argv[]): fibonacci_fast.c'],['../df/d16/palindrome_8c.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): palindrome.c'],['../de/dac/sudoku__solver_8c.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): sudoku_solver.c'],['../df/df3/union__find_8c.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): union_find.c'],['../da/d38/durand__kerner__roots_8c.html#a3c04138a5bfe5d72780bb7e82a18e627',1,'main(int argc, char **argv): durand_kerner_roots.c'],['../dc/d2e/lu__decompose_8c.html#a3c04138a5bfe5d72780bb7e82a18e627',1,'main(int argc, char **argv): lu_decompose.c'],['../dd/d08/newton__raphson__root_8c.html#a3c04138a5bfe5d72780bb7e82a18e627',1,'main(int argc, char **argv): newton_raphson_root.c'],['../d4/d07/ode__forward__euler_8c.html#a0ddf1224851353fc92bfbff6f499fa97',1,'main(int argc, char *argv[]): ode_forward_euler.c'],['../d1/dc2/ode__midpoint__euler_8c.html#a0ddf1224851353fc92bfbff6f499fa97',1,'main(int argc, char *argv[]): ode_midpoint_euler.c'],['../d4/d99/ode__semi__implicit__euler_8c.html#a0ddf1224851353fc92bfbff6f499fa97',1,'main(int argc, char *argv[]): ode_semi_implicit_euler.c'],['../d5/d23/qr__decomposition_8c.html#a840291bc02cba5474a4cb46a9b9566fe',1,'main(void): qr_decomposition.c'],['../d7/d50/qr__eigen__values_8c.html#a3c04138a5bfe5d72780bb7e82a18e627',1,'main(int argc, char **argv): qr_eigen_values.c'],['../dc/d47/realtime__stats_8c.html#a3c04138a5bfe5d72780bb7e82a18e627',1,'main(int argc, char **argv): realtime_stats.c'],['../da/d35/problem__1_2sol1_8c.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): sol1.c'],['../d2/dae/problem__1_2sol2_8c.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): sol2.c'],['../d6/de3/sol3_8c.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): sol3.c'],['../d6/d1b/sol4_8c.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): sol4.c'],['../d0/d6d/problem__10_2sol1_8c.html#a0ddf1224851353fc92bfbff6f499fa97',1,'main(int argc, char *argv[]): sol1.c'],['../d9/da7/problem__10_2sol2_8c.html#a0ddf1224851353fc92bfbff6f499fa97',1,'main(int argc, char *argv[]): sol2.c'],['../d7/d1f/problem__12_2sol1_8c.html#a3c04138a5bfe5d72780bb7e82a18e627',1,'main(int argc, char **argv): sol1.c'],['../db/d01/problem__13_2sol1_8c.html#a840291bc02cba5474a4cb46a9b9566fe',1,'main(void): sol1.c'],['../d4/dea/problem__14_2sol1_8c.html#a3c04138a5bfe5d72780bb7e82a18e627',1,'main(int argc, char **argv): sol1.c'],['../d7/d91/problem__15_2sol1_8c.html#a3c04138a5bfe5d72780bb7e82a18e627',1,'main(int argc, char **argv): sol1.c'],['../d6/d88/problem__16_2sol1_8c.html#a3c04138a5bfe5d72780bb7e82a18e627',1,'main(int argc, char **argv): sol1.c'],['../dd/df0/problem__19_2sol1_8c.html#a3c04138a5bfe5d72780bb7e82a18e627',1,'main(int argc, char **argv): sol1.c'],['../d0/d7f/so1_8c.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): so1.c'],['../db/d80/problem__20_2sol1_8c.html#a3c04138a5bfe5d72780bb7e82a18e627',1,'main(int argc, char **argv): sol1.c'],['../df/d1a/problem__21_2sol1_8c.html#a3c04138a5bfe5d72780bb7e82a18e627',1,'main(int argc, char **argv): sol1.c'],['../dd/d8b/problem__22_2sol1_8c.html#a3c04138a5bfe5d72780bb7e82a18e627',1,'main(int argc, char **argv): sol1.c'],['../d7/ddb/problem__23_2sol1_8c.html#a3c04138a5bfe5d72780bb7e82a18e627',1,'main(int argc, char **argv): sol1.c'],['../d4/dbd/problem__23_2sol2_8c.html#a3c04138a5bfe5d72780bb7e82a18e627',1,'main(int argc, char **argv): sol2.c'],['../d8/d32/problem__25_2sol1_8c.html#a0ddf1224851353fc92bfbff6f499fa97',1,'main(int argc, char *argv[]): sol1.c'],['../d1/df9/problem__26_2sol1_8c.html#a0ddf1224851353fc92bfbff6f499fa97',1,'main(int argc, char *argv[]): sol1.c'],['../d7/dd3/problem__3_2sol1_8c.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): sol1.c'],['../d2/dbc/problem__3_2sol2_8c.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): sol2.c'],['../d0/d6c/problem__4_2sol_8c.html#a840291bc02cba5474a4cb46a9b9566fe',1,'main(void): sol.c'],['../d4/d83/problem__401_2sol1_8c.html#a3c04138a5bfe5d72780bb7e82a18e627',1,'main(int argc, char **argv): sol1.c'],['../df/de7/problem__5_2sol_8c.html#a840291bc02cba5474a4cb46a9b9566fe',1,'main(void): sol.c'],['../d4/d7b/problem__6_2sol_8c.html#a840291bc02cba5474a4cb46a9b9566fe',1,'main(void): sol.c'],['../d1/d2f/problem__7_2sol_8c.html#a840291bc02cba5474a4cb46a9b9566fe',1,'main(void): sol.c'],['../dc/d63/problem__8_2sol1_8c.html#a0ddf1224851353fc92bfbff6f499fa97',1,'main(int argc, char *argv[]): sol1.c'],['../d2/d93/problem__8_2sol2_8c.html#a0ddf1224851353fc92bfbff6f499fa97',1,'main(int argc, char *argv[]): sol2.c'],['../df/da5/problem__9_2sol1_8c.html#a840291bc02cba5474a4cb46a9b9566fe',1,'main(void): sol1.c'],['../d8/de0/problem__9_2sol2_8c.html#a840291bc02cba5474a4cb46a9b9566fe',1,'main(void): sol2.c'],['../df/d3b/binary__search_8c.html#a840291bc02cba5474a4cb46a9b9566fe',1,'main(void): binary_search.c'],['../d6/d7b/jump__search_8c.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): jump_search.c'],['../d3/d47/modified__binary__search_8c.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): modified_binary_search.c'],['../d2/da8/bead__sort_8c.html#ac0f2228420376f4db7e1274f2b41667c',1,'main(int argc, const char *argv[]): bead_sort.c'],['../d2/d83/merge__sort_8c.html#a840291bc02cba5474a4cb46a9b9566fe',1,'main(void): merge_sort.c'],['../d6/ded/shell__sort2_8c.html#a0ddf1224851353fc92bfbff6f499fa97',1,'main(int argc, char *argv[]): shell_sort2.c']]], - ['mat_5fmul_378',['mat_mul',['../d7/d50/qr__eigen__values_8c.html#a741477692f001a805b0fea942c9dc2b9',1,'qr_eigen_values.c']]], - ['merge_379',['merge',['../d5/d4c/group__sorting.html#ga8dc3ec66cb3350313fdb34bfd1674729',1,'merge_sort.c']]], - ['merge_5fsort_380',['merge_sort',['../d5/d4c/group__sorting.html#gab99b8a397bdd0bf2903d66c22ba4ba43',1,'merge_sort.c']]], - ['midpoint_5feuler_381',['midpoint_euler',['../d1/dc2/ode__midpoint__euler_8c.html#a148003d8b261d040c1c41e73b40af1dd',1,'ode_midpoint_euler.c']]], - ['midpoint_5feuler_5fstep_382',['midpoint_euler_step',['../d1/dc2/ode__midpoint__euler_8c.html#affe6cc2ab040b94a29e6c41782f72d51',1,'ode_midpoint_euler.c']]], - ['modifiedbinarysearch_383',['modifiedBinarySearch',['../d3/d47/modified__binary__search_8c.html#a7df9a198e30cded6229d79bef7591f8f',1,'modified_binary_search.c']]], - ['multiply_384',['multiply',['../d6/d3d/factorial__large__number_8c.html#ad398ddbd594ca69a5e6dfc894925341e',1,'factorial_large_number.c']]] + ['main_376',['main',['../d7/dd8/c__atoi__str__to__integer_8c.html#a3c04138a5bfe5d72780bb7e82a18e627',1,'main(int argc, char **argv): c_atoi_str_to_integer.c'],['../df/d3c/threaded__binary__trees_8c.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): threaded_binary_trees.c'],['../d7/d98/spirograph_8c.html#a3c04138a5bfe5d72780bb7e82a18e627',1,'main(int argc, char **argv): spirograph.c'],['../dd/d8c/adaline__learning_8c.html#a3c04138a5bfe5d72780bb7e82a18e627',1,'main(int argc, char **argv): adaline_learning.c'],['../d2/df6/kohonen__som__topology_8c.html#a3c04138a5bfe5d72780bb7e82a18e627',1,'main(int argc, char **argv): kohonen_som_topology.c'],['../d0/d46/kohonen__som__trace_8c.html#a3c04138a5bfe5d72780bb7e82a18e627',1,'main(int argc, char **argv): kohonen_som_trace.c'],['../dc/d80/cantor__set_8c.html#abf9e6b7e6f15df4b525a2e7705ba3089',1,'main(int argc, char const *argv[]): cantor_set.c'],['../d6/d2e/cartesian__to__polar_8c.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): cartesian_to_polar.c'],['../dc/d80/collatz_8c.html#a0ddf1224851353fc92bfbff6f499fa97',1,'main(int argc, char *argv[]): collatz.c'],['../d6/d3d/factorial__large__number_8c.html#a0ddf1224851353fc92bfbff6f499fa97',1,'main(int argc, char *argv[]): factorial_large_number.c'],['../d4/d99/fibonacci__fast_8c.html#a0ddf1224851353fc92bfbff6f499fa97',1,'main(int argc, char *argv[]): fibonacci_fast.c'],['../df/d16/palindrome_8c.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): palindrome.c'],['../de/dac/sudoku__solver_8c.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): sudoku_solver.c'],['../df/df3/union__find_8c.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): union_find.c'],['../da/d38/durand__kerner__roots_8c.html#a3c04138a5bfe5d72780bb7e82a18e627',1,'main(int argc, char **argv): durand_kerner_roots.c'],['../dc/d2e/lu__decompose_8c.html#a3c04138a5bfe5d72780bb7e82a18e627',1,'main(int argc, char **argv): lu_decompose.c'],['../dd/d08/newton__raphson__root_8c.html#a3c04138a5bfe5d72780bb7e82a18e627',1,'main(int argc, char **argv): newton_raphson_root.c'],['../d4/d07/ode__forward__euler_8c.html#a0ddf1224851353fc92bfbff6f499fa97',1,'main(int argc, char *argv[]): ode_forward_euler.c'],['../d1/dc2/ode__midpoint__euler_8c.html#a0ddf1224851353fc92bfbff6f499fa97',1,'main(int argc, char *argv[]): ode_midpoint_euler.c'],['../d4/d99/ode__semi__implicit__euler_8c.html#a0ddf1224851353fc92bfbff6f499fa97',1,'main(int argc, char *argv[]): ode_semi_implicit_euler.c'],['../d5/d23/qr__decomposition_8c.html#a840291bc02cba5474a4cb46a9b9566fe',1,'main(void): qr_decomposition.c'],['../d7/d50/qr__eigen__values_8c.html#a3c04138a5bfe5d72780bb7e82a18e627',1,'main(int argc, char **argv): qr_eigen_values.c'],['../dc/d47/realtime__stats_8c.html#a3c04138a5bfe5d72780bb7e82a18e627',1,'main(int argc, char **argv): realtime_stats.c'],['../da/d35/problem__1_2sol1_8c.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): sol1.c'],['../d2/dae/problem__1_2sol2_8c.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): sol2.c'],['../d6/de3/sol3_8c.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): sol3.c'],['../d6/d1b/sol4_8c.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): sol4.c'],['../d0/d6d/problem__10_2sol1_8c.html#a0ddf1224851353fc92bfbff6f499fa97',1,'main(int argc, char *argv[]): sol1.c'],['../d9/da7/problem__10_2sol2_8c.html#a0ddf1224851353fc92bfbff6f499fa97',1,'main(int argc, char *argv[]): sol2.c'],['../d7/d1f/problem__12_2sol1_8c.html#a3c04138a5bfe5d72780bb7e82a18e627',1,'main(int argc, char **argv): sol1.c'],['../db/d01/problem__13_2sol1_8c.html#a840291bc02cba5474a4cb46a9b9566fe',1,'main(void): sol1.c'],['../d4/dea/problem__14_2sol1_8c.html#a3c04138a5bfe5d72780bb7e82a18e627',1,'main(int argc, char **argv): sol1.c'],['../d7/d91/problem__15_2sol1_8c.html#a3c04138a5bfe5d72780bb7e82a18e627',1,'main(int argc, char **argv): sol1.c'],['../d6/d88/problem__16_2sol1_8c.html#a3c04138a5bfe5d72780bb7e82a18e627',1,'main(int argc, char **argv): sol1.c'],['../dd/df0/problem__19_2sol1_8c.html#a3c04138a5bfe5d72780bb7e82a18e627',1,'main(int argc, char **argv): sol1.c'],['../d0/d7f/so1_8c.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): so1.c'],['../db/d80/problem__20_2sol1_8c.html#a3c04138a5bfe5d72780bb7e82a18e627',1,'main(int argc, char **argv): sol1.c'],['../df/d1a/problem__21_2sol1_8c.html#a3c04138a5bfe5d72780bb7e82a18e627',1,'main(int argc, char **argv): sol1.c'],['../dd/d8b/problem__22_2sol1_8c.html#a3c04138a5bfe5d72780bb7e82a18e627',1,'main(int argc, char **argv): sol1.c'],['../d7/ddb/problem__23_2sol1_8c.html#a3c04138a5bfe5d72780bb7e82a18e627',1,'main(int argc, char **argv): sol1.c'],['../d4/dbd/problem__23_2sol2_8c.html#a3c04138a5bfe5d72780bb7e82a18e627',1,'main(int argc, char **argv): sol2.c'],['../d8/d32/problem__25_2sol1_8c.html#a0ddf1224851353fc92bfbff6f499fa97',1,'main(int argc, char *argv[]): sol1.c'],['../d1/df9/problem__26_2sol1_8c.html#a0ddf1224851353fc92bfbff6f499fa97',1,'main(int argc, char *argv[]): sol1.c'],['../d7/dd3/problem__3_2sol1_8c.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): sol1.c'],['../d2/dbc/problem__3_2sol2_8c.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): sol2.c'],['../d0/d6c/problem__4_2sol_8c.html#a840291bc02cba5474a4cb46a9b9566fe',1,'main(void): sol.c'],['../d4/d83/problem__401_2sol1_8c.html#a3c04138a5bfe5d72780bb7e82a18e627',1,'main(int argc, char **argv): sol1.c'],['../df/de7/problem__5_2sol_8c.html#a840291bc02cba5474a4cb46a9b9566fe',1,'main(void): sol.c'],['../d4/d7b/problem__6_2sol_8c.html#a840291bc02cba5474a4cb46a9b9566fe',1,'main(void): sol.c'],['../d1/d2f/problem__7_2sol_8c.html#a840291bc02cba5474a4cb46a9b9566fe',1,'main(void): sol.c'],['../dc/d63/problem__8_2sol1_8c.html#a0ddf1224851353fc92bfbff6f499fa97',1,'main(int argc, char *argv[]): sol1.c'],['../d2/d93/problem__8_2sol2_8c.html#a0ddf1224851353fc92bfbff6f499fa97',1,'main(int argc, char *argv[]): sol2.c'],['../df/da5/problem__9_2sol1_8c.html#a840291bc02cba5474a4cb46a9b9566fe',1,'main(void): sol1.c'],['../d8/de0/problem__9_2sol2_8c.html#a840291bc02cba5474a4cb46a9b9566fe',1,'main(void): sol2.c'],['../df/d3b/binary__search_8c.html#a840291bc02cba5474a4cb46a9b9566fe',1,'main(void): binary_search.c'],['../d6/d7b/jump__search_8c.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): jump_search.c'],['../d3/d47/modified__binary__search_8c.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): modified_binary_search.c'],['../d2/da8/bead__sort_8c.html#ac0f2228420376f4db7e1274f2b41667c',1,'main(int argc, const char *argv[]): bead_sort.c'],['../d2/d83/merge__sort_8c.html#a840291bc02cba5474a4cb46a9b9566fe',1,'main(void): merge_sort.c'],['../d6/ded/shell__sort2_8c.html#a0ddf1224851353fc92bfbff6f499fa97',1,'main(int argc, char *argv[]): shell_sort2.c']]], + ['mat_5fmul_377',['mat_mul',['../d7/d50/qr__eigen__values_8c.html#a741477692f001a805b0fea942c9dc2b9',1,'qr_eigen_values.c']]], + ['merge_378',['merge',['../d5/d4c/group__sorting.html#ga8dc3ec66cb3350313fdb34bfd1674729',1,'merge_sort.c']]], + ['merge_5fsort_379',['merge_sort',['../d5/d4c/group__sorting.html#gab99b8a397bdd0bf2903d66c22ba4ba43',1,'merge_sort.c']]], + ['midpoint_5feuler_380',['midpoint_euler',['../d1/dc2/ode__midpoint__euler_8c.html#a148003d8b261d040c1c41e73b40af1dd',1,'ode_midpoint_euler.c']]], + ['midpoint_5feuler_5fstep_381',['midpoint_euler_step',['../d1/dc2/ode__midpoint__euler_8c.html#affe6cc2ab040b94a29e6c41782f72d51',1,'ode_midpoint_euler.c']]], + ['modifiedbinarysearch_382',['modifiedBinarySearch',['../d3/d47/modified__binary__search_8c.html#a7df9a198e30cded6229d79bef7591f8f',1,'modified_binary_search.c']]], + ['multiply_383',['multiply',['../d6/d3d/factorial__large__number_8c.html#ad398ddbd594ca69a5e6dfc894925341e',1,'factorial_large_number.c']]] ]; diff --git a/search/functions_d.js b/search/functions_d.js index 56faa74b..d7bbc610 100644 --- a/search/functions_d.js +++ b/search/functions_d.js @@ -1,6 +1,6 @@ var searchData= [ - ['new_5fadaline_385',['new_adaline',['../da/d2a/group__adaline.html#gacd88962c5f6341e43cbc69b4a7d3485b',1,'adaline_learning.c']]], - ['new_5fnumber_386',['new_number',['../d6/d3d/factorial__large__number_8c.html#ad8101f58545bd891ae8b6e11caadd7eb',1,'factorial_large_number.c']]], - ['number_5fof_5fpaths_387',['number_of_paths',['../d7/d91/problem__15_2sol1_8c.html#a4650d1d3897633d84253f93433f601d6',1,'sol1.c']]] + ['new_5fadaline_384',['new_adaline',['../da/d2a/group__adaline.html#gacd88962c5f6341e43cbc69b4a7d3485b',1,'adaline_learning.c']]], + ['new_5fnumber_385',['new_number',['../d6/d3d/factorial__large__number_8c.html#ad8101f58545bd891ae8b6e11caadd7eb',1,'factorial_large_number.c']]], + ['number_5fof_5fpaths_386',['number_of_paths',['../d7/d91/problem__15_2sol1_8c.html#a4650d1d3897633d84253f93433f601d6',1,'sol1.c']]] ]; diff --git a/search/functions_e.js b/search/functions_e.js index a373d62b..e0da6ca3 100644 --- a/search/functions_e.js +++ b/search/functions_e.js @@ -1,7 +1,7 @@ var searchData= [ - ['ok_388',['OK',['../d5/df4/group__sudoku.html#ga3a0ec150ac9d0cb6b28279d36d95d72f',1,'sudoku_solver.c']]], - ['okbox_389',['OKbox',['../d5/df4/group__sudoku.html#ga1cd43df3f4187845ce186042fe53e6f1',1,'sudoku_solver.c']]], - ['okcol_390',['OKcol',['../d5/df4/group__sudoku.html#ga6503128d4f5ce0a0826f72f73f9e0b2a',1,'sudoku_solver.c']]], - ['okrow_391',['OKrow',['../d5/df4/group__sudoku.html#ga85d25d3b40017436f264a103685e4c55',1,'sudoku_solver.c']]] + ['ok_387',['OK',['../d5/df4/group__sudoku.html#ga3a0ec150ac9d0cb6b28279d36d95d72f',1,'sudoku_solver.c']]], + ['okbox_388',['OKbox',['../d5/df4/group__sudoku.html#ga1cd43df3f4187845ce186042fe53e6f1',1,'sudoku_solver.c']]], + ['okcol_389',['OKcol',['../d5/df4/group__sudoku.html#ga6503128d4f5ce0a0826f72f73f9e0b2a',1,'sudoku_solver.c']]], + ['okrow_390',['OKrow',['../d5/df4/group__sudoku.html#ga85d25d3b40017436f264a103685e4c55',1,'sudoku_solver.c']]] ]; diff --git a/search/functions_f.js b/search/functions_f.js index 399526d3..515963bf 100644 --- a/search/functions_f.js +++ b/search/functions_f.js @@ -1,11 +1,11 @@ var searchData= [ - ['poly_5ffunction_392',['poly_function',['../da/d38/durand__kerner__roots_8c.html#a321f9781a9744ccdaf0aba89f35ec29c',1,'durand_kerner_roots.c']]], - ['postorder_5fdisplay_393',['postorder_display',['../df/d3c/threaded__binary__trees_8c.html#a5a82ae0ee13788be51ca4ba6cddb0719',1,'threaded_binary_trees.c']]], - ['preorder_5fdisplay_394',['preorder_display',['../df/d3c/threaded__binary__trees_8c.html#a8169ba0dfd5b8183672e444d1434bf9c',1,'threaded_binary_trees.c']]], - ['print_395',['print',['../dc/d80/cantor__set_8c.html#a75ee530cd7148a63249784ad3dda8fab',1,'print(CantorSet *head): cantor_set.c'],['../d5/df4/group__sudoku.html#ga702ff4f95dde780c7d04fcdd1021b6c1',1,'print(const struct sudoku *a): sudoku_solver.c']]], - ['print_5fmatrix_396',['print_matrix',['../d4/d68/qr__decompose_8h.html#a90562ce8c3707401e9c5809dece68d6a',1,'qr_decompose.h']]], - ['print_5fnumber_397',['print_number',['../db/d01/problem__13_2sol1_8c.html#a248adc917818cc6666d8bc679a660319',1,'print_number(uint8_t *number, uint8_t N, int8_t num_digits_to_print): sol1.c'],['../d8/d32/problem__25_2sol1_8c.html#abe5bc1f170b2108a19d0a16d30bd3235',1,'print_number(unsigned char *number, int N): sol1.c']]], - ['problem_398',['problem',['../d4/d07/ode__forward__euler_8c.html#a97075291390a68c262ed66e157a57eb4',1,'problem(const double *x, double *y, double *dy): ode_forward_euler.c'],['../d1/dc2/ode__midpoint__euler_8c.html#a97075291390a68c262ed66e157a57eb4',1,'problem(const double *x, double *y, double *dy): ode_midpoint_euler.c'],['../d4/d99/ode__semi__implicit__euler_8c.html#a97075291390a68c262ed66e157a57eb4',1,'problem(const double *x, double *y, double *dy): ode_semi_implicit_euler.c']]], - ['propagate_399',['propagate',['../dc/d80/cantor__set_8c.html#a1f156d2b53b80305bd2fa3ff5fdf3c97',1,'cantor_set.c']]] + ['poly_5ffunction_391',['poly_function',['../da/d38/durand__kerner__roots_8c.html#a321f9781a9744ccdaf0aba89f35ec29c',1,'durand_kerner_roots.c']]], + ['postorder_5fdisplay_392',['postorder_display',['../df/d3c/threaded__binary__trees_8c.html#a5a82ae0ee13788be51ca4ba6cddb0719',1,'threaded_binary_trees.c']]], + ['preorder_5fdisplay_393',['preorder_display',['../df/d3c/threaded__binary__trees_8c.html#a8169ba0dfd5b8183672e444d1434bf9c',1,'threaded_binary_trees.c']]], + ['print_394',['print',['../dc/d80/cantor__set_8c.html#a75ee530cd7148a63249784ad3dda8fab',1,'print(CantorSet *head): cantor_set.c'],['../d5/df4/group__sudoku.html#ga702ff4f95dde780c7d04fcdd1021b6c1',1,'print(const struct sudoku *a): sudoku_solver.c']]], + ['print_5fmatrix_395',['print_matrix',['../d4/d68/qr__decompose_8h.html#a90562ce8c3707401e9c5809dece68d6a',1,'qr_decompose.h']]], + ['print_5fnumber_396',['print_number',['../db/d01/problem__13_2sol1_8c.html#a248adc917818cc6666d8bc679a660319',1,'print_number(uint8_t *number, uint8_t N, int8_t num_digits_to_print): sol1.c'],['../d8/d32/problem__25_2sol1_8c.html#abe5bc1f170b2108a19d0a16d30bd3235',1,'print_number(unsigned char *number, int N): sol1.c']]], + ['problem_397',['problem',['../d4/d07/ode__forward__euler_8c.html#a97075291390a68c262ed66e157a57eb4',1,'problem(const double *x, double *y, double *dy): ode_forward_euler.c'],['../d1/dc2/ode__midpoint__euler_8c.html#a97075291390a68c262ed66e157a57eb4',1,'problem(const double *x, double *y, double *dy): ode_midpoint_euler.c'],['../d4/d99/ode__semi__implicit__euler_8c.html#a97075291390a68c262ed66e157a57eb4',1,'problem(const double *x, double *y, double *dy): ode_semi_implicit_euler.c']]], + ['propagate_398',['propagate',['../dc/d80/cantor__set_8c.html#a1f156d2b53b80305bd2fa3ff5fdf3c97',1,'cantor_set.c']]] ]; diff --git a/search/groups_0.js b/search/groups_0.js index ba16767a..89a1824b 100644 --- a/search/groups_0.js +++ b/search/groups_0.js @@ -1,4 +1,4 @@ var searchData= [ - ['adaline_20learning_20algorithm_478',['Adaline learning algorithm',['../da/d2a/group__adaline.html',1,'']]] + ['adaline_20learning_20algorithm_474',['Adaline learning algorithm',['../da/d2a/group__adaline.html',1,'']]] ]; diff --git a/search/groups_1.js b/search/groups_1.js index b85db47a..78125b8f 100644 --- a/search/groups_1.js +++ b/search/groups_1.js @@ -1,5 +1,5 @@ var searchData= [ - ['kohonen_20som_20trace_2fchain_20algorithm_479',['Kohonen SOM trace/chain algorithm',['../d0/dcb/group__kohonen__1d.html',1,'']]], - ['kohonen_20som_20topology_20algorithm_480',['Kohonen SOM topology algorithm',['../d1/d6b/group__kohonen__2d.html',1,'']]] + ['kohonen_20som_20trace_2fchain_20algorithm_475',['Kohonen SOM trace/chain algorithm',['../d0/dcb/group__kohonen__1d.html',1,'']]], + ['kohonen_20som_20topology_20algorithm_476',['Kohonen SOM topology algorithm',['../d1/d6b/group__kohonen__2d.html',1,'']]] ]; diff --git a/search/groups_2.js b/search/groups_2.js index d747bf32..5386444d 100644 --- a/search/groups_2.js +++ b/search/groups_2.js @@ -1,4 +1,4 @@ var searchData= [ - ['machine_20learning_20algorithms_481',['Machine learning algorithms',['../d9/d66/group__machine__learning.html',1,'']]] + ['machine_20learning_20algorithms_477',['Machine learning algorithms',['../d9/d66/group__machine__learning.html',1,'']]] ]; diff --git a/search/groups_3.js b/search/groups_3.js index 934bd4e0..6a0e8aad 100644 --- a/search/groups_3.js +++ b/search/groups_3.js @@ -1,5 +1,5 @@ var searchData= [ - ['sorting_20algorithms_482',['Sorting algorithms',['../d5/d4c/group__sorting.html',1,'']]], - ['sudoku_20solver_483',['Sudoku solver',['../d5/df4/group__sudoku.html',1,'']]] + ['sorting_20algorithms_478',['Sorting algorithms',['../d5/d4c/group__sorting.html',1,'']]], + ['sudoku_20solver_479',['Sudoku solver',['../d5/df4/group__sudoku.html',1,'']]] ]; diff --git a/search/pages_0.js b/search/pages_0.js index fbb8fea8..606b3d86 100644 --- a/search/pages_0.js +++ b/search/pages_0.js @@ -1,4 +1,4 @@ var searchData= [ - ['array_484',['Array',['../d9/d41/md_data_structures_array__r_e_a_d_m_e.html',1,'']]] + ['array_480',['Array',['../d9/d41/md_data_structures_array__r_e_a_d_m_e.html',1,'']]] ]; diff --git a/search/pages_1.js b/search/pages_1.js index 1a191db3..1a46a739 100644 --- a/search/pages_1.js +++ b/search/pages_1.js @@ -1,4 +1,4 @@ var searchData= [ - ['code_20style_20convention_485',['Code style convention',['../dc/d64/md__coding_guidelines.html',1,'']]] + ['code_20style_20convention_481',['Code style convention',['../dc/d64/md__coding_guidelines.html',1,'']]] ]; diff --git a/search/pages_2.js b/search/pages_2.js index 4f120b33..727552e2 100644 --- a/search/pages_2.js +++ b/search/pages_2.js @@ -1,4 +1,4 @@ var searchData= [ - ['dictionary_486',['Dictionary',['../de/d20/md_data_structures_dictionary__r_e_a_d_m_e.html',1,'']]] + ['dictionary_482',['Dictionary',['../de/d20/md_data_structures_dictionary__r_e_a_d_m_e.html',1,'']]] ]; diff --git a/search/pages_3.js b/search/pages_3.js index 11cf06fe..9cf496c8 100644 --- a/search/pages_3.js +++ b/search/pages_3.js @@ -1,4 +1,4 @@ var searchData= [ - ['hash_20algorithms_487',['Hash algorithms',['../d4/dcb/md_hash__r_e_a_d_m_e.html',1,'']]] + ['hash_20algorithms_483',['Hash algorithms',['../d4/dcb/md_hash__r_e_a_d_m_e.html',1,'']]] ]; diff --git a/search/pages_4.js b/search/pages_4.js index a6824668..6595c115 100644 --- a/search/pages_4.js +++ b/search/pages_4.js @@ -1,5 +1,5 @@ var searchData= [ - ['list_20of_20all_20files_488',['List of all files',['../d5/d88/md__d_i_r_e_c_t_o_r_y.html',1,'']]], - ['leetcode_489',['LeetCode',['../df/d58/md_leetcode__r_e_a_d_m_e.html',1,'']]] + ['list_20of_20all_20files_484',['List of all files',['../d5/d88/md__d_i_r_e_c_t_o_r_y.html',1,'']]], + ['leetcode_485',['LeetCode',['../df/d58/md_leetcode__r_e_a_d_m_e.html',1,'']]] ]; diff --git a/search/pages_5.js b/search/pages_5.js index b2a6d8bd..24de0798 100644 --- a/search/pages_5.js +++ b/search/pages_5.js @@ -1,4 +1,4 @@ var searchData= [ - ['projecteuler_490',['ProjectEuler',['../d8/d81/md_project_euler__r_e_a_d_m_e.html',1,'']]] + ['projecteuler_486',['ProjectEuler',['../d8/d81/md_project_euler__r_e_a_d_m_e.html',1,'']]] ]; diff --git a/search/pages_6.js b/search/pages_6.js index c4d7af8a..75be9546 100644 --- a/search/pages_6.js +++ b/search/pages_6.js @@ -1,5 +1,5 @@ var searchData= [ - ['simple_20generic_20stack_491',['Simple generic Stack',['../d1/d12/md_data_structures_stack__r_e_a_d_m_e.html',1,'']]], - ['sample_20solutions_20for_20_3ca_20href_3d_22http_3a_2f_2fexercism_2eio_2f_22_3eexercism_2eio_3c_2fa_3e_492',['Sample solutions for <a href="http://exercism.io/">exercism.io</a>',['../d7/db5/md_exercism__r_e_a_d_m_e.html',1,'']]] + ['simple_20generic_20stack_487',['Simple generic Stack',['../d1/d12/md_data_structures_stack__r_e_a_d_m_e.html',1,'']]], + ['sample_20solutions_20for_20_3ca_20href_3d_22http_3a_2f_2fexercism_2eio_2f_22_3eexercism_2eio_3c_2fa_3e_488',['Sample solutions for <a href="http://exercism.io/">exercism.io</a>',['../d7/db5/md_exercism__r_e_a_d_m_e.html',1,'']]] ]; diff --git a/search/pages_7.js b/search/pages_7.js index d6ebc17a..6acd3352 100644 --- a/search/pages_7.js +++ b/search/pages_7.js @@ -1,4 +1,4 @@ var searchData= [ - ['the_20algorithms_20_2d_20c_493',['The Algorithms - C',['../index.html',1,'']]] + ['the_20algorithms_20_2d_20c_489',['The Algorithms - C',['../index.html',1,'']]] ]; diff --git a/search/searchdata.js b/search/searchdata.js index 523c78bb..52cfc616 100644 --- a/search/searchdata.js +++ b/search/searchdata.js @@ -4,9 +4,9 @@ var indexSectionsWithContent = 1: "_abcdeghklmnpqstw", 2: "abcdfjklmnopqrstu", 3: "_abcdefgijklmnopqrstv", - 4: "adelmnprsvw", + 4: "adelnprsvw", 5: "bcln", - 6: "_aelmno", + 6: "_aelmo", 7: "akms", 8: "acdhlpst" }; diff --git a/search/typedefs_0.js b/search/typedefs_0.js index 7555d49f..f276cb70 100644 --- a/search/typedefs_0.js +++ b/search/typedefs_0.js @@ -1,4 +1,4 @@ var searchData= [ - ['big_5fint_458',['big_int',['../db/d80/problem__20_2sol1_8c.html#a62cbbd106aad52daadb9403a07d0da32',1,'sol1.c']]] + ['big_5fint_456',['big_int',['../db/d80/problem__20_2sol1_8c.html#a62cbbd106aad52daadb9403a07d0da32',1,'sol1.c']]] ]; diff --git a/search/typedefs_1.js b/search/typedefs_1.js index 07d64b73..81b76cb6 100644 --- a/search/typedefs_1.js +++ b/search/typedefs_1.js @@ -1,4 +1,4 @@ var searchData= [ - ['cantorset_459',['CantorSet',['../dc/d80/cantor__set_8c.html#a2b95c356aff8a282eaad255008fa5a94',1,'cantor_set.c']]] + ['cantorset_457',['CantorSet',['../dc/d80/cantor__set_8c.html#a2b95c356aff8a282eaad255008fa5a94',1,'cantor_set.c']]] ]; diff --git a/search/typedefs_2.js b/search/typedefs_2.js index cb29f997..26161e5f 100644 --- a/search/typedefs_2.js +++ b/search/typedefs_2.js @@ -1,4 +1,4 @@ var searchData= [ - ['large_5fnum_460',['large_num',['../d6/d3d/factorial__large__number_8c.html#ab54882961780c41a4929a6d390f6522d',1,'factorial_large_number.c']]] + ['large_5fnum_458',['large_num',['../d6/d3d/factorial__large__number_8c.html#ab54882961780c41a4929a6d390f6522d',1,'factorial_large_number.c']]] ]; diff --git a/search/typedefs_3.js b/search/typedefs_3.js index 99a228d0..04fc7a90 100644 --- a/search/typedefs_3.js +++ b/search/typedefs_3.js @@ -1,4 +1,4 @@ var searchData= [ - ['node_461',['node',['../df/d3c/threaded__binary__trees_8c.html#ad8ecdcce462dd8e170ae1f164935aaa6',1,'threaded_binary_trees.c']]] + ['node_459',['node',['../df/d3c/threaded__binary__trees_8c.html#ad8ecdcce462dd8e170ae1f164935aaa6',1,'threaded_binary_trees.c']]] ]; diff --git a/search/variables_0.js b/search/variables_0.js index 239f2d2d..dc181a1a 100644 --- a/search/variables_0.js +++ b/search/variables_0.js @@ -1,5 +1,5 @@ var searchData= [ - ['a_436',['a',['../dc/d18/structsudoku.html#a507f788b793d4d3d6f6a70415be84ded',1,'sudoku']]], - ['abundant_5fflags_437',['abundant_flags',['../d4/dbd/problem__23_2sol2_8c.html#af920a16d6ef69dd604b283f427892e06',1,'sol2.c']]] + ['a_435',['a',['../dc/d18/structsudoku.html#a507f788b793d4d3d6f6a70415be84ded',1,'sudoku']]], + ['abundant_5fflags_436',['abundant_flags',['../d4/dbd/problem__23_2sol2_8c.html#af920a16d6ef69dd604b283f427892e06',1,'sol2.c']]] ]; diff --git a/search/variables_1.js b/search/variables_1.js index f0795e2c..dc0b2cef 100644 --- a/search/variables_1.js +++ b/search/variables_1.js @@ -1,8 +1,8 @@ var searchData= [ - ['data_438',['data',['../db/d8b/struct_node.html#a87c003c9f600e3fc58e6e90835f0b605',1,'Node::data()'],['../d8/db8/structkohonen__array__3d.html#ad546baa2e81c6196d5f1dc0fe2e5bd59',1,'kohonen_array_3d::data()']]], - ['digits_439',['digits',['../d3/d5a/struct__large__num.html#afaf353a072cf050ac86ac6e39868bcc9',1,'_large_num']]], - ['dim1_440',['dim1',['../d8/db8/structkohonen__array__3d.html#a16720581653fa9a34d1029e7229a7377',1,'kohonen_array_3d']]], - ['dim2_441',['dim2',['../d8/db8/structkohonen__array__3d.html#a888d7e007b38c91c7933e12a9566af1d',1,'kohonen_array_3d']]], - ['dim3_442',['dim3',['../d8/db8/structkohonen__array__3d.html#a160f14830bdfbbf9f422f382ee754dbf',1,'kohonen_array_3d']]] + ['data_437',['data',['../db/d8b/struct_node.html#a87c003c9f600e3fc58e6e90835f0b605',1,'Node::data()'],['../d8/db8/structkohonen__array__3d.html#ad546baa2e81c6196d5f1dc0fe2e5bd59',1,'kohonen_array_3d::data()']]], + ['digits_438',['digits',['../d3/d5a/struct__large__num.html#afaf353a072cf050ac86ac6e39868bcc9',1,'_large_num']]], + ['dim1_439',['dim1',['../d8/db8/structkohonen__array__3d.html#a16720581653fa9a34d1029e7229a7377',1,'kohonen_array_3d']]], + ['dim2_440',['dim2',['../d8/db8/structkohonen__array__3d.html#a888d7e007b38c91c7933e12a9566af1d',1,'kohonen_array_3d']]], + ['dim3_441',['dim3',['../d8/db8/structkohonen__array__3d.html#a160f14830bdfbbf9f422f382ee754dbf',1,'kohonen_array_3d']]] ]; diff --git a/search/variables_2.js b/search/variables_2.js index 2424b096..a171a949 100644 --- a/search/variables_2.js +++ b/search/variables_2.js @@ -1,5 +1,5 @@ var searchData= [ - ['end_443',['end',['../d9/dd7/struct__cantor__set.html#acfc25ab716a3c79be8a5a4cab94e8def',1,'_cantor_set']]], - ['eta_444',['eta',['../d2/daa/structadaline.html#a85dbd7cce6195d11ebb388220b96bde2',1,'adaline']]] + ['end_442',['end',['../d9/dd7/struct__cantor__set.html#acfc25ab716a3c79be8a5a4cab94e8def',1,'_cantor_set']]], + ['eta_443',['eta',['../d2/daa/structadaline.html#a85dbd7cce6195d11ebb388220b96bde2',1,'adaline']]] ]; diff --git a/search/variables_3.js b/search/variables_3.js index 234a2f8c..069b52a8 100644 --- a/search/variables_3.js +++ b/search/variables_3.js @@ -1,4 +1,4 @@ var searchData= [ - ['llink_445',['llink',['../db/d8b/struct_node.html#a60b73f452505cef98795d2c8de3e72ef',1,'Node']]] + ['llink_444',['llink',['../db/d8b/struct_node.html#a60b73f452505cef98795d2c8de3e72ef',1,'Node']]] ]; diff --git a/search/variables_4.js b/search/variables_4.js index 7cfc4241..9084a6d9 100644 --- a/search/variables_4.js +++ b/search/variables_4.js @@ -1,4 +1,9 @@ var searchData= [ - ['max_5fn_446',['MAX_N',['../d7/ddb/problem__23_2sol1_8c.html#a337e545af040d754dc012b42523ee1ee',1,'MAX_N(): sol1.c'],['../d4/dbd/problem__23_2sol2_8c.html#a8c7ddb39906f281b801f2cd58d416c2b',1,'MAX_N(): sol2.c']]] + ['n_445',['N',['../dc/d18/structsudoku.html#a160365012280c3e10f1b31e914e8f129',1,'sudoku']]], + ['n2_446',['N2',['../dc/d18/structsudoku.html#a0f01e2782e82306e6fab9a8578006f56',1,'sudoku']]], + ['next_447',['next',['../d9/dd7/struct__cantor__set.html#a2f7f9f19125725d3e5673fdb4ac8cfb1',1,'_cantor_set']]], + ['next_5fdigit_448',['next_digit',['../dc/d77/struct__big__int.html#a187538b984c86d7cfdb13e297e7f3564',1,'_big_int']]], + ['num_5fdigits_449',['num_digits',['../d3/d5a/struct__large__num.html#a3fd11c0b413bbabfb8737d4ae73e5aa0',1,'_large_num']]], + ['num_5fweights_450',['num_weights',['../d2/daa/structadaline.html#a53314e737a0a5ff4552a03bcc9dafbc1',1,'adaline']]] ]; diff --git a/search/variables_5.js b/search/variables_5.js index add6723a..3f9e6872 100644 --- a/search/variables_5.js +++ b/search/variables_5.js @@ -1,9 +1,4 @@ var searchData= [ - ['n_447',['N',['../dc/d18/structsudoku.html#a160365012280c3e10f1b31e914e8f129',1,'sudoku']]], - ['n2_448',['N2',['../dc/d18/structsudoku.html#a0f01e2782e82306e6fab9a8578006f56',1,'sudoku']]], - ['next_449',['next',['../d9/dd7/struct__cantor__set.html#a2f7f9f19125725d3e5673fdb4ac8cfb1',1,'_cantor_set']]], - ['next_5fdigit_450',['next_digit',['../dc/d77/struct__big__int.html#a187538b984c86d7cfdb13e297e7f3564',1,'_big_int']]], - ['num_5fdigits_451',['num_digits',['../d3/d5a/struct__large__num.html#a3fd11c0b413bbabfb8737d4ae73e5aa0',1,'_large_num']]], - ['num_5fweights_452',['num_weights',['../d2/daa/structadaline.html#a53314e737a0a5ff4552a03bcc9dafbc1',1,'adaline']]] + ['prev_5fdigit_451',['prev_digit',['../dc/d77/struct__big__int.html#ad8405989a924410942b39ec0e9fef30b',1,'_big_int']]] ]; diff --git a/search/variables_6.js b/search/variables_6.js index cb690bc9..54ae5704 100644 --- a/search/variables_6.js +++ b/search/variables_6.js @@ -1,4 +1,4 @@ var searchData= [ - ['prev_5fdigit_453',['prev_digit',['../dc/d77/struct__big__int.html#ad8405989a924410942b39ec0e9fef30b',1,'_big_int']]] + ['rlink_452',['rlink',['../db/d8b/struct_node.html#a0ed3c7305b43527f0f237bbfd438b8f7',1,'Node']]] ]; diff --git a/search/variables_7.js b/search/variables_7.js index 09fdb44a..dc39547e 100644 --- a/search/variables_7.js +++ b/search/variables_7.js @@ -1,4 +1,4 @@ var searchData= [ - ['rlink_454',['rlink',['../db/d8b/struct_node.html#a0ed3c7305b43527f0f237bbfd438b8f7',1,'Node']]] + ['start_453',['start',['../d9/dd7/struct__cantor__set.html#abd2176c3cc3a1d85d15bbeaace35fa03',1,'_cantor_set']]] ]; diff --git a/search/variables_8.js b/search/variables_8.js index 30af79ee..3e96ce7f 100644 --- a/search/variables_8.js +++ b/search/variables_8.js @@ -1,4 +1,4 @@ var searchData= [ - ['start_455',['start',['../d9/dd7/struct__cantor__set.html#abd2176c3cc3a1d85d15bbeaace35fa03',1,'_cantor_set']]] + ['value_454',['value',['../dc/d77/struct__big__int.html#a273ee73fd755f2a99512cca5f0e09008',1,'_big_int']]] ]; diff --git a/search/variables_9.js b/search/variables_9.js index ab8c8bd7..b9cbc4a7 100644 --- a/search/variables_9.js +++ b/search/variables_9.js @@ -1,4 +1,4 @@ var searchData= [ - ['value_456',['value',['../dc/d77/struct__big__int.html#a273ee73fd755f2a99512cca5f0e09008',1,'_big_int']]] + ['weights_455',['weights',['../d2/daa/structadaline.html#a32e58c03fd9258709eae6138ad0ec657',1,'adaline']]] ];