zoukankan      html  css  js  c++  java
  • Android滑动菜单使用(MenuDrawer和SlidingMenu)

    项目地址:

     
     
    android-menudrawer用法:
    protected MenuDrawer mDrawer;
    
    /**传入当前activity的布局文件*/    
    protected void initMenu(int layoutmain) {
            mDrawer = MenuDrawer.attach(this, MenuDrawer.MENU_DRAG_CONTENT,Position.RIGHT);
            mDrawer.setTouchMode(MenuDrawer.TOUCH_MODE_FULLSCREEN);
            mDrawer.setContentView(layoutmain);
            mDrawer.setMenuView(R.layout.menu_sample);
            mDrawer.setDropShadow(R.drawable.shadow);
            mDrawer.setDropShadowSize((int) getResources().getDimension(R.dimen.shadow_width));
            mDrawer.setMaxAnimationDuration(3000);
            mDrawer.setHardwareLayerEnabled(false);
            mDrawer.setMenuSize((int) getResources().getDimension(R.dimen.slidingmenu_offset));
        }
    mDrawer.toggleMenu(); 自动判断是打开还是关闭状态
    在activity onCreate方法最后面加入 mDrawer.peekDrawer();
    
    在viewpager下应用 OnPageChangeListener事件的onPageSelected方法下加入
    mDrawer.setTouchMode(index == fragments.size()-1
                        ? MenuDrawer.TOUCH_MODE_FULLSCREEN
                        : MenuDrawer.TOUCH_MODE_NONE);

    SlidingMenu用法:

    SlidingMenu menu = new SlidingMenu(this);
            menu.setMode(SlidingMenu.RIGHT);
            menu.setTouchModeAbove(SlidingMenu.TOUCHMODE_FULLSCREEN);
            menu.setShadowWidthRes(R.dimen.shadow_width);
            menu.setShadowDrawable(R.drawable.shadow);
            menu.setBehindOffsetRes(R.dimen.slidingmenu_offset);
            menu.setFadeDegree(0.35f);
            menu.attachToActivity(this, SlidingMenu.SLIDING_CONTENT);
            menu.setMenu(R.layout.menu_sample);

    menu.toggle(); 方法自动判断是打开还是关闭状态

    在viewpager控件下应用

      在onPageSelected方法中    

    menu.setTouchModeAbove(index == fragments.size()-1
    ? SlidingMenu.TOUCHMODE_FULLSCREEN
    : SlidingMenu.TOUCHMODE_NONE);  因为我是在右边显示所以总数减1

  • 相关阅读:
    Balanced Binary Tree
    Minimum Depth of Binary Tree
    Path Sum
    Flatten Binary Tree to Linked List
    Distinct Subsequences
    Chp3: Stacks and Queue
    Chp2: Linked List
    Populating Next Right Pointers in Each Node
    Valid Palindrome
    Binary Tree Maximum Path Sum
  • 原文地址:https://www.cnblogs.com/guop/p/5383554.html
Copyright © 2011-2022 走看看