/*
 * Licensed to the Apache Software Foundation (ASF) under one
 * or more contributor license agreements.  See the NOTICE file
 * distributed with this work for additional information
 * regarding copyright ownership.  The ASF licenses this file
 * to you under the Apache License, Version 2.0 (the
 * "License"); you may not use this file except in compliance
 * with the License.  You may obtain a copy of the License at
 *
 *   http://www.apache.org/licenses/LICENSE-2.0
 *
 * Unless required by applicable law or agreed to in writing,
 * software distributed under the License is distributed on an
 * "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY
 * KIND, either express or implied.  See the License for the
 * specific language governing permissions and limitations
 * under the License.
 */
/*
 * Description    : Self-joins a dataset on the intersection of its point attribute.
 *                  The dataset has an enforced open RTree index, and we expect the
 *                  join to be transformed into an indexed nested-loop join.
 * Success        : Yes
 */

drop  dataverse test if exists;
create  dataverse test;

use test;


create type test.MyRecord as
 closed {
  id : int32,
  point : point,
  kwds : string,
  line1 : line,
  line2 : line,
  poly1 : polygon,
  poly2 : polygon,
  rec : rectangle
}

create type test.MyRecordNested as
 closed {
  nested : MyRecord
}

create  dataset MyData(MyRecordNested) primary key nested.id;

create  index rtree_index  on MyData (nested.point) type rtree;

write output to asterix_nc1:"rttest/rtree-index-join_spatial-intersect-point_03.adm"
select element {'a':a,'b':b}
from  MyData as a,
      MyData as b
where test.`spatial-intersect`(a.nested.point,b.nested.point)
;