function testBothColumnsIndexed_ReversePredicate() {
  var treeBefore =
      'project()\n' +
      '-join(type: inner, impl: hash, join_pred(TableB.id eq TableA.id))\n' +
      '--table_access(TableA)\n' +
      '--table_access(TableB)\n';

  var treeAfter =
      'project()\n' +
      '-join(type: inner, impl: index_nested_loop, ' +
          'join_pred(TableB.id eq TableA.id))\n' +
      '--table_access(TableA)\n' +
      '--no_op_step(TableB)\n';

  lf.testing.treeutil.assertTreeTransformation(
      constructTree1(
          schema.table('TableA'), schema.table('TableB'), true),
      treeBefore, treeAfter, pass);
}
Tests a simple tree, where
 - Only one join predicate exists.
 - Both columns of the join predicate have an index.
 - The columns in the join predicate appear in the reverse order compared
   to the order of the tables.
   Predicate has TableB on the left, TableA on the right, where as the join
   has TableA on the left and TableB on the right.