com.bigdata.dastor.service.RangeSliceResponseResolver.java Source code

Introduction

Here is the source code for com.bigdata.dastor.service.RangeSliceResponseResolver.java

Source

/**
 * 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.bigdata.dastor.service;

import java.io.IOException;
import java.net.InetAddress;
import java.util.*;

import org.apache.log4j.Logger;

import org.apache.commons.collections.iterators.CollatingIterator;

import com.bigdata.dastor.db.ColumnFamily;
import com.bigdata.dastor.db.RangeSliceReply;
import com.bigdata.dastor.db.Row;
import com.bigdata.dastor.dht.IPartitioner;
import com.bigdata.dastor.net.Message;
import com.bigdata.dastor.utils.Pair;
import com.bigdata.dastor.utils.ReducingIterator;
import com.google.common.collect.AbstractIterator;

/**
 * Turns RangeSliceReply objects into row (string -> CF) maps, resolving
 * to the most recent ColumnFamily and setting up read repairs as necessary.
 */
public class RangeSliceResponseResolver implements IResponseResolver<List<Row>> {
    private static final Logger logger = Logger.getLogger(RangeSliceResponseResolver.class);
    private final String table;
    private final List<InetAddress> sources;
    private final IPartitioner partitioner;

    public RangeSliceResponseResolver(String table, List<InetAddress> sources, IPartitioner partitioner) {
        assert sources.size() > 0;
        this.table = table;
        this.sources = sources;
        this.partitioner = partitioner;
    }

    public List<Row> resolve(Collection<Message> responses) throws DigestMismatchException, IOException {
        CollatingIterator collator = new CollatingIterator(new Comparator<Pair<Row, InetAddress>>() {
            public int compare(Pair<Row, InetAddress> o1, Pair<Row, InetAddress> o2) {
                return partitioner.getToken(o1.left.key).compareTo(partitioner.getToken(o2.left.key));
            }
        });

        int n = 0;
        for (Message response : responses) {
            RangeSliceReply reply = RangeSliceReply.read(response.getMessageBody());
            n = Math.max(n, reply.rows.size());
            collator.addIterator(new RowIterator(reply.rows.iterator(), response.getFrom()));
        }

        // for each row, compute the combination of all different versions seen, and repair incomplete versions
        ReducingIterator<Pair<Row, InetAddress>, Row> iter = new ReducingIterator<Pair<Row, InetAddress>, Row>(
                collator) {
            List<ColumnFamily> versions = new ArrayList<ColumnFamily>(sources.size());
            List<InetAddress> versionSources = new ArrayList<InetAddress>(sources.size());
            String key;

            @Override
            protected boolean isEqual(Pair<Row, InetAddress> o1, Pair<Row, InetAddress> o2) {
                return o1.left.key.equals(o2.left.key);
            }

            public void reduce(Pair<Row, InetAddress> current) {
                key = current.left.key;
                versions.add(current.left.cf);
                versionSources.add(current.right);
            }

            protected Row getReduced() {
                ColumnFamily resolved = ReadResponseResolver.resolveSuperset(versions);
                ReadResponseResolver.maybeScheduleRepairs(resolved, table, key, versions, versionSources);
                versions.clear();
                versionSources.clear();
                return new Row(key, resolved);
            }
        };

        List<Row> resolvedRows = new ArrayList<Row>(n);
        while (iter.hasNext())
            resolvedRows.add(iter.next());

        return resolvedRows;
    }

    public void preprocess(Message message) {
    }

    public boolean isDataPresent(Collection<Message> responses) {
        return responses.size() >= sources.size();
    }

    private static class RowIterator extends AbstractIterator<Pair<Row, InetAddress>> {
        private final Iterator<Row> iter;
        private final InetAddress source;

        private RowIterator(Iterator<Row> iter, InetAddress source) {
            this.iter = iter;
            this.source = source;
        }

        @Override
        protected Pair<Row, InetAddress> computeNext() {
            return iter.hasNext() ? new Pair<Row, InetAddress>(iter.next(), source) : endOfData();
        }
    }
}