|
| 1 | +#!/usr/bin/python |
| 2 | +####################################################### |
| 3 | +# Copyright (c) 2015, ArrayFire |
| 4 | +# All rights reserved. |
| 5 | +# |
| 6 | +# This file is distributed under 3-clause BSD license. |
| 7 | +# The complete license agreement can be obtained at: |
| 8 | +# http://arrayfire.com/licenses/BSD-3-Clause |
| 9 | +######################################################## |
| 10 | + |
| 11 | +import arrayfire as af |
| 12 | +from . import _util |
| 13 | + |
| 14 | +def simple_algorithm(verbose = False): |
| 15 | + display_func = _util.display_func(verbose) |
| 16 | + print_func = _util.print_func(verbose) |
| 17 | + |
| 18 | + a = af.randu(3, 3) |
| 19 | + |
| 20 | + print_func(af.sum(a), af.product(a), af.min(a), af.max(a), |
| 21 | + af.count(a), af.any_true(a), af.all_true(a)) |
| 22 | + |
| 23 | + display_func(af.sum(a, 0)) |
| 24 | + display_func(af.sum(a, 1)) |
| 25 | + |
| 26 | + display_func(af.product(a, 0)) |
| 27 | + display_func(af.product(a, 1)) |
| 28 | + |
| 29 | + display_func(af.min(a, 0)) |
| 30 | + display_func(af.min(a, 1)) |
| 31 | + |
| 32 | + display_func(af.max(a, 0)) |
| 33 | + display_func(af.max(a, 1)) |
| 34 | + |
| 35 | + display_func(af.count(a, 0)) |
| 36 | + display_func(af.count(a, 1)) |
| 37 | + |
| 38 | + display_func(af.any_true(a, 0)) |
| 39 | + display_func(af.any_true(a, 1)) |
| 40 | + |
| 41 | + display_func(af.all_true(a, 0)) |
| 42 | + display_func(af.all_true(a, 1)) |
| 43 | + |
| 44 | + display_func(af.accum(a, 0)) |
| 45 | + display_func(af.accum(a, 1)) |
| 46 | + |
| 47 | + display_func(af.sort(a, is_ascending=True)) |
| 48 | + display_func(af.sort(a, is_ascending=False)) |
| 49 | + |
| 50 | + val,idx = af.sort_index(a, is_ascending=True) |
| 51 | + display_func(val) |
| 52 | + display_func(idx) |
| 53 | + val,idx = af.sort_index(a, is_ascending=False) |
| 54 | + display_func(val) |
| 55 | + display_func(idx) |
| 56 | + |
| 57 | + b = af.randu(3,3) |
| 58 | + keys,vals = af.sort_by_key(a, b, is_ascending=True) |
| 59 | + display_func(keys) |
| 60 | + display_func(vals) |
| 61 | + keys,vals = af.sort_by_key(a, b, is_ascending=False) |
| 62 | + display_func(keys) |
| 63 | + display_func(vals) |
| 64 | + |
| 65 | + c = af.randu(5,1) |
| 66 | + d = af.randu(5,1) |
| 67 | + cc = af.set_unique(c, is_sorted=False) |
| 68 | + dd = af.set_unique(af.sort(d), is_sorted=True) |
| 69 | + display_func(cc) |
| 70 | + display_func(dd) |
| 71 | + |
| 72 | + display_func(af.set_union(cc, dd, is_unique=True)) |
| 73 | + display_func(af.set_union(cc, dd, is_unique=False)) |
| 74 | + |
| 75 | + display_func(af.set_intersect(cc, cc, is_unique=True)) |
| 76 | + display_func(af.set_intersect(cc, cc, is_unique=False)) |
| 77 | + |
| 78 | +_util.tests['algorithm'] = simple_algorithm |
0 commit comments