com.cinchapi.concourse.data.transform.DataTable Maven / Gradle / Ivy

Go to download

Show more of this group Show more artifacts with this name
Show all versions of concourse-driver-java Show documentation

Concourse is a self-tuning database that is designed for both ad hoc analytics and high volume transactions at scale. Developers use Concourse to quickly build mission critical software while also benefiting from real time insight into their most important data. With Concourse, end-to-end data management requires no extra infrastructure, no prior configuration and no additional coding–all of which greatly reduce costs and allow developers to focus on core business problems.

There is a newer version: 0.11.2

Show newest version

/*
 * Copyright (c) 2013-2019 Cinchapi Inc.
 *
 * Licensed 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.cinchapi.concourse.data.transform;

import java.util.AbstractMap;
import java.util.LinkedHashMap;
import java.util.Map;
import java.util.Set;
import java.util.stream.Collectors;

import javax.annotation.concurrent.NotThreadSafe;

import com.cinchapi.common.collect.lazy.LazyTransformSet;
import com.cinchapi.concourse.data.Table;
import com.cinchapi.concourse.thrift.TObject;
import com.cinchapi.concourse.util.Conversions;
import com.cinchapi.concourse.util.Convert;
import com.cinchapi.concourse.util.PrettyLinkedTableMap;

/**
 * A result {@link Table} that lazily transforms values from one type to another
 * and prettifies the string representation of the data.
 *
 * @author Jeff Nelson
 */
@NotThreadSafe
public abstract class DataTable extends AbstractMap>
        implements Table {

    /**
     * Return a {@link DataTable} that contains multi-valued cells of
     * {@link TObject} values that are converted to their Java equivalents.
     * 
     * @param data
     * @return the {@link DataTable}
     */
    public static  DataTable, Set> multiValued(
            Map>> data) {
        return new MultiValuedTable<>(data);
    }

    /**
     * Return a {@link DataTable} that contains single value cells
     * {@link TObject} values that are converted to their Java equivalents.
     * 
     * @param data
     * @return the {@link DataTable}
     */
    public static  DataTable singleValued(
            Map> data) {
        return new SingleValuedTable<>(data);
    }

    /**
     * The data that must be transformed.
     */
    private final Map> data;

    /**
     * A cache of the transformed and prettified results
     */
    private Map> pretty = null;

    /**
     * A cache of the transformed, but unpretty results.
     */
    private Map> transformed = null;

    /**
     * Construct a new instance.
     * 
     * @param data
     */
    protected DataTable(Map> data) {
        this.data = data;
    }

    @Override
    public Set>> entrySet() {
        if(transformed == null) {
            transformed = data.entrySet().stream().map(entry -> {
                Long key = entry.getKey();
                Map value = entry.getValue().entrySet().stream()
                        .map(e -> {
                            return new SimpleImmutableEntry<>(e.getKey(),
                                    transform(e.getValue()));
                        }).collect(
                                Collectors.toMap(Entry::getKey, Entry::getValue,
                                        (e1, e2) -> e2, LinkedHashMap::new));
                return new SimpleImmutableEntry<>(key, value);
            }).collect(Collectors.toMap(Entry::getKey, Entry::getValue,
                    (e1, e2) -> e2, LinkedHashMap::new));
        }
        return transformed.entrySet();
    }

    @Override
    public String toString() {
        if(pretty == null) {
            Map> $pretty = PrettyLinkedTableMap
                    .newPrettyLinkedTableMap("Record");
            entrySet().forEach(
                    entry -> $pretty.put(entry.getKey(), entry.getValue()));
            pretty = $pretty;
            transformed = pretty;
        }
        return pretty.toString();
    }

    /**
     * Transform the {@code value} to the appropriate type.
     * 
     * @param value
     * @return the transformed value.
     */
    protected abstract T transform(F value);

    /**
     * A {@link DataTable} for multi-valued cells.
     *
     * @author Jeff Nelson
     */
    private static class MultiValuedTable
            extends DataTable, Set> {

        /**
         * Construct a new instance.
         * 
         * @param data
         */
        protected MultiValuedTable(Map>> data) {
            super(data);
        }

        @Override
        protected Set transform(Set value) {
            return LazyTransformSet.of(value, Conversions.thriftToJavaCasted());
        }

    }

    /**
     * A {@link DataTable} for single-valued cells.
     *
     * @author Jeff Nelson
     */
    private static class SingleValuedTable extends DataTable {

        /**
         * Construct a new instance.
         * 
         * @param data
         */
        protected SingleValuedTable(Map> data) {
            super(data);
        }

        @SuppressWarnings("unchecked")
        @Override
        protected T transform(TObject value) {
            return (T) Convert.thriftToJava(value);
        }

    }

}