[Midnightbsd-cvs] mports [22513] trunk/devel/fam/files: move patch file

[laffer1 at midnightbsd.org]

Revision: 22513
          http://svnweb.midnightbsd.org/mports/?rev=22513
Author:   laffer1
Date:     2017-09-23 18:04:49 -0400 (Sat, 23 Sep 2017)
Log Message:
-----------
move patch file

Added Paths:
-----------
    trunk/devel/fam/files/patch-include__BTree.h

Removed Paths:
-------------
    trunk/devel/fam/files/patch-include::BTree.h

Deleted: trunk/devel/fam/files/patch-include::BTree.h
===================================================================
--- trunk/devel/fam/files/patch-include::BTree.h	2017-09-21 01:47:42 UTC (rev 22512)
+++ trunk/devel/fam/files/patch-include::BTree.h	2017-09-23 22:04:49 UTC (rev 22513)
@@ -1,56 +0,0 @@
---- include/BTree.h.orig	Tue Jul 16 14:23:25 2002
-+++ include/BTree.h	Sat Jul 31 13:13:24 2004
-@@ -236,7 +236,7 @@
- //  to the right and returns them.
- 
- template <class Key, class Value>
--BTree<Key, Value>::Closure
-+typename BTree<Key, Value>::Closure
- BTree<Key, Value>::Node::remove(unsigned j)
- {
-     Key k = key[j];
-@@ -348,7 +348,7 @@
- }
- 
- template <class Key, class Value>
--BTree<Key, Value>::Closure
-+typename BTree<Key, Value>::Closure
- BTree<Key, Value>::Node::next(const Key& pred) const
- {
-     if (!this)
-@@ -404,7 +404,7 @@
- //  nodes as necessary on the way back.
- 
- template <class Key, class Value>
--BTree<Key, Value>::Closure
-+typename BTree<Key, Value>::Closure
- BTree<Key, Value>::insert(Node *p, const Key& key, const Value& value)
- {
-     if (!p) return Closure(key, value, NULL);
-@@ -499,7 +499,7 @@
- //  Returns UNDER if node p is too small afterward, OK otherwise.
- 
- template <class Key, class Value>
--BTree<Key, Value>::Status
-+typename BTree<Key, Value>::Status
- BTree<Key, Value>::underflow(Node *p, unsigned i)
- {
-     assert(p);
-@@ -557,7 +557,7 @@
- 
- 
- template <class Key, class Value>
--BTree<Key, Value>::Closure
-+typename BTree<Key, Value>::Closure
- BTree<Key, Value>::remove_rightmost(Node *p)
- {
-     int i = p->n;
-@@ -587,7 +587,7 @@
- //  back up.
- 
- template <class Key, class Value>
--BTree<Key, Value>::Status
-+typename BTree<Key, Value>::Status
- BTree<Key, Value>::remove(Node *p, const Key& key)
- {
-     if (!p)

Copied: trunk/devel/fam/files/patch-include__BTree.h (from rev 22512, trunk/devel/fam/files/patch-include::BTree.h)
===================================================================
--- trunk/devel/fam/files/patch-include__BTree.h	                        (rev 0)
+++ trunk/devel/fam/files/patch-include__BTree.h	2017-09-23 22:04:49 UTC (rev 22513)
@@ -0,0 +1,56 @@
+--- include/BTree.h.orig	Tue Jul 16 14:23:25 2002
++++ include/BTree.h	Sat Jul 31 13:13:24 2004
+@@ -236,7 +236,7 @@
+ //  to the right and returns them.
+ 
+ template <class Key, class Value>
+-BTree<Key, Value>::Closure
++typename BTree<Key, Value>::Closure
+ BTree<Key, Value>::Node::remove(unsigned j)
+ {
+     Key k = key[j];
+@@ -348,7 +348,7 @@
+ }
+ 
+ template <class Key, class Value>
+-BTree<Key, Value>::Closure
++typename BTree<Key, Value>::Closure
+ BTree<Key, Value>::Node::next(const Key& pred) const
+ {
+     if (!this)
+@@ -404,7 +404,7 @@
+ //  nodes as necessary on the way back.
+ 
+ template <class Key, class Value>
+-BTree<Key, Value>::Closure
++typename BTree<Key, Value>::Closure
+ BTree<Key, Value>::insert(Node *p, const Key& key, const Value& value)
+ {
+     if (!p) return Closure(key, value, NULL);
+@@ -499,7 +499,7 @@
+ //  Returns UNDER if node p is too small afterward, OK otherwise.
+ 
+ template <class Key, class Value>
+-BTree<Key, Value>::Status
++typename BTree<Key, Value>::Status
+ BTree<Key, Value>::underflow(Node *p, unsigned i)
+ {
+     assert(p);
+@@ -557,7 +557,7 @@
+ 
+ 
+ template <class Key, class Value>
+-BTree<Key, Value>::Closure
++typename BTree<Key, Value>::Closure
+ BTree<Key, Value>::remove_rightmost(Node *p)
+ {
+     int i = p->n;
+@@ -587,7 +587,7 @@
+ //  back up.
+ 
+ template <class Key, class Value>
+-BTree<Key, Value>::Status
++typename BTree<Key, Value>::Status
+ BTree<Key, Value>::remove(Node *p, const Key& key)
+ {
+     if (!p)