/*
 * 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.
 *
 */

package org.apache.skywalking.apm.commons.datacarrier.buffer;

import java.util.List;
import org.apache.skywalking.apm.commons.datacarrier.common.AtomicRangeInteger;

/**
 * Self implementation ring queue.
 */
public class Buffer<T> implements QueueBuffer<T> {
    private final Object[] buffer;
    private BufferStrategy strategy;
    private AtomicRangeInteger index;

    Buffer(int bufferSize, BufferStrategy strategy) {
        buffer = new Object[bufferSize];
        this.strategy = strategy;
        index = new AtomicRangeInteger(0, bufferSize);
    }

    public void setStrategy(BufferStrategy strategy) {
        this.strategy = strategy;
    }

    public boolean save(T data) {
        int i = index.getAndIncrement();
        if (buffer[i] != null) {
            switch (strategy) {
                case BLOCKING:
                    while (buffer[i] != null) {
                        try {
                            Thread.sleep(1L);
                        } catch (InterruptedException e) {
                        }
                    }
                    break;
                case IF_POSSIBLE:
                    return false;
                default:
            }
        }
        buffer[i] = data;
        return true;
    }

    public int getBufferSize() {
        return buffer.length;
    }

    public void obtain(List<T> consumeList) {
        this.obtain(consumeList, 0, buffer.length);
    }

    void obtain(List<T> consumeList, int start, int end) {
        for (int i = start; i < end; i++) {
            if (buffer[i] != null) {
                consumeList.add((T) buffer[i]);
                buffer[i] = null;
            }
        }
    }

}

@@ -1354,32 +1354,46 @@
 erSize);%0A    %7D%0A%0A
+    @Override%0A
     public void 
@@ -1423,32 +1423,32 @@
 egy strategy) %7B%0A
-
         this.str
@@ -1464,32 +1464,46 @@
 trategy;%0A    %7D%0A%0A
+    @Override%0A
     public boole
@@ -1630,297 +1630,8 @@
 ) %7B%0A
-                case BLOCKING:%0A                    while (buffer%5Bi%5D != null) %7B%0A                        try %7B%0A                            Thread.sleep(1L);%0A                        %7D catch (InterruptedException e) %7B%0A                        %7D%0A                    %7D%0A                    break;%0A
     
@@ -1789,32 +1789,46 @@
 rn true;%0A    %7D%0A%0A
+    @Override%0A
     public int g
@@ -1877,24 +1877,38 @@
 gth;%0A    %7D%0A%0A
+    @Override%0A
     public v

Remove Buffer redundant strategy judgment code. (#5277)