rhs.clear();
rhs.resize(m_unownedSize);
std::copy(m_unownedData, m_unownedData + m_unownedSize, rhs.begin());
- m_unownedData = nullptr;
+ m_unownedData = 0;
m_unownedSize = 0;
} else {
m_data.swap(rhs);
template <typename T>
inline const std::string BAD_SUBSCRIPT_WITH_KEY(
- const T&, typename disable_if<is_numeric<T>>::type* = nullptr) {
+ const T&, typename disable_if<is_numeric<T>>::type* = 0) {
return BAD_SUBSCRIPT;
}
template <typename T>
inline const std::string BAD_SUBSCRIPT_WITH_KEY(
- const T& key, typename enable_if<is_numeric<T>>::type* = nullptr) {
+ const T& key, typename enable_if<is_numeric<T>>::type* = 0) {
std::stringstream stream;
stream << BAD_SUBSCRIPT << " (key: \"" << key << "\")";
return stream.str();
struct get_idx {
static node* get(const std::vector<node*>& /* sequence */,
const Key& /* key */, shared_memory_holder /* pMemory */) {
- return nullptr;
+ return 0;
}
};
!std::is_same<Key, bool>::value>::type> {
static node* get(const std::vector<node*>& sequence, const Key& key,
shared_memory_holder /* pMemory */) {
- return key < sequence.size() ? sequence[key] : nullptr;
+ return key < sequence.size() ? sequence[key] : 0;
}
static node* get(std::vector<node*>& sequence, const Key& key,
shared_memory_holder pMemory) {
return key >= 0 ? get_idx<std::size_t>::get(
sequence, static_cast<std::size_t>(key), pMemory)
- : nullptr;
+ : 0;
}
static node* get(std::vector<node*>& sequence, const Key& key,
shared_memory_holder pMemory) {
return key >= 0 ? get_idx<std::size_t>::get(
sequence, static_cast<std::size_t>(key), pMemory)
- : nullptr;
+ : 0;
}
};
break;
case NodeType::Undefined:
case NodeType::Null:
- return nullptr;
+ return NULL;
case NodeType::Sequence:
if (node* pNode = get_idx<Key>::get(m_sequence, key, pMemory))
return pNode;
- return nullptr;
+ return NULL;
case NodeType::Scalar:
throw BadSubscript(key);
}
}
}
- return nullptr;
+ return NULL;
}
template <typename Key>
struct node_iterator_value : public std::pair<V*, V*> {
typedef std::pair<V*, V*> kv;
- node_iterator_value() : kv(), pNode(nullptr) {}
+ node_iterator_value() : kv(), pNode(0) {}
explicit node_iterator_value(V& rhs) : kv(), pNode(&rhs) {}
- explicit node_iterator_value(V& key, V& value) : kv(&key, &value), pNode(nullptr) {}
+ explicit node_iterator_value(V& key, V& value) : kv(&key, &value), pNode(0) {}
V& operator*() const { return *pNode; }
V& operator->() const { return *pNode; }
: m_isValid(false), m_invalidKey{}, m_pMemory{}, m_pNode(nullptr) {}
inline Node::Node(Zombie, const std::string& key)
- : m_isValid(false), m_invalidKey(key), m_pMemory{}, m_pNode(nullptr) {}
+ : m_isValid(false), m_invalidKey(key), m_pMemory{}, m_pNode(NULL) {}
inline Node::Node(detail::node& node, detail::shared_memory_holder pMemory)
: m_isValid(true), m_invalidKey{}, m_pMemory(pMemory), m_pNode(&node) {}
const char* str() const {
if (m_pStream) {
- return nullptr;
+ return 0;
} else {
m_buffer[m_pos] = '\0';
return &m_buffer[0];