Searched refs:Matrix (Results 1 - 25 of 28) sorted by relevance

12

/macosx-10.10.1/ruby-106/ruby/test/matrix/
H A Dtest_matrix.rb6 @m1 = Matrix[[1,2,3], [4,5,6]]
7 @m2 = Matrix[[1,2,3], [4,5,6]]
9 @m4 = Matrix[[1.0, 2.0, 3.0], [4.0, 5.0, 6.0]]
10 @n1 = Matrix[[2,3,4], [5,6,7]]
70 assert_equal 0, Matrix[*rows].rank
116 matrix = Matrix[*rows]
138 m = Matrix[*rows]
151 m = Matrix[*rows]
158 assert_equal(Matrix[[-1, 1], [0, -1]], Matrix[[
[all...]
H A Dtest_vector.rb85 assert_equal(Matrix[[1, 4, 9], [2, 8, 18], [3, 12, 27]], @v1 * Matrix[[1,4,9]])
86 assert_raise(Matrix::ErrOperationNotDefined) { @v1 * Vector[1,4,9] }
96 assert_equal(Matrix[[2],[6],[12]], @v1 + Matrix[[1],[4],[9]])
106 assert_equal(Matrix[[0],[-2],[-6]], @v1 - Matrix[[1],[4],[9]])
123 assert_equal(Matrix[[1,2,3]], @v1.covector)
/macosx-10.10.1/ruby-106/ruby/lib/matrix/
H A Dlup_decomposition.rb1 class Matrix class
19 include Matrix::ConversionHelper
22 Matrix.build(@row_count, [@column_count, @row_count].min) do |i, j|
36 Matrix.build([@column_count, @row_count].min, @column_count) do |i, j|
50 Matrix.send :new, rows, @row_count
80 Matrix.Raise Matrix::ErrDimensionMismatch
92 # +b+ can be a Matrix or a Vector
96 Matrix.Raise Matrix
[all...]
H A Deigenvalue_decomposition.rb1 class Matrix class
22 raise TypeError, "Expected Matrix but got #{a.class}" unless a.is_a?(Matrix)
43 Matrix.send :new, build_eigenvectors.transpose
50 r = Matrix.send :new, build_eigenvectors
73 Matrix.diagonal(*eigenvalues)
/macosx-10.10.1/CPANInternal-159.1/Graph-0.94/lib/Graph/
H A DMatrix.pm1 package Graph::Matrix;
34 Graph::Matrix - create and manipulate a V x V matrix of graph G
38 use Graph::Matrix;
42 my $m = Graph::Matrix->new($g);
56 Construct a new Matrix from the Graph $g.
H A DTransitiveClosure.pm10 use Graph::TransitiveClosure::Matrix;
30 $tcg = Graph::TransitiveClosure::Matrix->new($g, %opt);
59 Graph::TransitiveClosure::Matrix::is_transitive($g);
119 For further documentation, see the L<Graph::TransitiveClosure::Matrix>.
130 from the Graph::TransitiveClosure::Matrix class.
137 L<Graph::TransitiveClosure::Matrix> for more.
H A DAdjacencyMatrix.pm6 use Graph::Matrix;
37 $n = Graph::Matrix->new($g);
/macosx-10.10.1/CPANInternal-159.1/Graph-0.96/lib/Graph/
H A DMatrix.pm1 package Graph::Matrix;
34 Graph::Matrix - create and manipulate a V x V matrix of graph G
38 use Graph::Matrix;
42 my $m = Graph::Matrix->new($g);
56 Construct a new Matrix from the Graph $g.
H A DTransitiveClosure.pm10 use Graph::TransitiveClosure::Matrix;
30 $tcg = Graph::TransitiveClosure::Matrix->new($g, %opt);
59 Graph::TransitiveClosure::Matrix::is_transitive($g);
119 For further documentation, see the L<Graph::TransitiveClosure::Matrix>.
130 from the Graph::TransitiveClosure::Matrix class.
137 L<Graph::TransitiveClosure::Matrix> for more.
H A DAdjacencyMatrix.pm6 use Graph::Matrix;
37 $n = Graph::Matrix->new($g);
/macosx-10.10.1/llvmCore-3425.0.34/include/llvm/CodeGen/PBQP/
H A DMath.h1 //===------ Math.h - PBQP Vector and Matrix classes -------------*- C++ -*-===//
111 /// \brief PBQP Matrix class
112 class Matrix {
115 /// \brief Construct a PBQP Matrix with the given dimensions.
116 Matrix(unsigned rows, unsigned cols) :
120 /// \brief Construct a PBQP Matrix with the given dimensions and initial
122 Matrix(unsigned rows, unsigned cols, PBQPNum initVal) :
128 Matrix(const Matrix &m) :
134 ~Matrix() { delet
[all...]
H A DGraph.h83 Matrix costs;
87 EdgeEntry(NodeItr node1, NodeItr node2, const Matrix &costs)
91 Matrix& getCosts() { return costs; }
92 const Matrix& getCosts() const { return costs; }
177 const Matrix &costs) {
180 "Matrix dimensions mismatch.");
219 Matrix& getEdgeCosts(EdgeItr eItr) { return getEdge(eItr).getCosts(); }
224 const Matrix& getEdgeCosts(ConstEdgeItr eItr) const {
375 const Matrix& m = getEdgeCosts(edgeItr);
413 const Matrix
[all...]
H A DHeuristicSolver.h244 const Matrix &eCosts = g.getEdgeCosts(eItr);
303 const Matrix *yxeCosts = flipEdge1 ?
304 new Matrix(g.getEdgeCosts(yxeItr).transpose()) :
307 const Matrix *zxeCosts = flipEdge2 ?
308 new Matrix(g.getEdgeCosts(zxeItr).transpose()) :
315 Matrix delta(yLen, zLen);
343 Matrix &yzeCosts = g.getEdgeCosts(yzeItr);
507 Matrix &edgeCosts = g.getEdgeCosts(eItr);
569 Matrix &edgeCosts = g.getEdgeCosts(eItr);
/macosx-10.10.1/llvmCore-3425.0.34/lib/CodeGen/
H A DRegAllocBase.h65 LiveRegMatrix *Matrix; member in class:llvm::RegAllocBase
68 RegAllocBase(): TRI(0), MRI(0), VRM(0), LIS(0), Matrix(0) {}
H A DLiveRegMatrix.cpp33 "Live Register Matrix", false, false)
37 "Live Register Matrix", false, false)
56 if (NumRegUnits != Matrix.size())
58 Matrix.init(LIUAlloc, NumRegUnits);
66 for (unsigned i = 0, e = Matrix.size(); i != e; ++i) {
67 Matrix[i].clear();
80 Matrix[*Units].unify(VirtReg);
93 Matrix[*Units].extract(VirtReg);
131 Q.init(UserTag, &VirtReg, &Matrix[RegUnit]);
H A DLiveRegMatrix.h51 LiveIntervalUnion::Array Matrix; member in class:llvm::LiveRegMatrix
143 LiveIntervalUnion *getLiveUnions() { return &Matrix[0]; }
H A DRegAllocBase.cpp60 Matrix = &mat;
95 Matrix->invalidateVirtRegs();
127 Matrix->assign(*VirtReg, AvailablePhysReg);
H A DRegAllocBasic.cpp177 LiveIntervalUnion::Query &Q = Matrix->query(VirtReg, *Units);
202 Matrix->unassign(Spill);
232 switch (Matrix->checkInterference(VirtReg, PhysReg)) {
254 assert(!Matrix->checkInterference(VirtReg, *PhysRegI) &&
H A DRegAllocGreedy.cpp356 Matrix->unassign(LIS->getInterval(VirtReg));
370 Matrix->unassign(LI);
444 if (!Matrix->checkInterference(VirtReg, PhysReg))
518 if (Matrix->checkInterference(VirtReg, PhysReg) > LiveRegMatrix::IK_VirtReg)
534 LiveIntervalUnion::Query &Q = Matrix->query(VirtReg, *Units);
601 LiveIntervalUnion::Query &Q = Matrix->query(VirtReg, *Units);
613 Matrix->unassign(*Intf);
1359 if (!Matrix->query(const_cast<LiveInterval&>(SA->getParent()), *Units)
1371 Matrix->getLiveUnions()[*Units] .find(StartIdx);
1447 if (Matrix
[all...]
H A DRegAllocPBQP.cpp279 PBQP::Matrix(vr1Allowed.size()+1, vr2Allowed.size()+1, 0));
295 PBQP::Matrix &costMat,
299 assert(costMat.getRows() == vr1Allowed.size() + 1 && "Matrix height mismatch.");
300 assert(costMat.getCols() == vr2Allowed.size() + 1 && "Matrix width mismatch.");
379 edge = g.addEdge(node1, node2, PBQP::Matrix(allowed1->size() + 1,
405 PBQP::Matrix &costMat,
/macosx-10.10.1/ruby-106/ruby/lib/
H A Dmatrix.rb5 # An implementation of Matrix and Vector classes.
7 # See classes Matrix and Vector for documentation.
22 def_exception("ErrNotRegular", "Not Regular Matrix")
28 # The +Matrix+ class represents a mathematical matrix. It provides methods for creating
35 # * Matrix[*rows]
36 # * Matrix.[](*rows)
37 # * Matrix.rows(rows, copy = true)
38 # * Matrix.columns(columns)
39 # * Matrix.build(row_count, column_count, &block)
40 # * Matrix
123 class Matrix class
[all...]
/macosx-10.10.1/llvmCore-3425.0.34/include/llvm/CodeGen/
H A DRegAllocPBQP.h135 void addInterferenceCosts(PBQP::Matrix &costMat,
158 void addVirtRegCoalesce(PBQP::Matrix &costMat,
/macosx-10.10.1/CPANInternal-159.1/Graph-0.94/lib/Graph/TransitiveClosure/
H A DMatrix.pm1 package Graph::TransitiveClosure::Matrix;
6 use Graph::Matrix;
25 $pm = Graph::Matrix->new($g);
250 die "Graph::TransitiveClosure::Matrix::new: Unknown options: @{[map { qq['$_' => $opt{$_}]} keys %opt]}"
324 Graph::TransitiveClosure::Matrix - create and query transitive closure of graph
328 use Graph::TransitiveClosure::Matrix;
335 my $tcm = Graph::TransitiveClosure::Matrix->new($g);
339 my $tcm = Graph::TransitiveClosure::Matrix->new($g, reflexive => 1);
349 my $tcm = Graph::TransitiveClosure::Matrix->new($g, path_length => 1);
352 my $tcm = Graph::TransitiveClosure::Matrix
[all...]
/macosx-10.10.1/CPANInternal-159.1/Graph-0.96/lib/Graph/TransitiveClosure/
H A DMatrix.pm1 package Graph::TransitiveClosure::Matrix;
6 use Graph::Matrix;
25 $pm = Graph::Matrix->new($g);
250 die "Graph::TransitiveClosure::Matrix::new: Unknown options: @{[map { qq['$_' => $opt{$_}]} keys %opt]}"
324 Graph::TransitiveClosure::Matrix - create and query transitive closure of graph
328 use Graph::TransitiveClosure::Matrix;
335 my $tcm = Graph::TransitiveClosure::Matrix->new($g);
339 my $tcm = Graph::TransitiveClosure::Matrix->new($g, reflexive => 1);
349 my $tcm = Graph::TransitiveClosure::Matrix->new($g, path_length => 1);
352 my $tcm = Graph::TransitiveClosure::Matrix
[all...]
/macosx-10.10.1/llvmCore-3425.0.34/include/llvm/CodeGen/PBQP/Heuristics/
H A DBriggs.h314 Matrix &eCosts = getGraph().getEdgeCosts(eItr);

Completed in 202 milliseconds

12