EntryArray.h

/*
 * Copyright (c) 2008-2017, Hazelcast, Inc. All Rights Reserved.
 *
 * 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.
 */
//
// Created by ihsan demir on 25 02, 2016.
//
#ifndef HAZELCAST_CLIENT_ENTRYARRAY_H_
#define HAZELCAST_CLIENT_ENTRYARRAY_H_

#include <vector>

#include "hazelcast/util/Util.h"
#include "hazelcast/client/exception/IllegalArgumentException.h"
#include "hazelcast/util/Comparator.h"
#include "hazelcast/client/query/PagingPredicate.h"
#include "hazelcast/client/serialization/pimpl/SerializationService.h"
#include "DataArray.h"

namespace hazelcast {
    namespace client {
        template<typename K, typename V>
        class EntryArray {
        public:
            virtual ~EntryArray() { }

            virtual size_t size() const = 0;

            virtual const K *getKey(size_t index) = 0;

            virtual std::auto_ptr<K> releaseKey(size_t index) = 0;

            virtual const V *getValue(size_t index) = 0;

            virtual std::auto_ptr<V> releaseValue(size_t index) = 0;

            virtual std::pair<const K *, const V *> operator[](size_t index) = 0;

            virtual void sort(query::IterationType iterationType, const util::Comparator<std::pair<const K *, const V *> > *comparator = 0) = 0;
        };
    }
}

#endif //HAZELCAST_CLIENT_ENTRYARRAY_H_