bashrc

最新推荐文章于 2020-12-05 07:58:06 发布

chanzhennan

最新推荐文章于 2020-12-05 07:58:06 发布

阅读量179

点赞数

本文链接：https://blog.csdn.net/chanzhennan/article/details/106895528

版权

alias l='ls -l'

alias a='cd ..&&l'
alias cc='rz -bye'
alias q='vi hlod'
alias shf='sh build.sh'
alias shc='source ~/.bashrc'
alias lt='ls -lhrt --color=auto'
alias via='vi ~/.bashrc'
alias py='python'
alias b='cd -'
#alias tt='cd /data/czn/code/eggroll-feature-2.0-framework/python/eggroll/roll_paillier_tensor/test'
#alias tt='cd /data/czn/code/feature-2.0-roll-paillier-tensor/python/eggroll/roll_paillier_tensor/test'
#alias tt='cd /data/home/qijunhuang/czn/code/eggroll-2.x/python/eggroll/roll_paillier_tensor/test'
alias tt='cd /data/home/qijunhuang/czn/code/eggroll-2.1/python/eggroll/roll_site/test'
alias tts='cd /data/home/qijunhuang/czn/code/eggroll-2.x/python/eggroll/roll_site/test'
#alias home='cd /data/czn/code/eggroll-feature-2.0-framework'
#alias home='cd /data/czn/code/feature-2.0-roll-paillier-tensor'
#alias home='cd /data/home/qijunhuang/czn/code/eggroll-2.x'
alias home='cd /data/home/qijunhuang/czn/code/eggroll-2.1'

dd(){
if [ -f $1 ]; then
case $1 in
*.tar.bz2) tar xjf $1 ;;
*.tar.xz) xz -d $1 ;;
*.bz2) bunzip2 $1 ;;
*.tar.gz) tar xzf $1 ;;
*.rar) unrar e $1 ;;
*.gz) gunzip $1 ;;
*.tar) tar xf $1 ;;
*.tbz2) tar xjvf $1 ;;
*.tgz) tar xzvf $1 ;;
*.zip) unzip $1 ;;
*.Z) uncompress $1 ;;
*.7z) 7z x $1 ;;
*) echo "'$1' cannot be extracted via extract()" ;;
esac
else
echo "'$1' is not a valid file"
fi
}

export https_proxy=https://172.16.153.103:3128

 //slice tree
    std::vector<std::pair<int, int>> slice;
    if (size_rank[0] != 0)
        slice.push_back(std::pair<int, int>(0, size_rank[0]));
    for (int i = 1; i < tree_count; i++)
    {
        
        if (size_rank[i] == 0)
        {
            continue;
        }

        if ((float)size_rank[i] / (float)size_rank[i - 1] > 4 )
        {
            printf("[slice tree]: %d %d \n", size_rank[i], size_rank[i - 1]);
            slice.push_back(std::pair<int, int>(i, size_rank[i]));
        }
    }
    slice.push_back(std::pair<int, int>(tree_count - 1, size_rank[tree_count - 1]));