/*
 * Licensed 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.
 */
package com.facebook.presto.operator.scalar;

import com.facebook.presto.common.block.Block;
import com.facebook.presto.common.block.BlockBuilder;
import com.facebook.presto.common.type.Type;
import com.facebook.presto.operator.aggregation.TypedSet;
import com.facebook.presto.spi.function.Description;
import com.facebook.presto.spi.function.ScalarFunction;
import com.facebook.presto.spi.function.SqlType;
import com.facebook.presto.spi.function.TypeParameter;

@ScalarFunction("array_intersect")
@Description("Intersects elements of the two given arrays")
public final class ArrayIntersectFunction
{
    private ArrayIntersectFunction() {}

    @TypeParameter("E")
    @SqlType("array(E)")
    public static Block intersect(
            @TypeParameter("E") Type type,
            @SqlType("array(E)") Block leftArray,
            @SqlType("array(E)") Block rightArray)
    {
        if (leftArray.getPositionCount() < rightArray.getPositionCount()) {
            Block tempArray = leftArray;
            leftArray = rightArray;
            rightArray = tempArray;
        }

        int leftPositionCount = leftArray.getPositionCount();
        int rightPositionCount = rightArray.getPositionCount();

        if (rightPositionCount == 0) {
            return rightArray;
        }

        TypedSet rightTypedSet = new TypedSet(type, rightPositionCount, "array_intersect");
        for (int i = 0; i < rightPositionCount; i++) {
            rightTypedSet.add(rightArray, i);
        }

        BlockBuilder blockBuilder = type.createBlockBuilder(null, Math.min(leftPositionCount, rightPositionCount));

        // The intersected set can have at most rightPositionCount elements
        TypedSet intersectTypedSet = new TypedSet(type, blockBuilder, rightPositionCount, "array_intersect");
        for (int i = 0; i < leftPositionCount; i++) {
            if (rightTypedSet.contains(leftArray, i)) {
                intersectTypedSet.add(leftArray, i);
            }
        }

        return blockBuilder.build();
    }
}

@@ -652,62 +652,8 @@
 ck;%0A
-import com.facebook.presto.common.block.BlockBuilder;%0A
 impo
@@ -737,24 +737,33 @@
 aggregation.
+Optimized
 TypedSet;%0Aim
@@ -1592,70 +1592,8 @@
  %7D%0A%0A
-        int leftPositionCount = leftArray.getPositionCount();%0A
     
@@ -1734,32 +1734,41 @@
      %7D%0A%0A        
+Optimized
 TypedSet rightTy
@@ -1760,22 +1760,17 @@
 ypedSet 
-rightT
+t
 ypedSet 
@@ -1767,32 +1767,41 @@
  typedSet = new 
+Optimized
 TypedSet(type, r
@@ -1821,111 +1821,28 @@
 ount
-, %22array_intersect%22);%0A        for (int i = 0; i %3C rightPositionCount; i++) %7B%0A            rightT
+);%0A        t
 ypedSet.
 add(
@@ -1837,19 +1837,21 @@
 ypedSet.
-add
+union
 (rightAr
@@ -1849,27 +1849,24 @@
 n(rightArray
-, i
 );%0A        %7D
@@ -1868,221 +1868,17 @@
     
-%7D%0A%0A        BlockBuilder blockBuilder = type.createBlockBuilder(null, Math.min(leftPositionCount, rightPositionCount));%0A%0A        // The intersected set can have at most rightPositionCount elements%0A        T
+t
 ypedSet
- 
+.
 inte
@@ -1886,100 +1886,30 @@
 sect
-TypedSet = new TypedSet(type, blockBuilder, rightPositionCount, %22array_intersect%22
+(leftArray
 );%0A
+%0A
         
 for 
@@ -1908,221 +1908,32 @@
     
-for (int i = 0; i %3C leftPositionCount; i++) %7B%0A            if (rightTypedSet.contains(leftArray, i)) %7B%0A                intersectTypedSet.add(leftArray, i);%0A            %7D%0A        %7D%0A%0A        return blockBuilder.build
+return typedSet.getBlock
 ();%0A

Optimize array_intersect by using OptimizedTypedSet