From 27f04a3733d273fc0ac4c7f68b1261208bdace59 Mon Sep 17 00:00:00 2001
From: Davis King <davis@dlib.net>
Date: Sat, 26 Sep 2015 12:52:36 -0400
Subject: [PATCH] fixed tabbing
---
dlib/dnn/core.h | 28 ++++-----
dlib/dnn/core_abstract.h | 132 +++++++++++++++++++--------------------
2 files changed, 80 insertions(+), 80 deletions(-)
diff --git a/dlib/dnn/core.h b/dlib/dnn/core.h
index ee743c92..2c45a652 100644
--- a/dlib/dnn/core.h
+++ b/dlib/dnn/core.h
@@ -51,25 +51,25 @@ namespace dlib
template <typename T, size_t N>
class sstack
{
- public:
- static_assert(N > 0, "You can't create an empty sstack.");
- typedef T value_type;
- const static size_t num_elements = N;
+ public:
+ static_assert(N > 0, "You can't create an empty sstack.");
+ typedef T value_type;
+ const static size_t num_elements = N;
- sstack() {}
- sstack(const T& item_) : item(item_), data(item_) {}
+ sstack() {}
+ sstack(const T& item_) : item(item_), data(item_) {}
- const T& top() const { return item; }
- T& top() { return item; }
+ const T& top() const { return item; }
+ T& top() { return item; }
- size_t size() const { return N; }
+ size_t size() const { return N; }
- const sstack<T,N-1>& pop() const { return data; }
- sstack<T,N-1>& pop() { return data; }
+ const sstack<T,N-1>& pop() const { return data; }
+ sstack<T,N-1>& pop() { return data; }
- private:
- T item;
- sstack<T,N-1> data;
+ private:
+ T item;
+ sstack<T,N-1> data;
};
template <typename T>
diff --git a/dlib/dnn/core_abstract.h b/dlib/dnn/core_abstract.h
index 945ed87d..9a18e9da 100644
--- a/dlib/dnn/core_abstract.h
+++ b/dlib/dnn/core_abstract.h
@@ -52,72 +52,72 @@ namespace dlib
entirely allocated on the stack.
!*/
- public:
- typedef T value_type;
- const static size_t num_elements = N;
-
- sstack(
- );
- /*!
- ensures
- - #size() == N
- - All elements of this stack are default constructed.
- !*/
-
- sstack(
- const T& item
- );
- /*!
- ensures
- - #size() == N
- - Initializes all N elements in this stack with the given item.
- E.g. top()==item, pop().top()==item, pop().pop().top()==item, etc.
- !*/
-
- const T& top(
- ) const;
- /*!
- ensures
- - returns the top element of the stack.
- !*/
-
- T& top(
- );
- /*!
- ensures
- - returns the top element of the stack.
- !*/
-
-
- size_t size(
- ) const;
- /*!
- ensures
- - returns the number of elements in this stack. In particular, the
- number returned is always N.
- !*/
-
- const sstack<T,N-1>& pop(
- ) const;
- /*!
- requires
- - size() > 1
- ensures
- - returns a reference to the sub-stack S such that:
- - S.size() == size()-1.
- - S.top() is the next element in the stack.
- !*/
-
- sstack<T,N-1>& pop(
- );
- /*!
- requires
- - size() > 1
- ensures
- - returns a reference to the sub-stack S such that:
- - S.size() == size()-1.
- - S.top() is the next element in the stack.
- !*/
+ public:
+ typedef T value_type;
+ const static size_t num_elements = N;
+
+ sstack(
+ );
+ /*!
+ ensures
+ - #size() == N
+ - All elements of this stack are default constructed.
+ !*/
+
+ sstack(
+ const T& item
+ );
+ /*!
+ ensures
+ - #size() == N
+ - Initializes all N elements in this stack with the given item. E.g.
+ top()==item, pop().top()==item, pop().pop().top()==item, etc.
+ !*/
+
+ const T& top(
+ ) const;
+ /*!
+ ensures
+ - returns the top element of the stack.
+ !*/
+
+ T& top(
+ );
+ /*!
+ ensures
+ - returns the top element of the stack.
+ !*/
+
+
+ size_t size(
+ ) const;
+ /*!
+ ensures
+ - returns the number of elements in this stack. In particular, the number
+ returned is always N.
+ !*/
+
+ const sstack<T,N-1>& pop(
+ ) const;
+ /*!
+ requires
+ - size() > 1
+ ensures
+ - returns a reference to the sub-stack S such that:
+ - S.size() == size()-1.
+ - S.top() is the next element in the stack.
+ !*/
+
+ sstack<T,N-1>& pop(
+ );
+ /*!
+ requires
+ - size() > 1
+ ensures
+ - returns a reference to the sub-stack S such that:
+ - S.size() == size()-1.
+ - S.top() is the next element in the stack.
+ !*/
};
// ----------------------------------------------------------------------------------------
--
2.18.0