File: integer.cpp

package info (click to toggle)
arrayfire 3.3.2%2Bdfsg1-4
  • links: PTS, VCS
  • area: main
  • in suites: stretch
  • size: 109,016 kB
  • sloc: cpp: 127,909; lisp: 6,878; python: 3,923; ansic: 1,051; sh: 347; makefile: 338; xml: 175
file content (92 lines) | stat: -rw-r--r-- 2,300 bytes parent folder | download
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
/*******************************************************
 * Copyright (c) 2014, ArrayFire
 * All rights reserved.
 *
 * This file is distributed under 3-clause BSD license.
 * The complete license agreement can be obtained at:
 * http://arrayfire.com/licenses/BSD-3-Clause
 ********************************************************/

#include <stdio.h>
#include <arrayfire.h>
#include <af/util.h>
#include <cstdlib>

using namespace af;

int main(int argc, char ** argv)
{
    try {
        int device = argc > 1 ? atoi(argv[1]) : 0;
        af::setDevice(device);
        af::info();

        printf("\n=== ArrayFire signed(s32) / unsigned(u32) Integer Example ===\n");

        int h_A[] = {1, 2, 4, -1, 2, 0, 4, 2, 3};
        int h_B[] = {2, 3, -5, 6, 0, 10, -12, 0, 1};
        array A = array(3, 3, h_A);
        array B = array(3, 3, h_B);

        printf("--\nSub-refencing and Sub-assignment\n");
        af_print(A);
        af_print(A.col(0));
        af_print(A.row(0));
        A(0) = 11;
        A(1) = 100;
        af_print(A);
        af_print(B);
        A(1,span) = B(2,span);
        af_print(A);

        printf("--Bit-wise operations\n");
        // Returns an array of type s32
        af_print(A & B);
        af_print(A | B);
        af_print(A ^ B);

        printf("\n--Logical operations\n");
        // Returns an array of type b8
        af_print(A && B);
        af_print(A || B);

        printf("\n--Transpose\n");
        af_print(A);
        af_print(A.T());

        printf("\n--Flip Vertically / Horizontally\n");
        af_print(A);
        af_print(flip(A,0));
        af_print(flip(A,1));

        printf("\n--Sum along columns\n");
        af_print(A);
        af_print(sum(A));

        printf("\n--Product along columns\n");
        af_print(A);
        af_print(product(A));

        printf("\n--Minimum along columns\n");
        af_print(A);
        af_print(min(A));

        printf("\n--Maximum along columns\n");
        af_print(A);
        af_print(max(A));

        printf("\n--Minimum along columns with index\n");
        af_print(A);

        array out, idx;
        min(out, idx, A);
        af_print(out);
        af_print(idx);

    } catch (af::exception& e) {
        fprintf(stderr, "%s\n", e.what());
        throw;
    }

    return 0;
}