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
|
// Copyright (C) 2007 Ola Skavhaug
// Licensed under the GNU LGPL Version 2.1.
//
// Modified by Magnus Vikstrom 2008.
//
// First added: 2007-11-30
// Last changed: 2008-01-24
#ifndef __GENERIC_SPARSITY_PATTERN_H
#define __GENERIC_SPARSITY_PATTERN_H
#include <dolfin/common/types.h>
namespace dolfin
{
/// Base class for sparsity patterns of vectors/matrices. Concrete
/// sub classes can be used to initialize vectors and sparse
/// matrices.
class GenericSparsityPattern
{
public:
/// Constructor
GenericSparsityPattern() {}
/// Destructor
virtual ~GenericSparsityPattern() {};
/// Initialize sparsity pattern for a generic tensor
virtual void init(uint rank, const uint* dims) = 0;
/// Initialise sparsity pattern for a parallel generic tensor
virtual void pinit(uint rank, const uint* dims) = 0;
/// Insert non-zero entry
virtual void insert(const uint* num_rows, const uint * const * rows) = 0;
/// Insert non-zero entry
virtual void pinsert(const uint* num_rows, const uint * const * rows) = 0;
/// Return global size
virtual uint size(uint n) const = 0;
/// Return array with number of non-zeroes per row
virtual void numNonZeroPerRow(uint nzrow[]) const = 0;
/// Return total number of non-zeroes
virtual uint numNonZero() const = 0;
/// Finalize sparsity pattern (needed by most parallel la backends)
virtual void apply() = 0;
};
}
#endif
|