Merge pull request #2569 from bgianfo:master
PiperOrigin-RevId: 281321427
This commit is contained in:
		@@ -1185,7 +1185,7 @@ struct FlatTupleBase<FlatTuple<T...>, IndexSequence<Idx...>>
 | 
			
		||||
 | 
			
		||||
// Analog to std::tuple but with different tradeoffs.
 | 
			
		||||
// This class minimizes the template instantiation depth, thus allowing more
 | 
			
		||||
// elements that std::tuple would. std::tuple has been seen to require an
 | 
			
		||||
// elements than std::tuple would. std::tuple has been seen to require an
 | 
			
		||||
// instantiation depth of more than 10x the number of elements in some
 | 
			
		||||
// implementations.
 | 
			
		||||
// FlatTuple and ElemFromList are not recursive and have a fixed depth
 | 
			
		||||
@@ -1196,7 +1196,8 @@ template <typename... T>
 | 
			
		||||
class FlatTuple
 | 
			
		||||
    : private FlatTupleBase<FlatTuple<T...>,
 | 
			
		||||
                            typename MakeIndexSequence<sizeof...(T)>::type> {
 | 
			
		||||
  using Indices = typename FlatTuple::FlatTupleBase::Indices;
 | 
			
		||||
  using Indices = typename FlatTupleBase<
 | 
			
		||||
      FlatTuple<T...>, typename MakeIndexSequence<sizeof...(T)>::type>::Indices;
 | 
			
		||||
 | 
			
		||||
 public:
 | 
			
		||||
  FlatTuple() = default;
 | 
			
		||||
 
 | 
			
		||||
		Reference in New Issue
	
	Block a user