//
// mp::short_queue
//
// Copyright (C) 2008 FURUHASHI Sadayuki
//
//    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 MP_SHORT_QUEUE_IMPL_H__
#define MP_SHORT_QUEUE_IMPL_H__

namespace mp {


template <typename T, typename Allocator>
short_queue<T, Allocator>::short_queue() : start(NULL)
{ }

template <typename T, typename Allocator>
short_queue<T, Allocator>::~short_queue()
{
	clear();
}

template <typename T, typename Allocator>
void short_queue<T, Allocator>::push()
{
	item_t* i = get_allocator().allocate(1);
	new (i->object) T();
	i->next = start;
	start = i;
}

MP_ARGS_BEGIN
template <typename T, typename Allocator>
template <MP_ARGS_TEMPLATE>
void short_queue<T, Allocator>::push(MP_ARGS_PARAMS)
{
	item_t* i = get_allocator().allocate(1);
	new (i->object) T(MP_ARGS_FUNC);
	i->next = start;
	start = i;
}
MP_ARGS_END

template <typename T, typename Allocator>
void short_queue<T, Allocator>::pop()
{
	if(empty()) { return; }  // FIXME
	item_t* i = start;
	while(i->next != NULL) { i = i->next; }
	reinterpret_cast<T*>(i->object)->~T();
	get_allocator().deallocate(i, 1);
	i->next = NULL;
}

template <typename T, typename Allocator>
void short_queue<T, Allocator>::clear()
{
	// FIXME 逆順
	while(start != NULL) {
		item_t* i = start;
		start = start->next;
		reinterpret_cast<T*>(i->object)->~T();
		get_allocator().deallocate(i, 1);
	}
}

template <typename T, typename Allocator>
bool short_queue<T, Allocator>::empty() const
{
	return start == NULL;
}

template <typename T, typename Allocator>
typename short_queue<T, Allocator>::iterator short_queue<T, Allocator>::begin()
{
	return iterator(start);
}


template <typename T, typename Allocator>
typename short_queue<T, Allocator>::iterator short_queue<T, Allocator>::end()
{
	return iterator(NULL);
}

template <typename T, typename Allocator>
typename short_queue<T, Allocator>::reference short_queue<T, Allocator>::top()
{
	return *begin();
}

template <typename T, typename Allocator>
typename short_queue<T, Allocator>::const_reference short_queue<T, Allocator>::top() const
{
	return *begin();
}

template <typename T, typename Allocator>
typename short_queue<T, Allocator>::allocator_type short_queue<T, Allocator>::get_allocator() const
{
	return allocator_type();
}


}  // namespace mp

#endif /* mp/queue_impl.h */