10199

Build # 10199

Build Type

push

jenkins

Committed by GitHub

Commit Message

<a href="https://github.com/apache/carbondata/commit/<a class=hub.com/apache/carbondata/commit/29787e4c465b17efd4cf0998a552734c69f25a7f">29787e4c4<a href="https://github.com/apache/carbondata/commit/29787e4c465b17efd4cf0998a552734c69f25a7f">">Merge </a><a class="double-link" href="https://github.com/apache/carbondata/commit/<a class="double-link" href="https://github.com/apache/carbondata/commit/77c1d2c8fb9136277f57fe01bb5cb453c9a4b4e5">77c1d2c8f</a>">77c1d2c8f</a><a href="https://github.com/apache/carbondata/commit/29787e4c465b17efd4cf0998a552734c69f25a7f"> into 128a6c867">128a6c867</a>

Run Details

11 of 11 new or added lines in 2 files covered. (100.0%)

61521 of 77865 relevant lines covered (79.01%)

1.05 hits per line

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

73.53

/core/src/main/java/org/apache/carbondata/core/datastore/columnar/BlockIndexerStorage.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.carbondata.core.datastore.columnar;

import java.util.ArrayList;
import java.util.HashMap;
import java.util.List;
import java.util.Map;

import org.apache.carbondata.core.constants.CarbonCommonConstants;

public abstract class BlockIndexerStorage<T> {

  public abstract short[] getRowIdPage();

  public abstract int getRowIdPageLengthInBytes();

  public abstract short[] getRowIdRlePage();

  public abstract int getRowIdRlePageLengthInBytes();

  public abstract T getDataPage();

  public abstract short[] getDataRlePage();

  public abstract int getDataRlePageLengthInBytes();

  /**
   * It compresses depends up on the sequence numbers.
   * [1,2,3,4,6,8,10,11,12,13] is translated to [1,4,6,8,10,13] and [0,6]. In
   * first array the start and end of sequential numbers and second array
   * keeps the indexes of where sequential numbers starts. If there is no
   * sequential numbers then the same array it returns with empty second
   * array.
   *
   * @param rowIds
   */
  protected Map<String, short[]> rleEncodeOnRowId(short[] rowIds) {
    short[] rowIdPage;
    short[] rowIdRlePage;
    List<Short> list = new ArrayList<Short>(CarbonCommonConstants.CONSTANT_SIZE_TEN);
    List<Short> map = new ArrayList<Short>(CarbonCommonConstants.CONSTANT_SIZE_TEN);
    int k = 0;
    int i = 1;
    for (; i < rowIds.length; i++) {
      if (rowIds[i] - rowIds[i - 1] == 1) {
        k++;
      } else {
        if (k > 0) {
          map.add(((short) list.size()));
          list.add(rowIds[i - k - 1]);
          list.add(rowIds[i - 1]);
        } else {
          list.add(rowIds[i - 1]);
        }
        k = 0;
      }
    }
    if (k > 0) {
      map.add(((short) list.size()));
      list.add(rowIds[i - k - 1]);
      list.add(rowIds[i - 1]);
    } else {
      list.add(rowIds[i - 1]);
    }
    int compressionPercentage = (((list.size() + map.size()) * 100) / rowIds.length);
    if (compressionPercentage > 70) {
      rowIdPage = rowIds;
    } else {
      rowIdPage = convertToArray(list);
    }
    if (rowIds.length == rowIdPage.length) {
      rowIdRlePage = new short[0];
    } else {
      rowIdRlePage = convertToArray(map);
    }
    Map<String, short[]> rowIdAndRowRleIdPages = new HashMap<>(2);
    rowIdAndRowRleIdPages.put("rowIdPage", rowIdPage);
    rowIdAndRowRleIdPages.put("rowRlePage", rowIdRlePage);
    return rowIdAndRowRleIdPages;
  }

  protected short[] convertToArray(List<Short> list) {
    short[] shortArray = new short[list.size()];
    for (int i = 0; i < shortArray.length; i++) {
      shortArray[i] = list.get(i);
    }
    return shortArray;
  }
}

