Chromium Code Reviews
chromiumcodereview-hr@appspot.gserviceaccount.com (chromiumcodereview-hr) | Please choose your nickname with Settings | Help | Chromium Project | Gerrit Changes | Sign out
(152)

Unified Diff: src/pdf/SkSinglyLinkedList.h

Issue 1839633003: SkPDF: PDFDevice::ContentEntry now implemented with SinglyLinkedList (Closed) Base URL: https://skia.googlesource.com/skia.git@master
Patch Set: 2016-03-28 (Monday) 13:12:45 EDT Created 4 years, 9 months ago
Use n/p to move between diff chunks; N/P to move between comments. Draft comments are only viewable by you.
Jump to:
View side-by-side diff with in-line comments
Download patch
« no previous file with comments | « src/pdf/SkPDFDevice.cpp ('k') | no next file » | no next file with comments »
Expand Comments ('e') | Collapse Comments ('c') | Show Comments Hide Comments ('s')
Index: src/pdf/SkSinglyLinkedList.h
diff --git a/src/pdf/SkSinglyLinkedList.h b/src/pdf/SkSinglyLinkedList.h
new file mode 100644
index 0000000000000000000000000000000000000000..c157c31d16c03e2543a82d6cb72f72e0d1fe5f33
--- /dev/null
+++ b/src/pdf/SkSinglyLinkedList.h
@@ -0,0 +1,95 @@
+/*
+ * Copyright 2016 Google Inc.
+ *
+ * Use of this source code is governed by a BSD-style license that can be
+ * found in the LICENSE file.
+ */
+#ifndef SkSinglyLinkedList_DEFINED
+#define SkSinglyLinkedList_DEFINED
+
+#include <utility>
+
+#include "SkTypes.h"
+
+template <typename T> class SkSinglyLinkedList {
+ struct Node;
+public:
+ SkSinglyLinkedList() : fHead(nullptr), fTail(nullptr) {}
+ ~SkSinglyLinkedList() { this->reset(); }
+ void reset() {
+ SkASSERT(fHead != nullptr || nullptr == fTail);
+ Node* node = fHead;
+ while (node) {
+ Node* next = node->fNext;
+ SkASSERT(next != nullptr || node == fTail);
+ delete node;
+ node = next;
+ }
+ fHead = nullptr;
+ fTail = nullptr;
+ }
+ T* back() { return fTail ? &fTail->fData : nullptr; }
+ T* front() { return fHead ? &fHead->fData : nullptr; }
+ #ifdef SK_DEBUG
+ int count() { // O(n), debug only.
+ int count = 0;
+ for (Node* node = fHead; node; node = node->fNext) {
+ ++count;
+ }
+ return count;
+ }
+ #endif
+ void pop_front() {
+ if (Node* node = fHead) {
+ fHead = node->fNext;
+ delete node;
+ if (fHead == nullptr) {
+ fTail = nullptr;
+ }
+ }
+ }
+ template <class... Args> T* emplace_front(Args&&... args) {
+ Node* n = new Node(std::forward<Args>(args)...);
+ n->fNext = fHead;
+ if (!fTail) {
+ fTail = n;
+ SkASSERT(!fHead);
+ }
+ fHead = n;
+ return &n->fData;
+ }
+ template <class... Args> T* emplace_back(Args&&... args) {
+ Node* n = new Node(std::forward<Args>(args)...);
+ if (fTail) {
+ fTail->fNext = n;
+ } else {
+ fHead = n;
+ }
+ fTail = n;
+ return &n->fData;
+ }
+ class ConstIter {
+ public:
+ void operator++() { fNode = fNode->fNext; }
+ const T& operator*() const { return fNode->fData; }
+ bool operator!=(const ConstIter& rhs) const { return fNode != rhs.fNode; }
+ ConstIter(const Node* n) : fNode(n) {}
+ private:
+ const Node* fNode;
+ };
+ ConstIter begin() const { return ConstIter(fHead); }
+ ConstIter end() const { return ConstIter(nullptr); }
+
+private:
+ struct Node {
+ T fData;
+ Node* fNext;
+ template <class... Args>
+ Node(Args&&... args) : fData(std::forward<Args>(args)...), fNext(nullptr) {}
+ };
+ Node* fHead;
+ Node* fTail;
+ SkSinglyLinkedList(const SkSinglyLinkedList<T>&) = delete;
+ SkSinglyLinkedList& operator=(const SkSinglyLinkedList<T>&) = delete;
+};
+#endif // SkSinglyLinkedList_DEFINED
« no previous file with comments | « src/pdf/SkPDFDevice.cpp ('k') | no next file » | no next file with comments »

Powered by Google App Engine
This is Rietveld 408576698