Searched refs:moves (Results 1 – 6 of 6) sorted by relevance
279 val moves = in <lambda>() constant293 assertThat(moves.size).isEqualTo(numberOfEvents) in <lambda>()295 for ((moveIndex, move) in moves.withIndex()) { in <lambda>()318 val moves = in <lambda>() constant330 assertThat(moves.size).isEqualTo(numberOfEvents) in <lambda>()332 for ((moveIndex, move) in moves.withIndex()) { in <lambda>()355 val moves = in <lambda>() constant367 assertThat(moves.size).isEqualTo(numberOfEvents) in <lambda>()369 for ((moveIndex, move) in moves.withIndex()) { in <lambda>()393 val moves = in <lambda>() constant[all …]
184 val moves = in <lambda>() constant197 if (moves.isNotEmpty()) { in <lambda>()198 moves.last() in <lambda>()224 for (move in moves) { in <lambda>()
235 val moves = in <lambda>() constant247 if (moves.isNotEmpty()) { in <lambda>()248 moves.last() in <lambda>()282 for (move in moves) { in <lambda>()
74 composition so if data moves around in the collections a lot more recomposition is performed than139 the item moves between columns. This implementation is incorrect as it doesn't preserve the same239 * `+` Movable content lambdas behave like normal composition functions except the state moves with334 * `+` The compound hashcode is fixed as the movable content moves.342 implies that as it moves, the compound hashcode could change.344 * `-` The compound hashcode can change as the value placement moves. This might cause unexpected
314 Currently moves can only be generated by using a `key` composable. This adds an additional key obje…320 …eds to be moved and no changes are scheduled. Just like deletes, adjacent moves are also coalesced…
127 in the original semantics tree, and "moves" the property into the fake node. Fake nodes don't