All Downloads are FREE. Search and download functionalities are using the official Maven repository.

com.facebook.hive.orc.lazy.LazyDoubleTreeReader Maven / Gradle / Ivy

There is a newer version: 0.18.9
Show newest version
//  Copyright (c) 2013, Facebook, Inc.  All rights reserved.

/**
 * 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 com.facebook.hive.orc.lazy;

import java.io.IOException;
import java.util.List;
import java.util.Map;

import org.apache.hadoop.hive.serde2.io.DoubleWritable;

import com.facebook.hive.orc.InStream;
import com.facebook.hive.orc.OrcProto;
import com.facebook.hive.orc.SerializationUtils;
import com.facebook.hive.orc.StreamName;
import com.facebook.hive.orc.OrcProto.RowIndex;
import com.facebook.hive.orc.OrcProto.RowIndexEntry;
import com.facebook.hive.orc.lazy.OrcLazyObject.ValueNotPresentException;

public class LazyDoubleTreeReader extends LazyTreeReader {

  private InStream stream;
  private double latestRead = 0.0; //< Last value that was read from the stream.

  public LazyDoubleTreeReader(int columnId, long rowIndexStride) {
    super(columnId, rowIndexStride);
  }

  @Override
  public void startStripe(Map streams, List encodings,
      RowIndex[] indexes, long rowBaseInStripe) throws IOException {
    super.startStripe(streams, encodings, indexes, rowBaseInStripe);
    StreamName name =
      new StreamName(columnId,
        OrcProto.Stream.Kind.DATA);
    stream = streams.get(name);
    if (indexes[columnId] != null) {
      loadIndeces(indexes[columnId].getEntryList(), 0);
    }
  }

  @Override
  public void seek(int index) throws IOException {
    stream.seek(index);
  }

  @Override
  public int loadIndeces(List rowIndexEntries, int startIndex) {
    int updatedStartIndex = super.loadIndeces(rowIndexEntries, startIndex);
    return stream.loadIndeces(rowIndexEntries, updatedStartIndex);
  }

  /**
   * Read a double value from the stream.
   */
  private double readDouble() throws IOException {
    latestRead = SerializationUtils.readDouble(stream);;
    return latestRead;
  }


  DoubleWritable createWritable(Object previous, double v) throws IOException {
    DoubleWritable result = null;
    if (previous == null) {
      result = new DoubleWritable();
    } else {
      result = (DoubleWritable) previous;
    }
    result.set(v);
    return result;
  }

  @Override
  public Object createWritableFromLatest(Object previous) throws IOException {
    return createWritable(previous, latestRead);
  }

  /**
   * Give the next double as a primitive
   */
  @Override
  public double nextDouble(boolean readStream) throws IOException {
    if (!readStream) {
      return latestRead;
    }
    if (!valuePresent) {
      throw new ValueNotPresentException("Cannot materialize double.");
    }
    return readDouble();
  }

  /**
   * Give the next double as a Writable object.
   */
  @Override
  public Object next(Object previous) throws IOException {
    DoubleWritable result = null;
    if (valuePresent) {
      result = createWritable(previous, readDouble());
    }
    return result;
  }

  @Override
  public void skipRows(long numNonNullValues) throws IOException {
    stream.skip(numNonNullValues * 8);
  }

  @Override
  public void close() throws IOException {
    super.close();
    if (stream != null) {
      stream.close();
    }
  }
}




© 2015 - 2025 Weber Informatics LLC | Privacy Policy