From 43f71daa95ad63e1a1901284be77d8ea3ebce8b8 Mon Sep 17 00:00:00 2001
From: ed <eddavies95@gmail.com>
Date: Thu, 4 Apr 2019 11:12:47 +0100
Subject: [PATCH] Projucer:  Added a workaround for errors in the live-build
 engine from the system headers included with the macOS 10.14 SDK

---
 .../native/juce_mac_ClangBugWorkaround.h      | 90 +++++++++++++++++++
 1 file changed, 90 insertions(+)

diff --git a/modules/juce_core/native/juce_mac_ClangBugWorkaround.h b/modules/juce_core/native/juce_mac_ClangBugWorkaround.h
index 3bbee9ae3c..1e286bc972 100644
--- a/modules/juce_core/native/juce_mac_ClangBugWorkaround.h
+++ b/modules/juce_core/native/juce_mac_ClangBugWorkaround.h
@@ -32,4 +32,94 @@
  // in the live-build engine.
  #define _Nullable
  #define _Nonnull
+
+ // In the 10.14 SDK these methods are defined in the <functional> header, which we don't compile
+ // in the live-build engine, so we'll define them here
+ #if defined (MAC_OS_X_VERSION_10_14)
+  #include <memory>
+
+  namespace std { inline namespace __1 {
+      template <class _BinaryPredicate, class _ForwardIterator1, class _ForwardIterator2>
+      pair<_ForwardIterator1, _ForwardIterator1> _LIBCPP_CONSTEXPR_AFTER_CXX11
+      __search(_ForwardIterator1 __first1, _ForwardIterator1 __last1,
+               _ForwardIterator2 __first2, _ForwardIterator2 __last2, _BinaryPredicate __pred,
+               forward_iterator_tag, forward_iterator_tag)
+      {
+          if (__first2 == __last2)
+              return make_pair(__first1, __first1);  // Everything matches an empty sequence
+          while (true)
+          {
+              // Find first element in sequence 1 that matchs *__first2, with a mininum of loop checks
+              while (true)
+              {
+                  if (__first1 == __last1)  // return __last1 if no element matches *__first2
+                      return make_pair(__last1, __last1);
+                  if (__pred(*__first1, *__first2))
+                      break;
+                  ++__first1;
+              }
+              // *__first1 matches *__first2, now match elements after here
+              _ForwardIterator1 __m1 = __first1;
+              _ForwardIterator2 __m2 = __first2;
+              while (true)
+              {
+                  if (++__m2 == __last2)  // If pattern exhausted, __first1 is the answer (works for 1 element pattern)
+                      return make_pair(__first1, __m1);
+                  if (++__m1 == __last1)  // Otherwise if source exhaused, pattern not found
+                      return make_pair(__last1, __last1);
+                  if (!__pred(*__m1, *__m2))  // if there is a mismatch, restart with a new __first1
+                  {
+                      ++__first1;
+                      break;
+                  }  // else there is a match, check next elements
+              }
+          }
+      }
+
+      template <class _BinaryPredicate, class _RandomAccessIterator1, class _RandomAccessIterator2>
+      _LIBCPP_CONSTEXPR_AFTER_CXX11
+      pair<_RandomAccessIterator1, _RandomAccessIterator1>
+      __search(_RandomAccessIterator1 __first1, _RandomAccessIterator1 __last1,
+               _RandomAccessIterator2 __first2, _RandomAccessIterator2 __last2, _BinaryPredicate __pred,
+               random_access_iterator_tag, random_access_iterator_tag)
+      {
+          typedef typename iterator_traits<_RandomAccessIterator1>::difference_type _D1;
+          typedef typename iterator_traits<_RandomAccessIterator2>::difference_type _D2;
+          // Take advantage of knowing source and pattern lengths.  Stop short when source is smaller than pattern
+          const _D2 __len2 = __last2 - __first2;
+          if (__len2 == 0)
+              return make_pair(__first1, __first1);
+          const _D1 __len1 = __last1 - __first1;
+          if (__len1 < __len2)
+              return make_pair(__last1, __last1);
+          const _RandomAccessIterator1 __s = __last1 - (__len2 - 1);  // Start of pattern match can't go beyond here
+
+          while (true)
+          {
+              while (true)
+              {
+                  if (__first1 == __s)
+                      return make_pair(__last1, __last1);
+                  if (__pred(*__first1, *__first2))
+                      break;
+                  ++__first1;
+              }
+
+              _RandomAccessIterator1 __m1 = __first1;
+              _RandomAccessIterator2 __m2 = __first2;
+              while (true)
+              {
+                  if (++__m2 == __last2)
+                      return make_pair(__first1, __first1 + __len2);
+                  ++__m1;          // no need to check range on __m1 because __s guarantees we have enough source
+                  if (!__pred(*__m1, *__m2))
+                  {
+                      ++__first1;
+                      break;
+                  }
+              }
+          }
+      }
+  } }
+ #endif
 #endif