|
91 | 91 | <div class="title">algorithm.h File Reference</div> </div> |
92 | 92 | </div><!--header--> |
93 | 93 | <div class="contents"> |
94 | | -<h3 class="version">(2018-05-22 12:00:01 -0400, (build fd64c39))</h3><div class="textblock"><code>#include <<a class="el" href="defines_8h_source.htm">af/defines.h</a>></code><br /> |
| 94 | +<h3 class="version">(2018-11-19 17:22:56 +0530, (build dc38ef13))</h3><div class="textblock"><code>#include <<a class="el" href="defines_8h_source.htm">af/defines.h</a>></code><br /> |
95 | 95 | </div> |
96 | 96 | <p><a href="algorithm_8h_source.htm">Go to the source code of this file.</a></p> |
97 | 97 | <table class="memberdecls"> |
@@ -180,7 +180,7 @@ <h3 class="version">(2018-05-22 12:00:01 -0400, (build fd64c39))</h3><div class= |
180 | 180 | <tr class="memdesc:gab0de5929db14a2449c935ed82acf5153"><td class="mdescLeft"> </td><td class="mdescRight">C++ Interface for getting maximum value and its location from the entire array. <a href="group__reduce__func__max.htm#gab0de5929db14a2449c935ed82acf5153">More...</a><br /></td></tr> |
181 | 181 | <tr class="separator:gab0de5929db14a2449c935ed82acf5153"><td class="memSeparator" colspan="2"> </td></tr> |
182 | 182 | <tr class="memitem:gae450135c4ae1bdaa4489804a215f3214"><td class="memItemLeft" align="right" valign="top"><a class="el" href="defines_8h.htm#ab23e67549eba2cfbaf0eb5f88f947e48">AFAPI</a> array </td><td class="memItemRight" valign="bottom"><a class="el" href="group__scan__func__accum.htm#gae450135c4ae1bdaa4489804a215f3214">accum</a> (const array &in, const int dim=0)</td></tr> |
183 | | -<tr class="memdesc:gae450135c4ae1bdaa4489804a215f3214"><td class="mdescLeft"> </td><td class="mdescRight">C++ Interface inclusive sum (cumulative sum) of an array. <a href="group__scan__func__accum.htm#gae450135c4ae1bdaa4489804a215f3214">More...</a><br /></td></tr> |
| 183 | +<tr class="memdesc:gae450135c4ae1bdaa4489804a215f3214"><td class="mdescLeft"> </td><td class="mdescRight">C++ Interface for computing the cumulative sum (inclusive) of an array. <a href="group__scan__func__accum.htm#gae450135c4ae1bdaa4489804a215f3214">More...</a><br /></td></tr> |
184 | 184 | <tr class="separator:gae450135c4ae1bdaa4489804a215f3214"><td class="memSeparator" colspan="2"> </td></tr> |
185 | 185 | <tr class="memitem:gabe3e469eb355990345012bbe6393b4c3"><td class="memItemLeft" align="right" valign="top"><a class="el" href="defines_8h.htm#ab23e67549eba2cfbaf0eb5f88f947e48">AFAPI</a> array </td><td class="memItemRight" valign="bottom"><a class="el" href="group__scan__func__scan.htm#gabe3e469eb355990345012bbe6393b4c3">scan</a> (const array &in, const int dim=0, binaryOp op=<a class="el" href="defines_8h.htm#a4de0054ea1c296a55a79691c21f19c6ca335c219d88e113349f6ce08e830314a1">AF_BINARY_ADD</a>, bool inclusive_scan=true)</td></tr> |
186 | 186 | <tr class="memdesc:gabe3e469eb355990345012bbe6393b4c3"><td class="mdescLeft"> </td><td class="mdescRight">C++ Interface generalized scan of an array. <a href="group__scan__func__scan.htm#gabe3e469eb355990345012bbe6393b4c3">More...</a><br /></td></tr> |
@@ -210,10 +210,10 @@ <h3 class="version">(2018-05-22 12:00:01 -0400, (build fd64c39))</h3><div class= |
210 | 210 | <tr class="memdesc:ga73f2f768af96755af50df21e384287c6"><td class="mdescLeft"> </td><td class="mdescRight">C++ Interface for getting unique values. <a href="group__set__func__unique.htm#ga73f2f768af96755af50df21e384287c6">More...</a><br /></td></tr> |
211 | 211 | <tr class="separator:ga73f2f768af96755af50df21e384287c6"><td class="memSeparator" colspan="2"> </td></tr> |
212 | 212 | <tr class="memitem:gaa793c080cfa2c5ed7f422479e8e0bfe3"><td class="memItemLeft" align="right" valign="top"><a class="el" href="defines_8h.htm#ab23e67549eba2cfbaf0eb5f88f947e48">AFAPI</a> array </td><td class="memItemRight" valign="bottom"><a class="el" href="group__set__func__union.htm#gaa793c080cfa2c5ed7f422479e8e0bfe3">setUnion</a> (const array &first, const array &second, const bool is_unique=false)</td></tr> |
213 | | -<tr class="memdesc:gaa793c080cfa2c5ed7f422479e8e0bfe3"><td class="mdescLeft"> </td><td class="mdescRight">C++ Interface for performing union of two arrays. <a href="group__set__func__union.htm#gaa793c080cfa2c5ed7f422479e8e0bfe3">More...</a><br /></td></tr> |
| 213 | +<tr class="memdesc:gaa793c080cfa2c5ed7f422479e8e0bfe3"><td class="mdescLeft"> </td><td class="mdescRight">C++ Interface for finding the union of two arrays. <a href="group__set__func__union.htm#gaa793c080cfa2c5ed7f422479e8e0bfe3">More...</a><br /></td></tr> |
214 | 214 | <tr class="separator:gaa793c080cfa2c5ed7f422479e8e0bfe3"><td class="memSeparator" colspan="2"> </td></tr> |
215 | 215 | <tr class="memitem:gae4549aee29c563edfb0b4a444fbf9200"><td class="memItemLeft" align="right" valign="top"><a class="el" href="defines_8h.htm#ab23e67549eba2cfbaf0eb5f88f947e48">AFAPI</a> array </td><td class="memItemRight" valign="bottom"><a class="el" href="group__set__func__intersect.htm#gae4549aee29c563edfb0b4a444fbf9200">setIntersect</a> (const array &first, const array &second, const bool is_unique=false)</td></tr> |
216 | | -<tr class="memdesc:gae4549aee29c563edfb0b4a444fbf9200"><td class="mdescLeft"> </td><td class="mdescRight">C++ Interface for performing intersect of two arrays. <a href="group__set__func__intersect.htm#gae4549aee29c563edfb0b4a444fbf9200">More...</a><br /></td></tr> |
| 216 | +<tr class="memdesc:gae4549aee29c563edfb0b4a444fbf9200"><td class="mdescLeft"> </td><td class="mdescRight">C++ Interface for finding the intersection of two arrays. <a href="group__set__func__intersect.htm#gae4549aee29c563edfb0b4a444fbf9200">More...</a><br /></td></tr> |
217 | 217 | <tr class="separator:gae4549aee29c563edfb0b4a444fbf9200"><td class="memSeparator" colspan="2"> </td></tr> |
218 | 218 | <tr class="memitem:gacd4917c2e916870ebdf54afc2f61d533"><td class="memItemLeft" align="right" valign="top"><a class="el" href="defines_8h.htm#ab23e67549eba2cfbaf0eb5f88f947e48">AFAPI</a> <a class="el" href="defines_8h.htm#a82b94dc53bbd100a0e8ca9dd356aaf4f">af_err</a> </td><td class="memItemRight" valign="bottom"><a class="el" href="group__reduce__func__sum.htm#gacd4917c2e916870ebdf54afc2f61d533">af_sum</a> (<a class="el" href="defines_8h.htm#a8e45f4aa3dbea6a7aa021dbc50a4a089">af_array</a> *out, const <a class="el" href="defines_8h.htm#a8e45f4aa3dbea6a7aa021dbc50a4a089">af_array</a> in, const int dim)</td></tr> |
219 | 219 | <tr class="memdesc:gacd4917c2e916870ebdf54afc2f61d533"><td class="mdescLeft"> </td><td class="mdescRight">C Interface for sum of elements in an array. <a href="group__reduce__func__sum.htm#gacd4917c2e916870ebdf54afc2f61d533">More...</a><br /></td></tr> |
@@ -282,7 +282,7 @@ <h3 class="version">(2018-05-22 12:00:01 -0400, (build fd64c39))</h3><div class= |
282 | 282 | <tr class="memdesc:gaea009bd51145be2fcc688b2390725401"><td class="mdescLeft"> </td><td class="mdescRight">C Interface for getting maximum value and it's location from the entire array. <a href="group__reduce__func__max.htm#gaea009bd51145be2fcc688b2390725401">More...</a><br /></td></tr> |
283 | 283 | <tr class="separator:gaea009bd51145be2fcc688b2390725401"><td class="memSeparator" colspan="2"> </td></tr> |
284 | 284 | <tr class="memitem:ga50d499e844e0b63e338cb3ea50439629"><td class="memItemLeft" align="right" valign="top"><a class="el" href="defines_8h.htm#ab23e67549eba2cfbaf0eb5f88f947e48">AFAPI</a> <a class="el" href="defines_8h.htm#a82b94dc53bbd100a0e8ca9dd356aaf4f">af_err</a> </td><td class="memItemRight" valign="bottom"><a class="el" href="group__scan__func__accum.htm#ga50d499e844e0b63e338cb3ea50439629">af_accum</a> (<a class="el" href="defines_8h.htm#a8e45f4aa3dbea6a7aa021dbc50a4a089">af_array</a> *out, const <a class="el" href="defines_8h.htm#a8e45f4aa3dbea6a7aa021dbc50a4a089">af_array</a> in, const int dim)</td></tr> |
285 | | -<tr class="memdesc:ga50d499e844e0b63e338cb3ea50439629"><td class="mdescLeft"> </td><td class="mdescRight">C Interface inclusive sum (cumulative sum) of an array. <a href="group__scan__func__accum.htm#ga50d499e844e0b63e338cb3ea50439629">More...</a><br /></td></tr> |
| 285 | +<tr class="memdesc:ga50d499e844e0b63e338cb3ea50439629"><td class="mdescLeft"> </td><td class="mdescRight">C Interface for computing the cumulative sum (inclusive) of an array. <a href="group__scan__func__accum.htm#ga50d499e844e0b63e338cb3ea50439629">More...</a><br /></td></tr> |
286 | 286 | <tr class="separator:ga50d499e844e0b63e338cb3ea50439629"><td class="memSeparator" colspan="2"> </td></tr> |
287 | 287 | <tr class="memitem:ga1c864e22826f61bec2e9b6c61aa93fce"><td class="memItemLeft" align="right" valign="top"><a class="el" href="defines_8h.htm#ab23e67549eba2cfbaf0eb5f88f947e48">AFAPI</a> <a class="el" href="defines_8h.htm#a82b94dc53bbd100a0e8ca9dd356aaf4f">af_err</a> </td><td class="memItemRight" valign="bottom"><a class="el" href="group__scan__func__scan.htm#ga1c864e22826f61bec2e9b6c61aa93fce">af_scan</a> (<a class="el" href="defines_8h.htm#a8e45f4aa3dbea6a7aa021dbc50a4a089">af_array</a> *out, const <a class="el" href="defines_8h.htm#a8e45f4aa3dbea6a7aa021dbc50a4a089">af_array</a> in, const int dim, <a class="el" href="defines_8h.htm#a4de0054ea1c296a55a79691c21f19c6c">af_binary_op</a> op, bool inclusive_scan)</td></tr> |
288 | 288 | <tr class="memdesc:ga1c864e22826f61bec2e9b6c61aa93fce"><td class="mdescLeft"> </td><td class="mdescRight">C Interface generalized scan of an array. <a href="group__scan__func__scan.htm#ga1c864e22826f61bec2e9b6c61aa93fce">More...</a><br /></td></tr> |
@@ -312,10 +312,10 @@ <h3 class="version">(2018-05-22 12:00:01 -0400, (build fd64c39))</h3><div class= |
312 | 312 | <tr class="memdesc:ga6afa1de48cbbc4b2df530c2530087943"><td class="mdescLeft"> </td><td class="mdescRight">C Interface for getting unique values. <a href="group__set__func__unique.htm#ga6afa1de48cbbc4b2df530c2530087943">More...</a><br /></td></tr> |
313 | 313 | <tr class="separator:ga6afa1de48cbbc4b2df530c2530087943"><td class="memSeparator" colspan="2"> </td></tr> |
314 | 314 | <tr class="memitem:gaabeead0c0dc360db9398e9703dbb273f"><td class="memItemLeft" align="right" valign="top"><a class="el" href="defines_8h.htm#ab23e67549eba2cfbaf0eb5f88f947e48">AFAPI</a> <a class="el" href="defines_8h.htm#a82b94dc53bbd100a0e8ca9dd356aaf4f">af_err</a> </td><td class="memItemRight" valign="bottom"><a class="el" href="group__set__func__union.htm#gaabeead0c0dc360db9398e9703dbb273f">af_set_union</a> (<a class="el" href="defines_8h.htm#a8e45f4aa3dbea6a7aa021dbc50a4a089">af_array</a> *out, const <a class="el" href="defines_8h.htm#a8e45f4aa3dbea6a7aa021dbc50a4a089">af_array</a> first, const <a class="el" href="defines_8h.htm#a8e45f4aa3dbea6a7aa021dbc50a4a089">af_array</a> second, const bool is_unique)</td></tr> |
315 | | -<tr class="memdesc:gaabeead0c0dc360db9398e9703dbb273f"><td class="mdescLeft"> </td><td class="mdescRight">C Interface for performing union of two arrays. <a href="group__set__func__union.htm#gaabeead0c0dc360db9398e9703dbb273f">More...</a><br /></td></tr> |
| 315 | +<tr class="memdesc:gaabeead0c0dc360db9398e9703dbb273f"><td class="mdescLeft"> </td><td class="mdescRight">C Interface for finding the union of two arrays. <a href="group__set__func__union.htm#gaabeead0c0dc360db9398e9703dbb273f">More...</a><br /></td></tr> |
316 | 316 | <tr class="separator:gaabeead0c0dc360db9398e9703dbb273f"><td class="memSeparator" colspan="2"> </td></tr> |
317 | 317 | <tr class="memitem:ga985f9332c5f858eec66c717881ef2607"><td class="memItemLeft" align="right" valign="top"><a class="el" href="defines_8h.htm#ab23e67549eba2cfbaf0eb5f88f947e48">AFAPI</a> <a class="el" href="defines_8h.htm#a82b94dc53bbd100a0e8ca9dd356aaf4f">af_err</a> </td><td class="memItemRight" valign="bottom"><a class="el" href="group__set__func__intersect.htm#ga985f9332c5f858eec66c717881ef2607">af_set_intersect</a> (<a class="el" href="defines_8h.htm#a8e45f4aa3dbea6a7aa021dbc50a4a089">af_array</a> *out, const <a class="el" href="defines_8h.htm#a8e45f4aa3dbea6a7aa021dbc50a4a089">af_array</a> first, const <a class="el" href="defines_8h.htm#a8e45f4aa3dbea6a7aa021dbc50a4a089">af_array</a> second, const bool is_unique)</td></tr> |
318 | | -<tr class="memdesc:ga985f9332c5f858eec66c717881ef2607"><td class="mdescLeft"> </td><td class="mdescRight">C Interface for performing intersect of two arrays. <a href="group__set__func__intersect.htm#ga985f9332c5f858eec66c717881ef2607">More...</a><br /></td></tr> |
| 318 | +<tr class="memdesc:ga985f9332c5f858eec66c717881ef2607"><td class="mdescLeft"> </td><td class="mdescRight">C Interface for finding the intersection of two arrays. <a href="group__set__func__intersect.htm#ga985f9332c5f858eec66c717881ef2607">More...</a><br /></td></tr> |
319 | 319 | <tr class="separator:ga985f9332c5f858eec66c717881ef2607"><td class="memSeparator" colspan="2"> </td></tr> |
320 | 320 | </table> |
321 | 321 | </div><!-- contents --> |
|
0 commit comments