wuggy/Dactyloidae
wuggy/Dactyloidae
1
0
Fork 0
mirror of https://repo.dactyloidae.xyz/Dactyloidae/UXP.git synced 2026-09-22 16:37:31 +09:00
Code Issues Projects Releases Packages Wiki Activity

re-introduce old nss im too tired for this

Browse source
This commit is contained in:
wuggy 2026-06-30 06:37:32 +01:00
commit 3a838106b9
2871 changed files with 1374431 additions and 1762417 deletions
Download patch file Download diff file Expand all files Collapse all files

22
security/nss/gtests/google_test/gtest/samples/sample3-inl.h
View file

@ -29,8 +29,8 @@
// A sample program demonstrating using Google C++ testing framework.
#ifndef GOOGLETEST_SAMPLES_SAMPLE3_INL_H_
#define GOOGLETEST_SAMPLES_SAMPLE3_INL_H_
#ifndef GTEST_SAMPLES_SAMPLE3_INL_H_
#define GTEST_SAMPLES_SAMPLE3_INL_H_
#include <stddef.h>
@ -58,8 +58,7 @@ class QueueNode {
private:
// Creates a node with a given element value. The next pointer is
// set to NULL.
explicit QueueNode(const E& an_element)
: element_(an_element), next_(nullptr) {}
explicit QueueNode(const E& an_element) : element_(an_element), next_(NULL) {}
// We disable the default assignment operator and copy c'tor.
const QueueNode& operator = (const QueueNode&);
@ -73,7 +72,7 @@ template <typename E> // E is the element type.
class Queue {
public:
// Creates an empty queue.
Queue() : head_(nullptr), last_(nullptr), size_(0) {}
Queue() : head_(NULL), last_(NULL), size_(0) {}
// D'tor. Clears the queue.
~Queue() { Clear(); }
@ -87,12 +86,12 @@ class Queue {
for (; ;) {
delete node;
node = next;
if (node == nullptr) break;
if (node == NULL) break;
next = node->next();
}
// 2. Resets the member variables.
head_ = last_ = nullptr;
head_ = last_ = NULL;
size_ = 0;
}
}
@ -129,14 +128,14 @@ class Queue {
// the queue is empty.
E* Dequeue() {
if (size_ == 0) {
return nullptr;
return NULL;
}
const QueueNode<E>* const old_head = head_;
head_ = head_->next_;
size_--;
if (size_ == 0) {
last_ = nullptr;
last_ = NULL;
}
E* element = new E(old_head->element());
@ -151,8 +150,7 @@ class Queue {
template <typename F>
Queue* Map(F function) const {
Queue* new_queue = new Queue();
for (const QueueNode<E>* node = head_; node != nullptr;
node = node->next_) {
for (const QueueNode<E>* node = head_; node != NULL; node = node->next_) {
new_queue->Enqueue(function(node->element()));
}
@ -169,4 +167,4 @@ class Queue {
const Queue& operator = (const Queue&);
};
#endif // GOOGLETEST_SAMPLES_SAMPLE3_INL_H_
#endif // GTEST_SAMPLES_SAMPLE3_INL_H_