.tutorial

git-svn-id: svn://ultimatepp.org/upp/trunk@10559 f0d560ea-af0d-0410-9eb7-867de7ffcac7

tutorial/CoreTutorial/Parallel.cpp

@@ -0,0 +1,22 @@
+#include "Tutorial.h"
+
+void CoAlgoTutorial()
+{
+	/// .Parallel algorithms
+	
+	/// U++ provides a parallel version of algorithms where it makes sense. The naming scheme
+	/// is 'Co' prefix before the name of algorithm designates the parallel version.
+	
+	/// So the parallel version of e.g. `FindIndex` is `CoFindIndex`, for 'Sort' it is 'CoSort':
+	
+	Vector<String> x{ "zero", "one", "two", "three", "four", "five" };
+	
+	DUMP(FindIndex(x, "two"));
+	DUMP(CoFindIndex(x, "two"));
+	
+	CoSort(x);
+	DUMP(x);
+	
+	/// Caution should be exercised when using these algorithms - for small datasets, they are
+	/// almost certainly slower than single-threaded versions.
+}