All Downloads are FREE. Search and download functionalities are using the official Maven repository.

com.reandroid.arsc.base.BlockContainer Maven / Gradle / Ivy

 /*
  *  Copyright (C) 2022 github.com/REAndroid
  *
  *  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.reandroid.arsc.base;

import com.reandroid.arsc.container.BlockList;
import com.reandroid.arsc.io.BlockReader;

import java.io.IOException;
import java.io.OutputStream;

public abstract class BlockContainer extends Block{
    public BlockContainer(){
        super();
    }

    protected void onPreRefreshRefresh(){

    }
    protected abstract void onRefreshed();
    public final void refresh(){
        if(isNull()){
            return;
        }
        onPreRefreshRefresh();
        refreshChildes();
        onRefreshed();
    }
    protected void refreshChildes(){
        T[] childes=getChildes();
        if(childes!=null){
            int max=childes.length;
            for(int i=0;i container=(BlockContainer)item;
                    container.refresh();
                }else if(item instanceof BlockList){
                    BlockList blockList=(BlockList)item;
                    blockList.refresh();
                }
            }
        }
    }
    @Override
    public void onCountUpTo(BlockCounter counter){
        if(counter.FOUND){
            return;
        }
        counter.setCurrent(this);
        if(counter.END==this){
            counter.FOUND=true;
            return;
        }
        T[] childes=getChildes();
        if(childes==null){
            return;
        }
        int max=childes.length;
        for(int i=0;i




© 2015 - 2025 Weber Informatics LLC | Privacy Policy