silicium 0.0.2

Sign up to get free protection for your applications and to get access to all the features.
Files changed (86) hide show
  1. checksums.yaml +7 -0
  2. data/.codeclimate.yml +4 -0
  3. data/.gitignore +13 -0
  4. data/.travis.yml +25 -0
  5. data/CODE_OF_CONDUCT.md +74 -0
  6. data/Gemfile +8 -0
  7. data/LICENSE.txt +21 -0
  8. data/Makefile +269 -0
  9. data/README.md +46 -0
  10. data/Rakefile +17 -0
  11. data/bin/console +14 -0
  12. data/bin/setup +8 -0
  13. data/docs/Object.html +117 -0
  14. data/docs/README_md.html +142 -0
  15. data/docs/Silicium/Combinatorics.html +270 -0
  16. data/docs/Silicium/Dice/Polyhedron.html +315 -0
  17. data/docs/Silicium/Dice/PolyhedronSet.html +321 -0
  18. data/docs/Silicium/Dice.html +99 -0
  19. data/docs/Silicium/Error.html +106 -0
  20. data/docs/Silicium/Geometry/Line2dCanon.html +243 -0
  21. data/docs/Silicium/Geometry/VariablesOrderException.html +106 -0
  22. data/docs/Silicium/Geometry.html +940 -0
  23. data/docs/Silicium/Graphs/GraphError.html +106 -0
  24. data/docs/Silicium/Graphs/OrientedGraph.html +775 -0
  25. data/docs/Silicium/Graphs/UnorientedGraph.html +284 -0
  26. data/docs/Silicium/Graphs.html +164 -0
  27. data/docs/Silicium/IntegralDoesntExistError.html +106 -0
  28. data/docs/Silicium/NumericalIntegration.html +521 -0
  29. data/docs/Silicium/Optimization.html +639 -0
  30. data/docs/Silicium/Plotter/Image.html +297 -0
  31. data/docs/Silicium/Plotter.html +186 -0
  32. data/docs/Silicium.html +101 -0
  33. data/docs/created.rid +9 -0
  34. data/docs/css/fonts.css +167 -0
  35. data/docs/css/rdoc.css +619 -0
  36. data/docs/fonts/Lato-Light.ttf +0 -0
  37. data/docs/fonts/Lato-LightItalic.ttf +0 -0
  38. data/docs/fonts/Lato-Regular.ttf +0 -0
  39. data/docs/fonts/Lato-RegularItalic.ttf +0 -0
  40. data/docs/fonts/SourceCodePro-Bold.ttf +0 -0
  41. data/docs/fonts/SourceCodePro-Regular.ttf +0 -0
  42. data/docs/images/add.png +0 -0
  43. data/docs/images/arrow_up.png +0 -0
  44. data/docs/images/brick.png +0 -0
  45. data/docs/images/brick_link.png +0 -0
  46. data/docs/images/bug.png +0 -0
  47. data/docs/images/bullet_black.png +0 -0
  48. data/docs/images/bullet_toggle_minus.png +0 -0
  49. data/docs/images/bullet_toggle_plus.png +0 -0
  50. data/docs/images/date.png +0 -0
  51. data/docs/images/delete.png +0 -0
  52. data/docs/images/find.png +0 -0
  53. data/docs/images/loadingAnimation.gif +0 -0
  54. data/docs/images/macFFBgHack.png +0 -0
  55. data/docs/images/package.png +0 -0
  56. data/docs/images/page_green.png +0 -0
  57. data/docs/images/page_white_text.png +0 -0
  58. data/docs/images/page_white_width.png +0 -0
  59. data/docs/images/plugin.png +0 -0
  60. data/docs/images/ruby.png +0 -0
  61. data/docs/images/tag_blue.png +0 -0
  62. data/docs/images/tag_green.png +0 -0
  63. data/docs/images/transparent.png +0 -0
  64. data/docs/images/wrench.png +0 -0
  65. data/docs/images/wrench_orange.png +0 -0
  66. data/docs/images/zoom.png +0 -0
  67. data/docs/index.html +132 -0
  68. data/docs/js/darkfish.js +84 -0
  69. data/docs/js/navigation.js +105 -0
  70. data/docs/js/navigation.js.gz +0 -0
  71. data/docs/js/search.js +110 -0
  72. data/docs/js/search_index.js +1 -0
  73. data/docs/js/search_index.js.gz +0 -0
  74. data/docs/js/searcher.js +229 -0
  75. data/docs/js/searcher.js.gz +0 -0
  76. data/docs/table_of_contents.html +608 -0
  77. data/lib/geometry.rb +236 -0
  78. data/lib/graph.rb +164 -0
  79. data/lib/numerical_integration.rb +147 -0
  80. data/lib/optimization.rb +144 -0
  81. data/lib/plotter.rb +96 -0
  82. data/lib/silicium/version.rb +3 -0
  83. data/lib/silicium.rb +5 -0
  84. data/lib/theory_of_probability.rb +227 -0
  85. data/silicium.gemspec +39 -0
  86. metadata +185 -0