1	/*
2	* Licensed to the Apache Software Foundation (ASF) under one or more
3	* contributor license agreements. See the NOTICE file distributed with
4	* this work for additional information regarding copyright ownership.
5	* The ASF licenses this file to You under the Apache License, Version 2.0
6	* (the "License"); you may not use this file except in compliance with
7	* the License. You may obtain a copy of the License at
8	*
9	* http://www.apache.org/licenses/LICENSE-2.0
10	*
11	* Unless required by applicable law or agreed to in writing, software
12	* distributed under the License is distributed on an "AS IS" BASIS,
13	* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
14	* See the License for the specific language governing permissions and
15	* limitations under the License.
16	*/
17
18	package org.apache.carbondata.core.datastore.columnar;
19
20	import java.util.ArrayList;
21	import java.util.HashMap;
22	import java.util.List;
23	import java.util.Map;
24
25	import org.apache.carbondata.core.constants.CarbonCommonConstants;
26
27	public abstract class BlockIndexerStorage<T> {	1✔
28
29	public abstract short[] getRowIdPage();
30
31	public abstract int getRowIdPageLengthInBytes();
32
33	public abstract short[] getRowIdRlePage();
34
35	public abstract int getRowIdRlePageLengthInBytes();
36
37	public abstract T getDataPage();
38
39	public abstract short[] getDataRlePage();
40
41	public abstract int getDataRlePageLengthInBytes();
42
43	/**
44	* It compresses depends up on the sequence numbers.
45	* [1,2,3,4,6,8,10,11,12,13] is translated to [1,4,6,8,10,13] and [0,6]. In
46	* first array the start and end of sequential numbers and second array
47	* keeps the indexes of where sequential numbers starts. If there is no
48	* sequential numbers then the same array it returns with empty second
49	* array.
50	*
51	* @param rowIds
52	*/
53	protected Map<String, short[]> rleEncodeOnRowId(short[] rowIds) {
54	short[] rowIdPage;
55	short[] rowIdRlePage;
56	List<Short> list = new ArrayList<Short>(CarbonCommonConstants.CONSTANT_SIZE_TEN);	1✔
57	List<Short> map = new ArrayList<Short>(CarbonCommonConstants.CONSTANT_SIZE_TEN);	1✔
58	int k = 0;	1✔
59	int i = 1;	1✔
60	for (; i < rowIds.length; i++) {	1✔
61	if (rowIds[i] - rowIds[i - 1] == 1) {	1✔
62	k++;	×
63	} else {
64	if (k > 0) {	1✔
65	map.add(((short) list.size()));	×
66	list.add(rowIds[i - k - 1]);	×
67	list.add(rowIds[i - 1]);	×
68	} else {
69	list.add(rowIds[i - 1]);	1✔
70	}
71	k = 0;	1✔
72	}
73	}
74	if (k > 0) {	1✔
75	map.add(((short) list.size()));	×
76	list.add(rowIds[i - k - 1]);	×
77	list.add(rowIds[i - 1]);	×
78	} else {
79	list.add(rowIds[i - 1]);	1✔
80	}
81	int compressionPercentage = (((list.size() + map.size()) * 100) / rowIds.length);	1✔
82	if (compressionPercentage > 70) {	1✔
83	rowIdPage = rowIds;	1✔
84	} else {
85	rowIdPage = convertToArray(list);	×
86	}
87	if (rowIds.length == rowIdPage.length) {	1✔
88	rowIdRlePage = new short[0];	1✔
89	} else {
90	rowIdRlePage = convertToArray(map);	×
91	}
92	Map<String, short[]> rowIdAndRowRleIdPages = new HashMap<>(2);	1✔
93	rowIdAndRowRleIdPages.put("rowIdPage", rowIdPage);	1✔
94	rowIdAndRowRleIdPages.put("rowRlePage", rowIdRlePage);	1✔
95	return rowIdAndRowRleIdPages;	1✔
96	}
97
98	protected short[] convertToArray(List<Short> list) {
99	short[] shortArray = new short[list.size()];	1✔
100	for (int i = 0; i < shortArray.length; i++) {	1✔
101	shortArray[i] = list.get(i);	1✔
102	}
103	return shortArray;	1✔
104	}
105	}

apache / carbondata / 10199

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