Makes List a random-access data structure. This simplifies the implementation and makes it easier to implement test shuffling.

1 files changed, 1 insertions, 6 deletions

diff --git a/src/gtest-test-part.cc b/src/gtest-test-part.cc
index 49a6fe5..472b8c5 100644
--- a/src/gtest-test-part.cc
+++ b/src/gtest-test-part.cc
@@ -86,12 +86,7 @@ const TestPartResult& TestPartResultArray::GetTestPartResult(int index) const {
     internal::posix::Abort();
   }
 
-  const internal::ListNode<TestPartResult>* p = list_->Head();
-  for (int i = 0; i < index; i++) {
-    p = p->next();
-  }
-
-  return p->element();
+  return list_->GetElement(index);
 }
 
 // Returns the number of TestPartResult objects in the array.