data/docs/index.html ADDED
@@ -0,0 +1,132 @@
1
+ <!DOCTYPE html>
2
+
3
+ <html>
4
+ <head>
5
+ <meta charset="UTF-8">
6
+
7
+ <title>RDoc Documentation</title>
8
+
9
+ <script type="text/javascript">
10
+ var rdoc_rel_prefix = "./";
11
+ var index_rel_prefix = "./";
12
+ </script>
13
+
14
+ <script src="./js/navigation.js" defer></script>
15
+ <script src="./js/search.js" defer></script>
16
+ <script src="./js/search_index.js" defer></script>
17
+ <script src="./js/searcher.js" defer></script>
18
+ <script src="./js/darkfish.js" defer></script>
19
+
20
+ <link href="./css/fonts.css" rel="stylesheet">
21
+ <link href="./css/rdoc.css" rel="stylesheet">
22
+
23
+
24
+
25
+
26
+ <body id="top" role="document" class="file">
27
+ <nav role="navigation">
28
+ <div id="project-navigation">
29
+ <div id="home-section" role="region" title="Quick navigation" class="nav-section">
30
+ <h2>
31
+ <a href="./index.html" rel="home">Home</a>
32
+ </h2>
33
+
34
+ <div id="table-of-contents-navigation">
35
+ <a href="./table_of_contents.html#pages">Pages</a>
36
+ <a href="./table_of_contents.html#classes">Classes</a>
37
+ <a href="./table_of_contents.html#methods">Methods</a>
38
+ </div>
39
+ </div>
40
+
41
+
42
+ <div id="search-section" role="search" class="project-section initially-hidden">
43
+ <form action="#" method="get" accept-charset="utf-8">
44
+ <div id="search-field-wrapper">
45
+ <input id="search-field" role="combobox" aria-label="Search"
46
+ aria-autocomplete="list" aria-controls="search-results"
47
+ type="text" name="search" placeholder="Search" spellcheck="false"
48
+ title="Type to search, Up and Down to navigate, Enter to load">
49
+ </div>
50
+
51
+ <ul id="search-results" aria-label="Search Results"
52
+ aria-busy="false" aria-expanded="false"
53
+ aria-atomic="false" class="initially-hidden"></ul>
54
+ </form>
55
+ </div>
56
+
57
+ </div>
58
+
59
+ <div id="project-metadata">
60
+ <div id="fileindex-section" class="nav-section">
61
+ <h3>Pages</h3>
62
+
63
+ <ul class="link-list">
64
+
65
+ <li><a href="./README_md.html">README</a>
66
+
67
+ </ul>
68
+ </div>
69
+
70
+ <div id="classindex-section" class="nav-section">
71
+ <h3>Class and Module Index</h3>
72
+
73
+ <ul class="link-list">
74
+
75
+ <li><a href="./Object.html">Object</a>
76
+
77
+ <li><a href="./Silicium.html">Silicium</a>
78
+
79
+ <li><a href="./Silicium/Combinatorics.html">Silicium::Combinatorics</a>
80
+
81
+ <li><a href="./Silicium/Dice.html">Silicium::Dice</a>
82
+
83
+ <li><a href="./Silicium/Dice/Polyhedron.html">Silicium::Dice::Polyhedron</a>
84
+
85
+ <li><a href="./Silicium/Dice/PolyhedronSet.html">Silicium::Dice::PolyhedronSet</a>
86
+
87
+ <li><a href="./Silicium/Error.html">Silicium::Error</a>
88
+
89
+ <li><a href="./Silicium/Geometry.html">Silicium::Geometry</a>
90
+
91
+ <li><a href="./Silicium/Geometry/Line2dCanon.html">Silicium::Geometry::Line2dCanon</a>
92
+
93
+ <li><a href="./Silicium/Geometry/VariablesOrderException.html">Silicium::Geometry::VariablesOrderException</a>
94
+
95
+ <li><a href="./Silicium/Graphs.html">Silicium::Graphs</a>
96
+
97
+ <li><a href="./Silicium/Graphs/GraphError.html">Silicium::Graphs::GraphError</a>
98
+
99
+ <li><a href="./Silicium/Graphs/OrientedGraph.html">Silicium::Graphs::OrientedGraph</a>
100
+
101
+ <li><a href="./Silicium/Graphs/UnorientedGraph.html">Silicium::Graphs::UnorientedGraph</a>
102
+
103
+ <li><a href="./Silicium/IntegralDoesntExistError.html">Silicium::IntegralDoesntExistError</a>
104
+
105
+ <li><a href="./Silicium/NumericalIntegration.html">Silicium::NumericalIntegration</a>
106
+
107
+ <li><a href="./Silicium/Optimization.html">Silicium::Optimization</a>
108
+
109
+ <li><a href="./Silicium/Plotter.html">Silicium::Plotter</a>
110
+
111
+ <li><a href="./Silicium/Plotter/Image.html">Silicium::Plotter::Image</a>
112
+
113
+ </ul>
114
+ </div>
115
+
116
+ </div>
117
+ </nav>
118
+
119
+ <main role="main">
120
+
121
+ <p>This is the API documentation for RDoc Documentation.
122
+
123
+ </main>
124
+
125
+
126
+
127
+ <footer id="validator-badges" role="contentinfo">
128
+ <p><a href="https://validator.w3.org/check/referer">Validate</a>
129
+ <p>Generated by <a href="https://ruby.github.io/rdoc/">RDoc</a> 6.2.0.
130
+ <p>Based on <a href="http://deveiate.org/projects/Darkfish-RDoc/">Darkfish</a> by <a href="http://deveiate.org">Michael Granger</a>.
131
+ </footer>
132
+
@@ -0,0 +1,84 @@
1
+ /**
2
+ *
3
+ * Darkfish Page Functions
4
+ * $Id: darkfish.js 53 2009-01-07 02:52:03Z deveiant $
5
+ *
6
+ * Author: Michael Granger <mgranger@laika.com>
7
+ *
8
+ */
9
+
10
+ /* Provide console simulation for firebug-less environments */
11
+ /*
12
+ if (!("console" in window) || !("firebug" in console)) {
13
+ var names = ["log", "debug", "info", "warn", "error", "assert", "dir", "dirxml",
14
+ "group", "groupEnd", "time", "timeEnd", "count", "trace", "profile", "profileEnd"];
15
+
16
+ window.console = {};
17
+ for (var i = 0; i < names.length; ++i)
18
+ window.console[names[i]] = function() {};
19
+ };
20
+ */
21
+
22
+
23
+ function showSource( e ) {
24
+ var target = e.target;
25
+ while (!target.classList.contains('method-detail')) {
26
+ target = target.parentNode;
27
+ }
28
+ if (typeof target !== "undefined" && target !== null) {
29
+ target = target.querySelector('.method-source-code');
30
+ }
31
+ if (typeof target !== "undefined" && target !== null) {
32
+ target.classList.toggle('active-menu')
33
+ }
34
+ };
35
+
36
+ function hookSourceViews() {
37
+ document.querySelectorAll('.method-heading').forEach(function (codeObject) {
38
+ codeObject.addEventListener('click', showSource);
39
+ });
40
+ };
41
+
42
+ function hookSearch() {
43
+ var input = document.querySelector('#search-field');
44
+ var result = document.querySelector('#search-results');
45
+ result.classList.remove("initially-hidden");
46
+
47
+ var search_section = document.querySelector('#search-section');
48
+ search_section.classList.remove("initially-hidden");
49
+
50
+ var search = new Search(search_data, input, result);
51
+
52
+ search.renderItem = function(result) {
53
+ var li = document.createElement('li');
54
+ var html = '';
55
+
56
+ // TODO add relative path to <script> per-page
57
+ html += '<p class="search-match"><a href="' + index_rel_prefix + result.path + '">' + this.hlt(result.title);
58
+ if (result.params)
59
+ html += '<span class="params">' + result.params + '</span>';
60
+ html += '</a>';
61
+
62
+
63
+ if (result.namespace)
64
+ html += '<p class="search-namespace">' + this.hlt(result.namespace);
65
+
66
+ if (result.snippet)
67
+ html += '<div class="search-snippet">' + result.snippet + '</div>';
68
+
69
+ li.innerHTML = html;
70
+
71
+ return li;
72
+ }
73
+
74
+ search.select = function(result) {
75
+ window.location.href = result.firstChild.firstChild.href;
76
+ }
77
+
78
+ search.scrollIntoView = search.scrollInWindow;
79
+ };
80
+
81
+ document.addEventListener('DOMContentLoaded', function() {
82
+ hookSourceViews();
83
+ hookSearch();
84
+ });
@@ -0,0 +1,105 @@
1
+ /*
2
+ * Navigation allows movement using the arrow keys through the search results.
3
+ *
4
+ * When using this library you will need to set scrollIntoView to the
5
+ * appropriate function for your layout. Use scrollInWindow if the container
6
+ * is not scrollable and scrollInElement if the container is a separate
7
+ * scrolling region.
8
+ */
9
+ Navigation = new function() {
10
+ this.initNavigation = function() {
11
+ var _this = this;
12
+
13
+ document.addEventListener('keydown', function(e) {
14
+ _this.onkeydown(e);
15
+ });
16
+
17
+ this.navigationActive = true;
18
+ }
19
+
20
+ this.setNavigationActive = function(state) {
21
+ this.navigationActive = state;
22
+ }
23
+
24
+ this.onkeydown = function(e) {
25
+ if (!this.navigationActive) return;
26
+ switch(e.keyCode) {
27
+ case 37: //Event.KEY_LEFT:
28
+ if (this.moveLeft()) e.preventDefault();
29
+ break;
30
+ case 38: //Event.KEY_UP:
31
+ if (e.keyCode == 38 || e.ctrlKey) {
32
+ if (this.moveUp()) e.preventDefault();
33
+ }
34
+ break;
35
+ case 39: //Event.KEY_RIGHT:
36
+ if (this.moveRight()) e.preventDefault();
37
+ break;
38
+ case 40: //Event.KEY_DOWN:
39
+ if (e.keyCode == 40 || e.ctrlKey) {
40
+ if (this.moveDown()) e.preventDefault();
41
+ }
42
+ break;
43
+ case 13: //Event.KEY_RETURN:
44
+ if (this.current) e.preventDefault();
45
+ this.select(this.current);
46
+ break;
47
+ }
48
+ if (e.ctrlKey && e.shiftKey) this.select(this.current);
49
+ }
50
+
51
+ this.moveRight = function() {
52
+ }
53
+
54
+ this.moveLeft = function() {
55
+ }
56
+
57
+ this.move = function(isDown) {
58
+ }
59
+
60
+ this.moveUp = function() {
61
+ return this.move(false);
62
+ }
63
+
64
+ this.moveDown = function() {
65
+ return this.move(true);
66
+ }
67
+
68
+ /*
69
+ * Scrolls to the given element in the scrollable element view.
70
+ */
71
+ this.scrollInElement = function(element, view) {
72
+ var offset, viewHeight, viewScroll, height;
73
+ offset = element.offsetTop;
74
+ height = element.offsetHeight;
75
+ viewHeight = view.offsetHeight;
76
+ viewScroll = view.scrollTop;
77
+
78
+ if (offset - viewScroll + height > viewHeight) {
79
+ view.scrollTop = offset - viewHeight + height;
80
+ }
81
+ if (offset < viewScroll) {
82
+ view.scrollTop = offset;
83
+ }
84
+ }
85
+
86
+ /*
87
+ * Scrolls to the given element in the window. The second argument is
88
+ * ignored
89
+ */
90
+ this.scrollInWindow = function(element, ignored) {
91
+ var offset, viewHeight, viewScroll, height;
92
+ offset = element.offsetTop;
93
+ height = element.offsetHeight;
94
+ viewHeight = window.innerHeight;
95
+ viewScroll = window.scrollY;
96
+
97
+ if (offset - viewScroll + height > viewHeight) {
98
+ window.scrollTo(window.scrollX, offset - viewHeight + height);
99
+ }
100
+ if (offset < viewScroll) {
101
+ window.scrollTo(window.scrollX, offset);
102
+ }
103
+ }
104
+ }
105
+
Binary file
data/docs/js/search.js ADDED
@@ -0,0 +1,110 @@
1
+ Search = function(data, input, result) {
2
+ this.data = data;
3
+ this.input = input;
4
+ this.result = result;
5
+
6
+ this.current = null;
7
+ this.view = this.result.parentNode;
8
+ this.searcher = new Searcher(data.index);
9
+ this.init();
10
+ }
11
+
12
+ Search.prototype = Object.assign({}, Navigation, new function() {
13
+ var suid = 1;
14
+
15
+ this.init = function() {
16
+ var _this = this;
17
+ var observer = function(e) {
18
+ switch(e.keyCode) {
19
+ case 38: // Event.KEY_UP
20
+ case 40: // Event.KEY_DOWN
21
+ return;
22
+ }
23
+ _this.search(_this.input.value);
24
+ };
25
+ this.input.addEventListener('keyup', observer);
26
+ this.input.addEventListener('click', observer); // mac's clear field
27
+
28
+ this.searcher.ready(function(results, isLast) {
29
+ _this.addResults(results, isLast);
30
+ })
31
+
32
+ this.initNavigation();
33
+ this.setNavigationActive(false);
34
+ }
35
+
36
+ this.search = function(value, selectFirstMatch) {
37
+ value = value.trim().toLowerCase();
38
+ if (value) {
39
+ this.setNavigationActive(true);
40
+ } else {
41
+ this.setNavigationActive(false);
42
+ }
43
+
44
+ if (value == '') {
45
+ this.lastQuery = value;
46
+ this.result.innerHTML = '';
47
+ this.result.setAttribute('aria-expanded', 'false');
48
+ this.setNavigationActive(false);
49
+ } else if (value != this.lastQuery) {
50
+ this.lastQuery = value;
51
+ this.result.setAttribute('aria-busy', 'true');
52
+ this.result.setAttribute('aria-expanded', 'true');
53
+ this.firstRun = true;
54
+ this.searcher.find(value);
55
+ }
56
+ }
57
+
58
+ this.addResults = function(results, isLast) {
59
+ var target = this.result;
60
+ if (this.firstRun && (results.length > 0 || isLast)) {
61
+ this.current = null;
62
+ this.result.innerHTML = '';
63
+ }
64
+
65
+ for (var i=0, l = results.length; i < l; i++) {
66
+ var item = this.renderItem.call(this, results[i]);
67
+ item.setAttribute('id', 'search-result-' + target.childElementCount);
68
+ target.appendChild(item);
69
+ };
70
+
71
+ if (this.firstRun && results.length > 0) {
72
+ this.firstRun = false;
73
+ this.current = target.firstChild;
74
+ this.current.classList.add('search-selected');
75
+ }
76
+ //TODO: ECMAScript
77
+ //if (jQuery.browser.msie) this.$element[0].className += '';
78
+
79
+ if (isLast) this.result.setAttribute('aria-busy', 'false');
80
+ }
81
+
82
+ this.move = function(isDown) {
83
+ if (!this.current) return;
84
+ var next = isDown ? this.current.nextElementSibling : this.current.previousElementSibling;
85
+ if (next) {
86
+ this.current.classList.remove('search-selected');
87
+ next.classList.add('search-selected');
88
+ this.input.setAttribute('aria-activedescendant', next.getAttribute('id'));
89
+ this.scrollIntoView(next, this.view);
90
+ this.current = next;
91
+ this.input.value = next.firstChild.firstChild.text;
92
+ this.input.select();
93
+ }
94
+ return true;
95
+ }
96
+
97
+ this.hlt = function(html) {
98
+ return this.escapeHTML(html).
99
+ replace(/\u0001/g, '<em>').
100
+ replace(/\u0002/g, '</em>');
101
+ }
102
+
103
+ this.escapeHTML = function(html) {
104
+ return html.replace(/[&<>]/g, function(c) {
105
+ return '&#' + c.charCodeAt(0) + ';';
106
+ });
107
+ }
108
+
109
+ });
110
+
@@ -0,0 +1 @@
1
+ var search_data = {"index":{"searchIndex":["object","silicium","combinatorics","dice","polyhedron","polyhedronset","error","geometry","line2dcanon","variablesorderexception","graphs","grapherror","orientedgraph","unorientedgraph","integraldoesntexisterror","numericalintegration","optimization","plotter","image","accuracy()","add_edge!()","add_edge!()","add_edge_force!()","add_vertex!()","adjacted_with()","arrangement()","bar_chart()","bogosort()","bogosort!()","clockwise()","color()","combination()","counter_clockwise()","csides()","cut_by_eq()","delete_edge!()","delete_edge!()","delete_vertex!()","dijkstra_algorythm()","directing_vector3d()","distance_point_line2d()","distance_point_line_equation2d()","distance_point_to_point2d()","distance_point_to_point3d()","edge_label_number()","edge_number()","edge_number()","export()","fact()","factorial()","get_edge_label()","get_vertex_label()","half_division()","half_division_step()","has_edge?()","has_vertex?()","height_point_3d()","hook_jeeves()","hook_jeeves_step()","insert_eq()","integrating_monte_carlo_base()","label_edge!()","label_edge!()","label_vertex!()","left_rect_integration()","left_rect_integration_n()","make_graph_by_plotter()","middle()","middle_rectangles()","middle_rectangles_with_a_segment()","minimal_convex_hull_2d()","needed_variables_order?()","new()","new()","new()","new()","new()","not_polygon?()","oriented_area()","percentage()","point_is_on_line?()","point_to_line_distance_3d()","process_cf()","process_free_member()","process_line_by_coordinates()","put_point_in_part()","re_lu()","rectangle()","sides()","sigmoid()","simpson_integration()","simpson_integration_with_a_segment()","sorted?()","switch_step()","three_eights_integration()","three_eights_integration_n()","throw()","throw()","to_s()","to_s()","trapezoid()","trapezoid_with_a_segment()","vector_length()","vectors_product()","vertex_label_number()","vertex_number()","readme"],"longSearchIndex":["object","silicium","silicium::combinatorics","silicium::dice","silicium::dice::polyhedron","silicium::dice::polyhedronset","silicium::error","silicium::geometry","silicium::geometry::line2dcanon","silicium::geometry::variablesorderexception","silicium::graphs","silicium::graphs::grapherror","silicium::graphs::orientedgraph","silicium::graphs::unorientedgraph","silicium::integraldoesntexisterror","silicium::numericalintegration","silicium::optimization","silicium::plotter","silicium::plotter::image","silicium::optimization#accuracy()","silicium::graphs::orientedgraph#add_edge!()","silicium::graphs::unorientedgraph#add_edge!()","silicium::graphs::orientedgraph#add_edge_force!()","silicium::graphs::orientedgraph#add_vertex!()","silicium::graphs::orientedgraph#adjacted_with()","silicium::combinatorics#arrangement()","silicium::plotter::image#bar_chart()","silicium::optimization#bogosort()","silicium::optimization#bogosort!()","silicium::geometry#clockwise()","silicium::plotter#color()","silicium::combinatorics#combination()","silicium::geometry#counter_clockwise()","silicium::dice::polyhedron#csides()","silicium::geometry#cut_by_eq()","silicium::graphs::orientedgraph#delete_edge!()","silicium::graphs::unorientedgraph#delete_edge!()","silicium::graphs::orientedgraph#delete_vertex!()","silicium::graphs#dijkstra_algorythm()","silicium::geometry#directing_vector3d()","silicium::geometry#distance_point_line2d()","silicium::geometry#distance_point_line_equation2d()","silicium::geometry#distance_point_to_point2d()","silicium::geometry#distance_point_to_point3d()","silicium::graphs::orientedgraph#edge_label_number()","silicium::graphs::orientedgraph#edge_number()","silicium::graphs::unorientedgraph#edge_number()","silicium::plotter::image#export()","silicium::combinatorics#fact()","silicium::combinatorics#factorial()","silicium::graphs::orientedgraph#get_edge_label()","silicium::graphs::orientedgraph#get_vertex_label()","silicium::optimization#half_division()","silicium::optimization#half_division_step()","silicium::graphs::orientedgraph#has_edge?()","silicium::graphs::orientedgraph#has_vertex?()","silicium::geometry#height_point_3d()","silicium::optimization#hook_jeeves()","silicium::optimization#hook_jeeves_step()","silicium::geometry#insert_eq()","silicium::optimization#integrating_monte_carlo_base()","silicium::graphs::orientedgraph#label_edge!()","silicium::graphs::unorientedgraph#label_edge!()","silicium::graphs::orientedgraph#label_vertex!()","silicium::numericalintegration::left_rect_integration()","silicium::numericalintegration::left_rect_integration_n()","silicium::dice::polyhedronset#make_graph_by_plotter()","silicium::optimization#middle()","silicium::numericalintegration::middle_rectangles()","silicium::numericalintegration::middle_rectangles_with_a_segment()","silicium::geometry#minimal_convex_hull_2d()","silicium::geometry#needed_variables_order?()","silicium::dice::polyhedron::new()","silicium::dice::polyhedronset::new()","silicium::geometry::line2dcanon::new()","silicium::graphs::orientedgraph::new()","silicium::plotter::image::new()","silicium::geometry#not_polygon?()","silicium::geometry#oriented_area()","silicium::dice::polyhedronset#percentage()","silicium::geometry::line2dcanon#point_is_on_line?()","silicium::geometry#point_to_line_distance_3d()","silicium::geometry#process_cf()","silicium::geometry#process_free_member()","silicium::geometry#process_line_by_coordinates()","silicium::geometry#put_point_in_part()","silicium::optimization#re_lu()","silicium::plotter::image#rectangle()","silicium::dice::polyhedron#sides()","silicium::optimization#sigmoid()","silicium::numericalintegration::simpson_integration()","silicium::numericalintegration::simpson_integration_with_a_segment()","silicium::optimization#sorted?()","silicium::optimization#switch_step()","silicium::numericalintegration::three_eights_integration()","silicium::numericalintegration::three_eights_integration_n()","silicium::dice::polyhedron#throw()","silicium::dice::polyhedronset#throw()","silicium::dice::polyhedron#to_s()","silicium::dice::polyhedronset#to_s()","silicium::numericalintegration::trapezoid()","silicium::numericalintegration::trapezoid_with_a_segment()","silicium::geometry#vector_length()","silicium::geometry#vectors_product()","silicium::graphs::orientedgraph#vertex_label_number()","silicium::graphs::orientedgraph#vertex_number()",""],"info":[["Object","","Object.html","",""],["Silicium","","Silicium.html","","<p>require &#39;set&#39; require &#39;silicium&#39;\n"],["Silicium::Combinatorics","","Silicium/Combinatorics.html","",""],["Silicium::Dice","","Silicium/Dice.html","",""],["Silicium::Dice::Polyhedron","","Silicium/Dice/Polyhedron.html","","<p>Class represents a polyhedron csides - number or sides sides - array of sides(unusual for custom polyhedrons) …\n"],["Silicium::Dice::PolyhedronSet","","Silicium/Dice/PolyhedronSet.html","","<p>Class represents a PolyhedronsSet percentage - hash with chances of getting definite score\n"],["Silicium::Error","","Silicium/Error.html","",""],["Silicium::Geometry","","Silicium/Geometry.html","",""],["Silicium::Geometry::Line2dCanon","","Silicium/Geometry/Line2dCanon.html","","<p>Class represents a line as equation y = k*x +b k - slope b - free_term in two-dimensional space\n"],["Silicium::Geometry::VariablesOrderException","","Silicium/Geometry/VariablesOrderException.html","",""],["Silicium::Graphs","","Silicium/Graphs.html","",""],["Silicium::Graphs::GraphError","","Silicium/Graphs/GraphError.html","",""],["Silicium::Graphs::OrientedGraph","","Silicium/Graphs/OrientedGraph.html","",""],["Silicium::Graphs::UnorientedGraph","","Silicium/Graphs/UnorientedGraph.html","",""],["Silicium::IntegralDoesntExistError","","Silicium/IntegralDoesntExistError.html","",""],["Silicium::NumericalIntegration","","Silicium/NumericalIntegration.html","","<p>A class providing numerical integration methods\n"],["Silicium::Optimization","","Silicium/Optimization.html","",""],["Silicium::Plotter","","Silicium/Plotter.html","",""],["Silicium::Plotter::Image","","Silicium/Plotter/Image.html","","<p>A class representing canvas for plotting bar charts and function graphs\n"],["accuracy","Silicium::Optimization","Silicium/Optimization.html#method-i-accuracy","(step)","<p>calculate current accuracy in Hook - Jeeves method\n"],["add_edge!","Silicium::Graphs::OrientedGraph","Silicium/Graphs/OrientedGraph.html#method-i-add_edge-21","(from, to)",""],["add_edge!","Silicium::Graphs::UnorientedGraph","Silicium/Graphs/UnorientedGraph.html#method-i-add_edge-21","(from, to)",""],["add_edge_force!","Silicium::Graphs::OrientedGraph","Silicium/Graphs/OrientedGraph.html#method-i-add_edge_force-21","(from, to)","<p>should only be used in constructor\n"],["add_vertex!","Silicium::Graphs::OrientedGraph","Silicium/Graphs/OrientedGraph.html#method-i-add_vertex-21","(vertex_id)",""],["adjacted_with","Silicium::Graphs::OrientedGraph","Silicium/Graphs/OrientedGraph.html#method-i-adjacted_with","(vertex)",""],["arrangement","Silicium::Combinatorics","Silicium/Combinatorics.html#method-i-arrangement","(n, k)","<p>Function A(n,k)\n"],["bar_chart","Silicium::Plotter::Image","Silicium/Plotter/Image.html#method-i-bar_chart","(bars, bar_width, bars_color = ChunkyPNG::Color('red @ 1.0'), axis_color = ChunkyPNG::Color::BLACK)","<p>Draws a bar chart in the plot using provided <code>bars</code>, each of them has width of <code>bar_width</code> and colored <code>bars_color</code> …\n"],["bogosort","Silicium::Optimization","Silicium/Optimization.html#method-i-bogosort","(a)","<p>fastest(but it is not exactly) sort\n"],["bogosort!","Silicium::Optimization","Silicium/Optimization.html#method-i-bogosort-21","(a)","<p>fastest(but it is not exactly) sort, modify sequance\n"],["clockwise","Silicium::Geometry","Silicium/Geometry.html#method-i-clockwise","(a, b, c)","<p>Determines if a clockwise crawl is performed for defined order of points\n"],["color","Silicium::Plotter","Silicium/Plotter.html#method-i-color","(*args)","<p>Factory method to return a color value, based on the arguments given.\n<p>@overload Color(r, g, b, a)\n\n<pre class=\"ruby\"><span class=\"ruby-ivar\">@param</span> <span class=\"ruby-operator\">...</span>\n</pre>\n"],["combination","Silicium::Combinatorics","Silicium/Combinatorics.html#method-i-combination","(n, k)","<p>Function C(n,k)\n"],["counter_clockwise","Silicium::Geometry","Silicium/Geometry.html#method-i-counter_clockwise","(a, b, c)","<p>Determines if a counter-clockwise crawl is performed for defined order of points\n"],["csides","Silicium::Dice::Polyhedron","Silicium/Dice/Polyhedron.html#method-i-csides","()",""],["cut_by_eq","Silicium::Geometry","Silicium/Geometry.html#method-i-cut_by_eq","(line_equation)",""],["delete_edge!","Silicium::Graphs::OrientedGraph","Silicium/Graphs/OrientedGraph.html#method-i-delete_edge-21","(from, to)",""],["delete_edge!","Silicium::Graphs::UnorientedGraph","Silicium/Graphs/UnorientedGraph.html#method-i-delete_edge-21","(from, to)",""],["delete_vertex!","Silicium::Graphs::OrientedGraph","Silicium/Graphs/OrientedGraph.html#method-i-delete_vertex-21","(vertex)",""],["dijkstra_algorythm","Silicium::Graphs","Silicium/Graphs.html#method-i-dijkstra_algorythm","(graph, starting_vertex)",""],["directing_vector3d","Silicium::Geometry","Silicium/Geometry.html#method-i-directing_vector3d","(line_equation)","<p>Creates an array- directing vector in three-dimensional space . The equation is specified in the canonical …\n"],["distance_point_line2d","Silicium::Geometry","Silicium/Geometry.html#method-i-distance_point_line2d","(p1, p2, a)","<p>The distance from a point to a line on a plane The line is defined by two points en.wikipedia.org/wiki/Distance_from_a_point_to_a_line …\n"],["distance_point_line_equation2d","Silicium::Geometry","Silicium/Geometry.html#method-i-distance_point_line_equation2d","(a, b, c, p)","<p>The distance from a point to a line on a plane Line defined by an equation return 0 if the equation does …\n"],["distance_point_to_point2d","Silicium::Geometry","Silicium/Geometry.html#method-i-distance_point_to_point2d","(a, b)","<p>Calculates the distance from given points in two-dimensional space\n"],["distance_point_to_point3d","Silicium::Geometry","Silicium/Geometry.html#method-i-distance_point_to_point3d","(a, b)","<p>Calculates the distance from given points in three-dimensional space\n"],["edge_label_number","Silicium::Graphs::OrientedGraph","Silicium/Graphs/OrientedGraph.html#method-i-edge_label_number","()",""],["edge_number","Silicium::Graphs::OrientedGraph","Silicium/Graphs/OrientedGraph.html#method-i-edge_number","()",""],["edge_number","Silicium::Graphs::UnorientedGraph","Silicium/Graphs/UnorientedGraph.html#method-i-edge_number","()",""],["export","Silicium::Plotter::Image","Silicium/Plotter/Image.html#method-i-export","(filename)","<p>Exports plotted image to file <code>filename</code>\n"],["fact","Silicium::Combinatorics","Silicium/Combinatorics.html#method-i-fact","(n, k)","<p>Factorial for counting 3 parameters in one run\n"],["factorial","Silicium::Combinatorics","Silicium/Combinatorics.html#method-i-factorial","(n)",""],["get_edge_label","Silicium::Graphs::OrientedGraph","Silicium/Graphs/OrientedGraph.html#method-i-get_edge_label","(from, to)",""],["get_vertex_label","Silicium::Graphs::OrientedGraph","Silicium/Graphs/OrientedGraph.html#method-i-get_vertex_label","(vertex)",""],["half_division","Silicium::Optimization","Silicium/Optimization.html#method-i-half_division","(a, b, eps = 0.001, &block)","<p>find root in [a, b], if he exist, if number of iterations &gt; iters -&gt; error\n"],["half_division_step","Silicium::Optimization","Silicium/Optimization.html#method-i-half_division_step","(a, b, c, &block)","<p>do one half division step\n"],["has_edge?","Silicium::Graphs::OrientedGraph","Silicium/Graphs/OrientedGraph.html#method-i-has_edge-3F","(from, to)",""],["has_vertex?","Silicium::Graphs::OrientedGraph","Silicium/Graphs/OrientedGraph.html#method-i-has_vertex-3F","(vertex)",""],["height_point_3d","Silicium::Geometry","Silicium/Geometry.html#method-i-height_point_3d","(line_equation)","<p>Creates an array of coordinates of the point ([x, y, z] on the line given by the equation in the canonical …\n"],["hook_jeeves","Silicium::Optimization","Silicium/Optimization.html#method-i-hook_jeeves","(x, step, eps = 0.1, &block)","<p>Hook - Jeeves method for find minimum point (x - array of start variables, step - step of one iteration, …\n"],["hook_jeeves_step","Silicium::Optimization","Silicium/Optimization.html#method-i-hook_jeeves_step","(x, i, step, &block)","<p>do one Hook - Jeeves step\n"],["insert_eq","Silicium::Geometry","Silicium/Geometry.html#method-i-insert_eq","(line_equation)",""],["integrating_Monte_Carlo_base","Silicium::Optimization","Silicium/Optimization.html#method-i-integrating_Monte_Carlo_base","(a, b, n = 100000, &block)","<p>integrating using method Monte Carlo (f - function, a, b - integrating limits, n - amount of random numbers) …\n"],["label_edge!","Silicium::Graphs::OrientedGraph","Silicium/Graphs/OrientedGraph.html#method-i-label_edge-21","(from, to, label)",""],["label_edge!","Silicium::Graphs::UnorientedGraph","Silicium/Graphs/UnorientedGraph.html#method-i-label_edge-21","(from, to, label)",""],["label_vertex!","Silicium::Graphs::OrientedGraph","Silicium/Graphs/OrientedGraph.html#method-i-label_vertex-21","(vertex, label)",""],["left_rect_integration","Silicium::NumericalIntegration","Silicium/NumericalIntegration.html#method-c-left_rect_integration","(left_p, right_p, eps = 0.0001, &block)","<p>Left Rectangle Method and Right Rectangle Method\n"],["left_rect_integration_n","Silicium::NumericalIntegration","Silicium/NumericalIntegration.html#method-c-left_rect_integration_n","(left_p, right_p, splits, &block)","<p>Left Rectangle Auxiliary Method and Right Rectangle Auxiliary Method\n"],["make_graph_by_plotter","Silicium::Dice::PolyhedronSet","Silicium/Dice/PolyhedronSet.html#method-i-make_graph_by_plotter","(x = percentage.size * 10, y = percentage.size * 10)","<p>creating a graph representing chances of getting points\n"],["middle","Silicium::Optimization","Silicium/Optimization.html#method-i-middle","(a, b)","<p>find centr of interval\n"],["middle_rectangles","Silicium::NumericalIntegration","Silicium/NumericalIntegration.html#method-c-middle_rectangles","(a, b, eps = 0.0001, &block)","<p>Middle Rectangles Method with specified accuracy\n"],["middle_rectangles_with_a_segment","Silicium::NumericalIntegration","Silicium/NumericalIntegration.html#method-c-middle_rectangles_with_a_segment","(a, b, n, &block)","<p>Middle Rectangles Method with a segment\n"],["minimal_convex_hull_2d","Silicium::Geometry","Silicium/Geometry.html#method-i-minimal_convex_hull_2d","(points)","<p>Returns an array containing points that are included in the minimal convex hull for a given array of …\n"],["needed_variables_order?","Silicium::Geometry","Silicium/Geometry.html#method-i-needed_variables_order-3F","(before, after)",""],["new","Silicium::Dice::Polyhedron","Silicium/Dice/Polyhedron.html#method-c-new","(sides)","<p>initializing polyhedron&#39;s variables there are two ways how to create it 1: by number (6) - creates …\n"],["new","Silicium::Dice::PolyhedronSet","Silicium/Dice/PolyhedronSet.html#method-c-new","(arr)",""],["new","Silicium::Geometry::Line2dCanon","Silicium/Geometry/Line2dCanon.html#method-c-new","(p1, p2)",""],["new","Silicium::Graphs::OrientedGraph","Silicium/Graphs/OrientedGraph.html#method-c-new","(initializer = [])",""],["new","Silicium::Plotter::Image","Silicium/Plotter/Image.html#method-c-new","(width, height, bg_color = ChunkyPNG::Color::TRANSPARENT)","<p>Creates a new plot with chosen <code>width</code> and <code>height</code> parameters with background colored <code>bg_color</code>\n"],["not_polygon?","Silicium::Geometry","Silicium/Geometry.html#method-i-not_polygon-3F","(points)",""],["oriented_area","Silicium::Geometry","Silicium/Geometry.html#method-i-oriented_area","(a, b, c)",""],["percentage","Silicium::Dice::PolyhedronSet","Silicium/Dice/PolyhedronSet.html#method-i-percentage","()",""],["point_is_on_line?","Silicium::Geometry::Line2dCanon","Silicium/Geometry/Line2dCanon.html#method-i-point_is_on_line-3F","(p1)","<p>Checks the point lies on the line or not\n"],["point_to_line_distance_3d","Silicium::Geometry","Silicium/Geometry.html#method-i-point_to_line_distance_3d","(point, line_eq)","<p>Calculates the distance from a point given by a Point3d structure to a straight line given by a canonical …\n"],["process_cf","Silicium::Geometry","Silicium/Geometry.html#method-i-process_cf","(line_equation, variable)",""],["process_free_member","Silicium::Geometry","Silicium/Geometry.html#method-i-process_free_member","(line_equation, variable)",""],["process_line_by_coordinates","Silicium::Geometry","Silicium/Geometry.html#method-i-process_line_by_coordinates","(line_equation, func)",""],["put_point_in_part","Silicium::Geometry","Silicium/Geometry.html#method-i-put_point_in_part","(part, point, direction)",""],["re_lu","Silicium::Optimization","Silicium/Optimization.html#method-i-re_lu","(x)","<p>reflector function\n"],["rectangle","Silicium::Plotter::Image","Silicium/Plotter/Image.html#method-i-rectangle","(x, y, width, height, color)",""],["sides","Silicium::Dice::Polyhedron","Silicium/Dice/Polyhedron.html#method-i-sides","()",""],["sigmoid","Silicium::Optimization","Silicium/Optimization.html#method-i-sigmoid","(x)","<p>sigmoid function\n"],["simpson_integration","Silicium::NumericalIntegration","Silicium/NumericalIntegration.html#method-c-simpson_integration","(a, b, eps = 0.0001, &block)","<p>Simpson integration with specified accuracy\n"],["simpson_integration_with_a_segment","Silicium::NumericalIntegration","Silicium/NumericalIntegration.html#method-c-simpson_integration_with_a_segment","(a, b, n, &block)","<p>Simpson integration with a segment\n"],["sorted?","Silicium::Optimization","Silicium/Optimization.html#method-i-sorted-3F","(a)","<p>return true if array is sorted\n"],["switch_step","Silicium::Optimization","Silicium/Optimization.html#method-i-switch_step","(cur_f, prev_f, step, i)","<p>switch step if current func value &gt; previous func value\n"],["three_eights_integration","Silicium::NumericalIntegration","Silicium/NumericalIntegration.html#method-c-three_eights_integration","(a, b, eps = 0.0001, &block)","<p>Computes integral from <code>a</code> to <code>b</code> of <code>block</code> with accuracy <code>eps</code>\n"],["three_eights_integration_n","Silicium::NumericalIntegration","Silicium/NumericalIntegration.html#method-c-three_eights_integration_n","(a, b, n, &block)","<p>Computes integral from <code>a</code> to <code>b</code> of <code>block</code> with <code>n</code> segmentations\n"],["throw","Silicium::Dice::Polyhedron","Silicium/Dice/Polyhedron.html#method-i-throw","()","<p>ability to throw a polyhedron\n"],["throw","Silicium::Dice::PolyhedronSet","Silicium/Dice/PolyhedronSet.html#method-i-throw","()","<p>ability to throw a polyhedron&#39;s set using hash of chances\n"],["to_s","Silicium::Dice::Polyhedron","Silicium/Dice/Polyhedron.html#method-i-to_s","()",""],["to_s","Silicium::Dice::PolyhedronSet","Silicium/Dice/PolyhedronSet.html#method-i-to_s","()","<p>returns array of polyhedrons\n"],["trapezoid","Silicium::NumericalIntegration","Silicium/NumericalIntegration.html#method-c-trapezoid","(a, b, eps = 0.0001, &block)","<p>Trapezoid Method with specified accuracy\n"],["trapezoid_with_a_segment","Silicium::NumericalIntegration","Silicium/NumericalIntegration.html#method-c-trapezoid_with_a_segment","(a, b, n, &block)","<p>Trapezoid Method with a segment\n"],["vector_length","Silicium::Geometry","Silicium/Geometry.html#method-i-vector_length","(vector)",""],["vectors_product","Silicium::Geometry","Silicium/Geometry.html#method-i-vectors_product","(v1, v2)",""],["vertex_label_number","Silicium::Graphs::OrientedGraph","Silicium/Graphs/OrientedGraph.html#method-i-vertex_label_number","()",""],["vertex_number","Silicium::Graphs::OrientedGraph","Silicium/Graphs/OrientedGraph.html#method-i-vertex_number","()",""],["README","","README_md.html","","<p><img src=\"https://travis-ci.org/mmcs-ruby/silicium.svg?branch=master\">\n<img src=\"https://api.codeclimate.com/v1/badges/b0ec4b3029f90d4273a1/maintainability\"> ...\n"]]}}
Binary file