#189

Build # #189

Build Type

push

Committed by

Commit Message

<a href="https://github.com/apache/datasketches-java/commit/<a class=hub.com/apache/datasketches-java/commit/<a class="double-link" href="https://git"><a class=hub.com/apache/datasketches-java/commit/<a class="double-link" href="https://git"><a class=hub.com/apache/datasketches-java/commit/<a class="double-link" href="https://git"><a class=hub.com/apache/datasketches-java/commit/f03cf6a743a8698a01f2faa87e24e687bfef39d0">f03cf6a74">&lt;a href=&quot;https://github.com/apache/datasketches-java/commit/</a><a class="double-link" href="https://github.com/apache/datasketches-java/commit/&lt;a class=&quot;double-link&quot; href=&quot;https://git">&lt;a class=</a>hub.com/apache/datasketches-java/commit/&lt;a class=&quot;double-link&quot; href=&quot;https://git">&lt;a class=</a>hub.com/apache/datasketches-java/commit/&lt;a class=&quot;double-link&quot; href=&quot;https://git">&lt;a class=</a>hub.com/apache/datasketches-java/commit/f03cf6a743a8698a01f2faa87e24e687bfef39d0">f03cf6a74</a><a href="https://github.com/apache/datasketches-java/commit/f03cf6a743a8698a01f2faa87e24e687bfef39d0">&quot;&gt;&amp;lt;a href=&amp;quot;https://github.com/apache/datasketches-java/commit/&lt;/a&gt;&lt;a class=&quot;double-link&quot; href=&quot;https://github.com/apache/datasketches-java/commit/&amp;lt;a class=&amp;quot;double-link&amp;quot; href=&amp;quot;https://git&quot;&gt;&amp;lt;a class=&lt;/a&gt;hub.com/apache/datasketches-java/commit/&amp;lt;a class=&amp;quot;double-link&amp;quot; href=&amp;quot;https://git&quot;&gt;&amp;lt;a class=&lt;/a&gt;hub.com/apache/datasketches-java/commit/&amp;lt;a class=&amp;quot;double-link&amp;quot; href=&amp;quot;https://git&quot;&gt;&amp;lt;a class=&lt;/a&gt;hub.com/apache/datasketches-java/commit/&amp;lt;a class=&amp;quot;double-link&amp;quot; href=&amp;quot;https://git&quot;&gt;&amp;lt;a class=&lt;/a&gt;hub.com/apache/datasketches-java/commit/&amp;lt;a class=&amp;quot;double-link&amp;quot; href=&amp;quot;https://git&quot;&gt;&amp;lt;a class=&lt;/a&gt;hub.com/apache/datasketches-java/commit/f03cf6a743a8698a01f2faa87e24e687bfef39d0&quot;&gt;f03cf6a74&lt;/a&gt;&lt;a href=&quot;https://github.com/apache/datasketches-java/commit/f03cf6a743a8698a01f2faa87e24e687bfef39d0&quot;&gt;&amp;quot;&amp;gt;&amp;amp;lt;a href=&amp;amp;quot;https://github.com/apache/datasketches-java/... (continued)

Run Details

1593 of 1593 new or added lines in 16 files covered. (100.0%)

19147 of 19514 relevant lines covered (98.12%)

0.98 hits per line

Source File
Press 'n' to go to next uncovered line, 'b' for previous

92.68

/src/main/java/org/apache/datasketches/kll/KllHeapSketch.java

/*
 * Licensed to the Apache Software Foundation (ASF) under one
 * or more contributor license agreements.  See the NOTICE file
 * distributed with this work for additional information
 * regarding copyright ownership.  The ASF licenses this file
 * to you under the Apache License, Version 2.0 (the
 * "License"); you may not use this file except in compliance
 * with the License.  You may obtain a copy of the License at
 *
 *   http://www.apache.org/licenses/LICENSE-2.0
 *
 * Unless required by applicable law or agreed to in writing,
 * software distributed under the License is distributed on an
 * "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY
 * KIND, either express or implied.  See the License for the
 * specific language governing permissions and limitations
 * under the License.
 */

