update table of supported Lebedev orders; fixes #20

bast · bast · commit 5cba81c31a1d · 2017-10-06T17:51:47.000+02:00
diff --git a/README.md b/README.md
@@ -355,10 +355,10 @@ For the minimum and maximum number of angular points the code will use the follo
 table and select the closest number with at least the desired precision:
 
 ```
-  {6,   14,   26,   38,   50,   74,   86,  110,  146,  170,
- 194,  230,  266,  302,  350,  434,  590,  770,  974, 1202,
-1454, 1730, 2030, 2354, 2702, 3074, 3470, 3890, 4334, 4802,
-4934, 5294, 5810}
+{6,    14,   26,   38,   50,   74,   86,   110,  146,
+ 170,  194,  230,  266,  302,  350,  434,  590,  770,
+ 974,  1202, 1454, 1730, 2030, 2354, 2702, 3074, 3470,
+ 3890, 4334, 4802, 5294, 5810}
 ```
 
 Taking the same number for the minimum and maximum number of angular points
diff --git a/src/Grid.cpp b/src/Grid.cpp
@@ -53,7 +53,7 @@ void Grid::nullify()
 int lebedev_table[33] = {6,    14,   26,   38,   50,   74,   86,   110,  146,
                          170,  194,  230,  266,  302,  350,  434,  590,  770,
                          974,  1202, 1454, 1730, 2030, 2354, 2702, 3074, 3470,
-                         3890, 4334, 4802, 4934, 5294, 5810};
+                         3890, 4334, 4802, 5294, 5810};
 
 int Grid::get_closest_num_angular(int n) const
 {

Original file line number	Diff line number	Diff line change
`@@ -53,7 +53,7 @@ void Grid::nullify()`
`53`	`53`	`int lebedev_table[33] = {6, 14, 26, 38, 50, 74, 86, 110, 146,`
`54`	`54`	`170, 194, 230, 266, 302, 350, 434, 590, 770,`
`55`	`55`	`974, 1202, 1454, 1730, 2030, 2354, 2702, 3074, 3470,`
`56`		`- 3890, 4334, 4802, 4934, 5294, 5810};`
	`56`	`+ 3890, 4334, 4802, 5294, 5810};`
`57`	`57`
`58`	`58`	`int Grid::get_closest_num_angular(int n) const`
`59`	`59`	`{`