94 lines
3.7 KiB
C++
94 lines
3.7 KiB
C++
/*
|
|
* Copyright (c) 2017, Intel Corporation
|
|
*
|
|
* Permission is hereby granted, free of charge, to any person obtaining a
|
|
* copy of this software and associated documentation files (the "Software"),
|
|
* to deal in the Software without restriction, including without limitation
|
|
* the rights to use, copy, modify, merge, publish, distribute, sublicense,
|
|
* and/or sell copies of the Software, and to permit persons to whom the
|
|
* Software is furnished to do so, subject to the following conditions:
|
|
*
|
|
* The above copyright notice and this permission notice shall be included
|
|
* in all copies or substantial portions of the Software.
|
|
*
|
|
* THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS
|
|
* OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
|
|
* FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL
|
|
* THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR
|
|
* OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE,
|
|
* ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR
|
|
* OTHER DEALINGS IN THE SOFTWARE.
|
|
*/
|
|
|
|
#pragma once
|
|
|
|
template <typename Arg1>
|
|
size_t countArgs(const Arg1 &arg1) {
|
|
return 1;
|
|
}
|
|
|
|
template <typename Arg1, typename... Rest>
|
|
size_t countArgs(const Arg1 &arg1, const Rest &... rest) {
|
|
return 1 + countArgs(rest...);
|
|
}
|
|
|
|
template <typename NodeObjectType, typename... Args>
|
|
int verifySequence(const NodeObjectType *base, int nodeNum, const NodeObjectType *last) {
|
|
if (base == last) {
|
|
return -1;
|
|
} else {
|
|
return nodeNum;
|
|
}
|
|
}
|
|
|
|
template <typename NodeObjectType, typename... Rest>
|
|
int verifySequence(const NodeObjectType *base, int nodeNum, const NodeObjectType *current, const Rest *... rest) {
|
|
if (base == nullptr) {
|
|
return nodeNum - 1;
|
|
} else if (base == current) {
|
|
return verifySequence(base->next, nodeNum + 1, rest...);
|
|
} else {
|
|
return nodeNum;
|
|
}
|
|
}
|
|
|
|
// Helper function for testing if nodes are placed exactly in given order
|
|
// Negative return values indicates that the sequence is ordered as requested.
|
|
// Non-negative value indicates first node that breaks the order.
|
|
template <typename NodeObjectType, typename... Rest>
|
|
int verifySequence(const NodeObjectType *base, const NodeObjectType *first, const Rest *... rest) {
|
|
return verifySequence(base, 0, first, rest...);
|
|
}
|
|
|
|
// Helper function for testing if nodes are placed exactly in given order
|
|
// Negative return values indicates that the sequence is ordered as requested.
|
|
// Non-negative value indicates first node that breaks the order.
|
|
// Note : verifies also "last->tail == nulptr"
|
|
template <typename NodeObjectType, typename... Rest>
|
|
int verifyFListOrder(const NodeObjectType *base, const NodeObjectType *first, const Rest *... rest) {
|
|
NodeObjectType *sentinel = nullptr;
|
|
int sequenceRet = verifySequence(base, first, rest..., sentinel);
|
|
if (sequenceRet < 0) {
|
|
return sequenceRet;
|
|
}
|
|
int totalReferenceNodes = (int)countArgs(first, rest...);
|
|
if (sequenceRet >= totalReferenceNodes) {
|
|
// base defines longer sequence than expected
|
|
return totalReferenceNodes - 1;
|
|
}
|
|
|
|
return sequenceRet;
|
|
}
|
|
|
|
// Helper function for testing if nodes are ordered exactly in given order
|
|
// Negative return values indicates that the sequence is ordered as requested.
|
|
// Non-negative value indicates first node that breaks the order.
|
|
// Note : verifies also "first->prev == nullptr" and "last->tail == nulptr"
|
|
template <typename NodeObjectType, typename... Rest>
|
|
int verifyDListOrder(const NodeObjectType *base, const NodeObjectType *first, const Rest *... rest) {
|
|
if (base->prev != nullptr) {
|
|
return 0;
|
|
}
|
|
return verifyFListOrder(base, first, rest...);
|
|
}
|