Lines Matching refs:i
73 int i; in doContainerTest() local
77 for (i = 0; i < nTests * 2; i++) in doContainerTest()
79 xRefs[i] = new ContainerListener(&aStats); in doContainerTest()
80 pContainer->addInterface(pTypes[i / 2], xRefs[i]); in doContainerTest()
84 for (i = 0; i < nTests; i++) in doContainerTest()
88 pHelper = pContainer->getContainer(pTypes[i]); in doContainerTest()
93 ASSERT_TRUE(aSeq[0] == xRefs[i*2]) << "match"; in doContainerTest()
94 ASSERT_TRUE(aSeq[1] == xRefs[i*2+1]) << "match"; in doContainerTest()
98 for (i = 0; i < nTests; i++) in doContainerTest()
99 pContainer->removeInterface(pTypes[i], xRefs[i*2+1]); in doContainerTest()
102 for (i = 0; i < nTests; i++) in doContainerTest()
106 pHelper = pContainer->getContainer(pTypes[i]); in doContainerTest()
111 ASSERT_TRUE(aSeq[0] == xRefs[i*2]) << "match"; in doContainerTest()
115 for (i = 0; i < nTests / 2; i++) in doContainerTest()
116 pContainer->removeInterface(pTypes[i], xRefs[i*2]); in doContainerTest()
119 for (i = 0; i < nTests / 2; i++) in doContainerTest()
123 pHelper = pContainer->getContainer(pTypes[i]); in doContainerTest()
142 int i; in TEST_F() local
143 for (i = 0; i < nTests; i++) in TEST_F()
148 ASSERT_TRUE(nNewLen == i + 1) << "addition length mismatch"; in TEST_F()
149 ASSERT_TRUE(pContainer->getLength() == i + 1) << "addition length mismatch"; in TEST_F()
164 int i; in TEST_F() local
170 for (i = 0; i < nTests; i++) in TEST_F()
182 for (i = 0; i < nTests; i++) in TEST_F()
184 ASSERT_TRUE(aElements[i] == aListeners[i]) << "mismatching elements"; in TEST_F()