package org.apache.datasketches.kll;

import org.apache.datasketches.memory.WritableMemory;

/**
 * This class implements all the methods for the heap sketches that are independent
 * of the sketch type (float or double).
 *
 * @author lrhodes
 */
abstract class KllHeapSketch extends KllSketch {
  private final int k;    // configured value of K.
  private final int m;    // configured value of M.
  private long n_;        // number of items input into this sketch.
  private int minK_;    // dynamic minK for error estimation after merging with different k.
  private int numLevels_; // one-based number of current levels.
  private int[] levels_;  // array of index offsets into the items[]. Size = numLevels + 1.
  private boolean isLevelZeroSorted_;

  /**
   * Heap constructor.
   * @param k user configured size of sketch. Range [m, 2^16]
   * @param m user configured minimum level width
   * @param sketchType either DOUBLE_SKETCH or FLOAT_SKETCH
   */
  KllHeapSketch(final int k, final int m, final SketchType sketchType) {
    super(sketchType, null, null);
    KllHelper.checkM(m);
    KllHelper.checkK(k, m);
    this.k = k;
    this.m = m;
    n_ = 0;
    minK_ = k;
    numLevels_ = 1;
    levels_ = new int[] {k, k};
    isLevelZeroSorted_ = false;
  }

  @Override
  public int getK() {
    return k;
  }

  @Override
  public int getM() {
    return m;
  }

  @Override
  public long getN() {
    return n_;
  }

  @Override
  int getMinK() {
    return minK_;
  }

  @Override
  int[] getLevelsArray() {
    return levels_;
  }

  @Override
  int getLevelsArrayAt(final int index) { return levels_[index]; }

  @Override
  int getNumLevels() {
    return numLevels_;
  }

  @Override
  void incN() {
    n_++;
  }

  @Override
  void incNumLevels() {
    numLevels_++;
  }

  @Override
  boolean isLevelZeroSorted() {
    return isLevelZeroSorted_;
  }

  @Override
  void setMinK(final int minK) {
    minK_ = minK;
  }

  @Override
  void setItemsArrayUpdatable(final WritableMemory itemsMem) { } //dummy

  @Override
  void setLevelsArray(final int[] levelsArr) {
    levels_ = levelsArr;
  }

  @Override
  void setLevelsArrayAt(final int index, final int value) { levels_[index] = value; }

  @Override
  void setLevelsArrayAtMinusEq(final int index, final int minusEq) {
    levels_[index] -= minusEq;
  }

  @Override
  void setLevelsArrayAtPlusEq(final int index, final int plusEq) {
    levels_[index] += plusEq;
  }

  @Override
  void setLevelsArrayUpdatable(final WritableMemory levelsMem) { } //dummy

  @Override
  void setLevelZeroSorted(final boolean sorted) {
    this.isLevelZeroSorted_ = sorted;
  }

  @Override
  void setMinMaxArrayUpdatable(final WritableMemory minMaxMem) { } //dummy

  @Override
  void setN(final long n) {
    n_ = n;
  }

  @Override
  void setNumLevels(final int numLevels) {
    numLevels_ = numLevels;
  }

}

