King_DuckZ/dindexer
1
0
Fork 0
mirror of https://github.com/KingDuckZ/dindexer.git synced 2025-08-11 14:19:49 +00:00
Code Issues Releases Wiki Activity

Move flatinsertin2dlist to postgresql backend.

Browse source 
It's the only place using that header and its use is so
specialized I struggle to even remember what it does.
This commit is contained in:
King_DuckZ 2016-07-14 11:24:41 +01:00
parent 0b10316d9e
commit dc814b4d09
3 changed files with 2 additions and 2 deletions
Download patch file Download diff file Expand all files Collapse all files

59
include/helpers/flatinsertin2dlist.hpp
View file

@ -1,59 +0,0 @@
/* Copyright 2015, 2016, Michele Santullo
* This file is part of "dindexer".
*
* "dindexer" is free software: you can redistribute it and/or modify
* it under the terms of the GNU General Public License as published by
* the Free Software Foundation, either version 3 of the License, or
* (at your option) any later version.
*
* "dindexer" is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU General Public License for more details.
*
* You should have received a copy of the GNU General Public License
* along with "dindexer". If not, see <http://www.gnu.org/licenses/>.
*/
#ifndef idAA901DA47E234E37B325B3192EF50423
#define idAA901DA47E234E37B325B3192EF50423
//Use this function to turn a 1D sequence of elements that are logically grouped
//together by position into a 2D list. For example, if you have an input sequence
//like {A1, B1, C1, A2, B2, C2, A3, B3, C3} and you want to turn it into
//{ {A1, B1, C1}, {A2, B2, C2}, {A3, B3, C3} } you can use these functions to
//achieve that. You need to specify the size of the innermost groups, 3 in the
//example just given, and push_back() will automatically move to the next
//sublist every 3 items.
#include <cstddef>
#include <cassert>
#include <ciso646>
#include <stdexcept>
#include <utility>
namespace dinhelp {
template <typename OuterList, typename InnerList=typename OuterList::value_type, typename InnerVal=typename InnerList::value_type>
class FlatInsertIn2DList {
public:
typedef OuterList list_type;
typedef InnerVal value_type;
typedef InnerList inner_list_type;
FlatInsertIn2DList ( list_type* parList, std::size_t parInnerCount, std::size_t parOuterCount=0 );
void push_back ( value_type&& parValue );
void push_back ( const value_type& parValue );
std::size_t size ( void ) const;
private:
void expand_array ( void );
list_type* const m_list;
const std::size_t m_inner_count;
const std::size_t m_outer_count;
};
} //namespace dinhelp
#include "implem/flatinsertin2dlist.inl"
#endif

73
include/helpers/implem/flatinsertin2dlist.inl
View file

@ -1,73 +0,0 @@
/* Copyright 2015, 2016, Michele Santullo
* This file is part of "dindexer".
*
* "dindexer" is free software: you can redistribute it and/or modify
* it under the terms of the GNU General Public License as published by
* the Free Software Foundation, either version 3 of the License, or
* (at your option) any later version.
*
* "dindexer" is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU General Public License for more details.
*
* You should have received a copy of the GNU General Public License
* along with "dindexer". If not, see <http://www.gnu.org/licenses/>.
*/
namespace dinhelp {
template <typename OuterList, typename InnerList, typename InnerVal>
FlatInsertIn2DList<OuterList, InnerList, InnerVal>::FlatInsertIn2DList (list_type* parList, std::size_t parInnerCount, std::size_t parOuterCount) :
m_list(parList),
m_inner_count(parInnerCount),
m_outer_count(parOuterCount)
{
assert(m_list);
if (m_outer_count) {
m_list->reserve(m_outer_count);
}
}
template <typename OuterList, typename InnerList, typename InnerVal>
void FlatInsertIn2DList<OuterList, InnerList, InnerVal>::push_back (value_type&& parValue) {
expand_array();
const auto curr_outer_index = m_list->size() - 1;
(*m_list)[curr_outer_index].push_back(std::move(parValue));
}
template <typename OuterList, typename InnerList, typename InnerVal>
void FlatInsertIn2DList<OuterList, InnerList, InnerVal>::push_back (const value_type& parValue) {
expand_array();
const auto curr_outer_index = m_list->size() - 1;
(*m_list)[curr_outer_index].push_back(parValue);
}
template <typename OuterList, typename InnerList, typename InnerVal>
void FlatInsertIn2DList<OuterList, InnerList, InnerVal>::expand_array() {
auto& list = *m_list;
const auto inner_size = (list.empty() ? m_inner_count : list[list.size() - 1].size());
if (inner_size == m_inner_count) {
if (not m_outer_count or list.size() < m_outer_count) {
list.push_back(inner_list_type());
list[list.size() - 1].reserve(m_inner_count);
}
else {
throw std::runtime_error("Outer list is full");
}
}
assert(not m_outer_count or list.size() <= m_outer_count);
assert(list.size() > 0);
assert(list[list.size() - 1].size() <= m_inner_count);
}
template <typename OuterList, typename InnerList, typename InnerVal>
std::size_t FlatInsertIn2DList<OuterList, InnerList, InnerVal>::size() const {
if (m_list->empty()) {
return 0;
}
else {
return (m_list->size() - 1) * m_inner_count + m_list[m_list->size() - 1].size();
}
}
} //namespace dinhelp