RawPointerQueue.h

/*
 * Copyright (c) 2008-2015, 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.
 */
#ifndef HAZELCAST_CLIENT_ADAPTOR_RAWPOINTERQUEUE_H_
#define HAZELCAST_CLIENT_ADAPTOR_RAWPOINTERQUEUE_H_

#include <memory>

#include "hazelcast/client/IQueue.h"
#include "hazelcast/client/impl/DataArrayImpl.h"

namespace hazelcast {
    namespace client {
        namespace adaptor {
            template<typename T>
            class RawPointerQueue {
            public:
                RawPointerQueue(IQueue<T> &q) : queue(q), serializationService(q.context->getSerializationService()) {
                }

                std::string addItemListener(ItemListener<T> &listener, bool includeValue) {
                    return queue.addItemListener(listener, includeValue);
                }

                bool removeItemListener(const std::string &registrationId) {
                    return queue.removeItemListener(registrationId);
                }

                bool offer(const T &element) {
                    return queue.offer(element, 0);
                }

                void put(const T &e) {
                    queue.offer(e, -1);
                }

                bool offer(const T &element, long timeoutInMillis) {
                    return queue.offer(element, timeoutInMillis);
                }

                std::auto_ptr<T> take() {
                    return serializationService.toObject<T>(queue.pollData(-1).get());
                }

                std::auto_ptr<T> poll(long timeoutInMillis) {
                    return serializationService.toObject<T>(queue.pollData(timeoutInMillis).get());
                }

                int remainingCapacity() {
                    return queue.remainingCapacity();
                }

                bool remove(const T &element) {
                    return queue.remove(element);
                }

                bool contains(const T &element) {
                    return queue.contains(element);
                }

                std::auto_ptr<DataArray<T> > drainTo() {
                    return std::auto_ptr<DataArray<T> >(new impl::DataArrayImpl<T>(queue.drainToData(-1), serializationService));
                }

                std::auto_ptr<DataArray<T> > drainTo(size_t maxElements) {
                    return std::auto_ptr<DataArray<T> >(new impl::DataArrayImpl<T>(queue.drainToData(maxElements), serializationService));
                }

                std::auto_ptr<T> poll() {
                    return serializationService.toObject<T>(queue.pollData(0).get());
                }

                std::auto_ptr<T> peek() {
                    return serializationService.toObject<T>(queue.peekData().get());
                }

                int size() {
                    return queue.size();
                }

                bool isEmpty() {
                    return queue.isEmpty();
                }

                std::auto_ptr<DataArray<T> > toArray() {
                    return std::auto_ptr<DataArray<T> >(new impl::DataArrayImpl<T>(queue.toArrayData(), serializationService));
                }

                bool containsAll(const std::vector<T> &elements) {
                    return queue.containsAll(elements);
                }

                bool addAll(const std::vector<T> &elements) {
                    return queue.addAll(elements);
                }

                bool removeAll(const std::vector<T> &elements) {
                    return queue.removeAll(elements);
                }

                bool retainAll(const std::vector<T> &elements) {
                    return queue.retainAll(elements);
                }

                void clear() {
                    queue.clear();
                }

            private:
                IQueue<T> &queue;
                serialization::pimpl::SerializationService &serializationService;
            };
        }

    }
}

#endif /* HAZELCAST_CLIENT_ADAPTOR_RAWPOINTERQUEUE_H_ */