proj/gentoo: Initial commit

This commit represents a new era for Gentoo:
Storing the gentoo-x86 tree in Git, as converted from CVS.

This commit is the start of the NEW history.
Any historical data is intended to be grafted onto this point.

Creation process:
1. Take final CVS checkout snapshot
2. Remove ALL ChangeLog* files
3. Transform all Manifests to thin
4. Remove empty Manifests
5. Convert all stale $Header$/$Id$ CVS keywords to non-expanded Git $Id$
5.1. Do not touch files with -kb/-ko keyword flags.

Signed-off-by: Robin H. Johnson <robbat2@gentoo.org>
X-Thanks: Alec Warner <antarus@gentoo.org> - did the GSoC 2006 migration tests
X-Thanks: Robin H. Johnson <robbat2@gentoo.org> - infra guy, herding this project
X-Thanks: Nguyen Thai Ngoc Duy <pclouds@gentoo.org> - Former Gentoo developer, wrote Git features for the migration
X-Thanks: Brian Harring <ferringb@gentoo.org> - wrote much python to improve cvs2svn
X-Thanks: Rich Freeman <rich0@gentoo.org> - validation scripts
X-Thanks: Patrick Lauer <patrick@gentoo.org> - Gentoo dev, running new 2014 work in migration
X-Thanks: Michał Górny <mgorny@gentoo.org> - scripts, QA, nagging
X-Thanks: All of other Gentoo developers - many ideas and lots of paint on the bikeshed

1 files changed, 45 insertions, 0 deletions

diff --git a/media-libs/raul/files/raul-0.8.0-gcc47.patch b/media-libs/raul/files/raul-0.8.0-gcc47.patch
new file mode 100644
index 000000000000..c9cb2d080931
--- /dev/null
+++ b/media-libs/raul/files/raul-0.8.0-gcc47.patch
@@ -0,0 +1,45 @@
+https://bugs.gentoo.org/show_bug.cgi?id=425274
+Build with gcc 4.7
+
+Index: raul-0.8.0/raul/PathTable.hpp
+===================================================================
+--- raul-0.8.0.orig/raul/PathTable.hpp
++++ raul-0.8.0/raul/PathTable.hpp
+@@ -37,13 +37,13 @@ public:
+ 	typename Table<Path, T>::iterator find_descendants_end(
+ 			typename Table<Path, T>::iterator parent)
+ 	{
+-		return find_range_end(parent, &Path::descendant_comparator);
++		return this->find_range_end(parent, &Path::descendant_comparator);
+ 	}
+ 
+ 	typename Table<Path, T>::const_iterator find_descendants_end(
+ 			typename Table<Path, T>::const_iterator parent) const
+ 	{
+-		return find_range_end(parent, &Path::descendant_comparator);
++		return this->find_range_end(parent, &Path::descendant_comparator);
+ 	}
+ };
+ 
+Index: raul-0.8.0/raul/TableImpl.hpp
+===================================================================
+--- raul-0.8.0.orig/raul/TableImpl.hpp
++++ raul-0.8.0/raul/TableImpl.hpp
+@@ -249,7 +249,7 @@ Table<K, T>::cram(const Table<K,T>& rang
+ 	assert(is_sorted());
+ #endif
+ 
+-	return make_pair(iterator(*this, insert_index), true);
++	return std::make_pair(iterator(*this, insert_index), true);
+ }
+ 
+ 
+@@ -339,7 +339,7 @@ Table<K, T>::operator[](const K& key)
+ 	if (i != end()) {
+ 		return i->second;
+ 	} else {
+-		std::pair<iterator,bool> ret = insert(make_pair(key, T()));
++		std::pair<iterator,bool> ret = insert(std::make_pair(key, T()));
+ 		return ret.first->second;
+ 	}
+ }