forked from salesforce/TransmogrifAI
-
Notifications
You must be signed in to change notification settings - Fork 0
/
RichVector.scala
153 lines (136 loc) · 5.1 KB
/
RichVector.scala
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
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
/*
* Copyright (c) 2017, Salesforce.com, Inc.
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted 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 the copyright holder nor the names of its
* contributors may be used to endorse or promote products derived from
* this software without specific prior written permission.
*
* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND 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 THE COPYRIGHT HOLDER OR 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.
*/
package com.salesforce.op.utils.spark
import breeze.linalg.{DenseVector => BreezeDenseVector, SparseVector => BreezeSparseVector, Vector => BreezeVector}
import org.apache.spark.ml.linalg.{DenseVector, SparseVector, Vector, Vectors}
import scala.collection.mutable.ArrayBuffer
/**
* [[org.apache.spark.ml.linalg.Vector]] enrichment functions
*/
object RichVector {
implicit class RichVector(val v: Vector) extends AnyVal {
/**
* Add vectors
*
* @param that another vector
* @throws IllegalArgumentException if the vectors have different sizes
* @return vector addition
*/
def +(that: Vector): Vector = {
val res = v.toBreeze + that.toBreeze
toSpark(res)
}
/**
* Subtract vectors
*
* @param that another vector
* @throws IllegalArgumentException if the vectors have different sizes
* @return vector subtraction
*/
def -(that: Vector): Vector = {
val res = v.toBreeze - that.toBreeze
toSpark(res)
}
/**
* Dot product between vectors
*
* @param that another vector
* @throws IllegalArgumentException if the vectors have different sizes
* @return dot product
*/
def dot(that: Vector): Double = {
require(v.size == that.size,
s"Vectors must have the same length: a.length == b.length (${v.size} != ${that.size})"
)
v.toBreeze dot that.toBreeze
}
/**
* Combine multiple vectors into one
*
* @param that another vector
* @param other other vectors
* @return result vector
*/
def combine(that: Vector, other: Vector*): Vector =
com.salesforce.op.utils.spark.RichVector.combine(v +: that +: other)
/**
* Convert to [[breeze.linalg.Vector]]
*
* @return [[breeze.linalg.Vector]]
*/
def toBreeze: BreezeVector[Double] = v match {
case s: SparseVector => new BreezeSparseVector[Double](s.indices, s.values, s.size)
case d: DenseVector => new BreezeDenseVector[Double](d.values)
}
/**
* Convert [[breeze.linalg.Vector]] back to [[org.apache.spark.ml.linalg.Vector]]
* @return [[org.apache.spark.ml.linalg.Vector]]
*/
private def toSpark: BreezeVector[Double] => Vector = {
case s: BreezeSparseVector[Double]@unchecked => new SparseVector(s.length, s.index, s.data)
case d: BreezeDenseVector[Double]@unchecked => new DenseVector(d.data)
}
}
/**
* Combine multiple vectors into one
*
* @param vectors input vectors
* @return result vector
*/
def combine(vectors: Seq[Vector]): Vector = {
val indices = ArrayBuffer.empty[Int]
val values = ArrayBuffer.empty[Double]
val size = vectors.foldLeft(0)((size, vector) => {
vector.foreachActive { case (i, v) =>
if (v != 0.0) {
indices += size + i
values += v
}
}
size + vector.size
})
Vectors.sparse(size, indices.toArray, values.toArray).compressed
}
implicit class RichSparseVector(val v: SparseVector) extends AnyVal {
def foreachNonZeroIndexedValue(f: (Int, Int, Double) => Unit): Unit = {
(0 until v.indices.length)
.withFilter(v.values(_) != 0.0)
.foreach(i => f(i, v.indices(i), v.values(i)))
}
def update(index: Int, indexVal: Int, value: Double): Double = {
require(v.indices(index) == indexVal,
s"Invalid index: indices($index)==${v.indices(index)}, expected: $indexVal")
val oldVal = v.values(index)
v.values(index) = value
oldVal
}
def toIndexedArray: Array[(Int, Double)] = v.indices.zip(v.values)
}
}