zoukankan      html  css  js  c++  java
  • 第一阶段冲刺第二天

    import android.os.Bundle;
    import android.support.annotation.Nullable;
    import android.support.design.widget.TabLayout;
    import android.support.v4.app.Fragment;
    import android.support.v4.view.ViewPager;
    import android.view.LayoutInflater;
    import android.view.View;
    import android.view.ViewGroup;
    
    
    
    import com.example.myapplication.R;
    import com.example.myapplication.adapter.historyFragmentAdapter;
    
    import java.util.ArrayList;
    
    import butterknife.BindView;
    import butterknife.ButterKnife;
    
    /**
     * @author:created By ZhangHao
     * 时间:2019/4/24 18
     * 邮箱:188660586@qq.com
     */
    public class HistoryFragment extends Fragment {
    
        @BindView(R.id.top_tabViewPager)
        ViewPager top_tabViewPager;
        @BindView(R.id.top_tab)
        TabLayout top_tab;
        private ArrayList<String> titles;
        private historyFragmentAdapter adapter;
    
        @Override
        public void onCreate(@Nullable Bundle savedInstanceState) {
            super.onCreate(savedInstanceState);
            initData();
        }
    
    
    
        @Override
        public View onCreateView( LayoutInflater inflater, ViewGroup container,  Bundle savedInstanceState) {
            View view = inflater.inflate(R.layout.history_fragment, container, false);
            ButterKnife.bind(this, view);
            adapter = new historyFragmentAdapter(getChildFragmentManager());
            top_tabViewPager.setAdapter(adapter);
            top_tab.setupWithViewPager(top_tabViewPager);
            //更新适配器数据
            adapter.setTitles(titles);
            return view;
    
    
        }
    
        private void initData() {
            titles = new ArrayList<>();
            titles.add("待出行的订单");
            titles.add("已出行的订单");
        }
    
    }
  • 相关阅读:
    CodeForces Round #288 Div.2
    POJ 3660 Cow Contest【传递闭包】
    ZOJ 3321 Circle【并查集】
    CF 286(div 2) B Mr. Kitayuta's Colorful Graph【传递闭包】
    CF 287(div 2) B Amr and Pins
    HDU 2122 Ice_cream’s world III【最小生成树】
    HDU 1233 还是畅通工程【最小生成树】
    奶牛接力 矩阵乘法
    家谱 并差集
    昂贵的聘礼 最短路 dijkstra
  • 原文地址:https://www.cnblogs.com/zhang188660586/p/11061897.html
Copyright © 2011-2022 走看看