/* * 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. * * Copyright 2015 Danny Robson */ #ifndef __UTIL_MEMORY_BUFFER_CIRCULAR_HPP #define __UTIL_MEMORY_BUFFER_CIRCULAR_HPP #include "../../view.hpp" #include namespace util::memory::buffer { // buffer size is advisory and will likely depend on page size. the user // must check the size after creation if this field is important for // their usage. template class circular { public: using value_type = ValueT; using iterator = value_type*; using const_iterator = const value_type*; explicit circular (size_t bytes); ~circular (); circular (const circular&) = delete; circular (circular&&) = delete; circular& operator= (const circular&) = delete; circular& operator= (circular&&) = delete; value_type& operator[] (size_t)&; const value_type& operator[] (size_t) const&; iterator begin (void)&; iterator end (void)&; const_iterator begin (void) const&; const_iterator end (void) const&; size_t size (void) const; /// rebases the pointer so that it points to within the first /// repetition of the data buffer. iterator constrain (iterator); /// rebases a pair of pointers so they fall within a contiguous span of /// the data buffer. util::view constrain (util::view); private: value_type *m_begin, *m_end; }; } #endif