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
93
94
95
96
97
98
99
100
101
|
// Copyright (c) 2011-2013, Pacific Biosciences of California, Inc.
//
// All rights reserved.
//
// Redistribution and use in source and binary forms, with or without
// modification, are permitted (subject to the limitations in the
// disclaimer below) provided that the following conditions are met:
//
// * Redistributions of source code must retain the above copyright
// notice, this list of conditions and the following disclaimer.
//
// * Redistributions in binary form must reproduce the above
// copyright notice, this list of conditions and the following
// disclaimer in the documentation and/or other materials provided
// with the distribution.
//
// * Neither the name of Pacific Biosciences nor the names of its
// contributors may be used to endorse or promote products derived
// from this software without specific prior written permission.
//
// NO EXPRESS OR IMPLIED LICENSES TO ANY PARTY'S PATENT RIGHTS ARE
// GRANTED BY THIS LICENSE. THIS SOFTWARE IS PROVIDED BY PACIFIC
// BIOSCIENCES AND ITS CONTRIBUTORS "AS IS" AND ANY EXPRESS OR IMPLIED
// WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
// OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
// DISCLAIMED. IN NO EVENT SHALL PACIFIC BIOSCIENCES OR ITS
// CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
// SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
// LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF
// USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND
// ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,
// OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT
// OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
// SUCH DAMAGE.
// Author: David Alexander
#pragma once
#include <xmmintrin.h>
#include <utility>
#include <vector>
#include "Matrix/SparseVector.hpp"
#include "Types.hpp"
#include "Utils.hpp"
namespace ConsensusCore {
class SparseMatrix
{
public: // Constructor, destructor
SparseMatrix(int rows, int cols);
SparseMatrix(const SparseMatrix& other);
~SparseMatrix();
public: // Nullability
static const SparseMatrix& Null();
bool IsNull() const;
public: // Size information
const int Rows() const;
const int Columns() const;
public: // Information about entries filled by column
void StartEditingColumn(int j, int hintBegin, int hintEnd);
void FinishEditingColumn(int j, int usedBegin, int usedEnd);
std::pair<int, int> UsedRowRange(int j) const;
bool IsColumnEmpty(int j) const;
int UsedEntries() const;
int AllocatedEntries() const; // an entry may be allocated but not used
public: // Accessors
const float& operator()(int i, int j) const;
float Get(int i, int j) const;
void Set(int i, int j, float v);
void ClearColumn(int j);
public: // SSE accessors, which access 4 successive entries in a column
__m128 Get4(int i, int j) const;
void Set4(int i, int j, __m128 v);
public:
// Method SWIG clients can use to get a native matrix (e.g. Numpy)
// mat must be filled as a ROW major matrix
void ToHostMatrix(float** mat, int* rows, int* cols) const;
private:
void CheckInvariants(int column) const;
private:
std::vector<SparseVector*> columns_;
int nCols_;
int nRows_;
int columnBeingEdited_;
std::vector<std::pair<int, int> > usedRanges_;
};
}
#include "Matrix/SparseMatrix-inl.hpp"
|