1	/*
2	* Licensed to the Apache Software Foundation (ASF) under one
3	* or more contributor license agreements. See the NOTICE file
4	* distributed with this work for additional information
5	* regarding copyright ownership. The ASF licenses this file
6	* to you under the Apache License, Version 2.0 (the
7	* "License"); you may not use this file except in compliance
8	* with the License. You may obtain a copy of the License at
9	*
10	* http://www.apache.org/licenses/LICENSE-2.0
11	*
12	* Unless required by applicable law or agreed to in writing,
13	* software distributed under the License is distributed on an
14	* "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY
15	* KIND, either express or implied. See the License for the
16	* specific language governing permissions and limitations
17	* under the License.
18	*/
19
20	package org.apache.datasketches.kll;
21
22	import org.apache.datasketches.memory.WritableMemory;
23
24	/**
25	* This class implements all the methods for the heap sketches that are independent
26	* of the sketch type (float or double).
27	*
28	* @author lrhodes
29	*/
30	abstract class KllHeapSketch extends KllSketch {
31	private final int k; // configured value of K.
32	private final int m; // configured value of M.
33	private long n_; // number of items input into this sketch.
34	private int minK_; // dynamic minK for error estimation after merging with different k.
35	private int numLevels_; // one-based number of current levels.
36	private int[] levels_; // array of index offsets into the items[]. Size = numLevels + 1.
37	private boolean isLevelZeroSorted_;
38
39	/**
40	* Heap constructor.
41	* @param k user configured size of sketch. Range [m, 2^16]
42	* @param m user configured minimum level width
43	* @param sketchType either DOUBLE_SKETCH or FLOAT_SKETCH
44	*/
45	KllHeapSketch(final int k, final int m, final SketchType sketchType) {
46	super(sketchType, null, null);	1✔
47	KllHelper.checkM(m);	1✔
48	KllHelper.checkK(k, m);	1✔
49	this.k = k;	1✔
50	this.m = m;	1✔
51	n_ = 0;	1✔
52	minK_ = k;	1✔
53	numLevels_ = 1;	1✔
54	levels_ = new int[] {k, k};	1✔
55	isLevelZeroSorted_ = false;	1✔
56	}	1✔
57
58	@Override
59	public int getK() {
60	return k;	1✔
61	}
62
63	@Override
64	public int getM() {
65	return m;	1✔
66	}
67
68	@Override
69	public long getN() {
70	return n_;	1✔
71	}
72
73	@Override
74	int getMinK() {
75	return minK_;	1✔
76	}
77
78	@Override
79	int[] getLevelsArray() {
80	return levels_;	1✔
81	}
82
83	@Override
84	int getLevelsArrayAt(final int index) { return levels_[index]; }	1✔
85
86	@Override
87	int getNumLevels() {
88	return numLevels_;	1✔
89	}
90
91	@Override
92	void incN() {
93	n_++;	1✔
94	}	1✔
95
96	@Override
97	void incNumLevels() {
98	numLevels_++;	1✔
99	}	1✔
100
101	@Override
102	boolean isLevelZeroSorted() {
103	return isLevelZeroSorted_;	1✔
104	}
105
106	@Override
107	void setMinK(final int minK) {
108	minK_ = minK;	1✔
109	}	1✔
110
111	@Override
112	void setItemsArrayUpdatable(final WritableMemory itemsMem) { } //dummy	×
113
114	@Override
115	void setLevelsArray(final int[] levelsArr) {
116	levels_ = levelsArr;	1✔
117	}	1✔
118
119	@Override
120	void setLevelsArrayAt(final int index, final int value) { levels_[index] = value; }	1✔
121
122	@Override
123	void setLevelsArrayAtMinusEq(final int index, final int minusEq) {
124	levels_[index] -= minusEq;	1✔
125	}	1✔
126
127	@Override
128	void setLevelsArrayAtPlusEq(final int index, final int plusEq) {
129	levels_[index] += plusEq;	1✔
130	}	1✔
131
132	@Override
133	void setLevelsArrayUpdatable(final WritableMemory levelsMem) { } //dummy	×
134
135	@Override
136	void setLevelZeroSorted(final boolean sorted) {
137	this.isLevelZeroSorted_ = sorted;	1✔
138	}	1✔
139
140	@Override
141	void setMinMaxArrayUpdatable(final WritableMemory minMaxMem) { } //dummy	×
142
143	@Override
144	void setN(final long n) {
145	n_ = n;	1✔
146	}	1✔
147
148	@Override
149	void setNumLevels(final int numLevels) {
150	numLevels_ = numLevels;	1✔
151	}	1✔
152
153	}

apache / datasketches-java / #189

Source File Press 'n' to go to next uncovered line, 'b' for previous

Source File
Press 'n' to go to next uncovered line, 'b' for previous