UGUI ScrollRect 性能优化
测试环境
操作系统:Windows8.1
开发工具:Unity5.5.2
1、问题描述,在实际开发过程中经常会使用ScrollRect实现滚动列表,当初次加载数据比较多的情形时,Unity3D会出现比较严重的卡顿,降低帧率,其原因主要为 a、集中式的申请ItemRenderer对象大量堆内存,b、帧Draw Call增加。
2、解决方案,主要逻辑根据Viewport即Mask Visual区域计算当前上下文显示ItemRenderer个数,同时滚动的时候会动态计算scrollLineIndex行数,来重新计算每一个ItemRenderer渲染的位置,从而复用ItemRenderer。
如图所示:当前数据已经有31个,但是ItemRenderer的实例只有21个,即当前满屏情况下最大的显示个数。

3、完成代码
UIWrapItem 用来作为数据、ItemRenderer prefab的 具体关联类。
using UnityEngine; /// <summary>
/// Wrapper Item for user data index.
/// </summary>
public class UIWrapItem : MonoBehaviour { /// <summary>
/// User data index
/// </summary>
private int dataIndex = ; /// <summary>
/// Item container
/// </summary>
private UIWrapContainer container = null; private void OnDestroy()
{
container = null;
} /// <summary>
/// Container setter
/// </summary>
public UIWrapContainer Container
{
set
{
container = value;
}
} /// <summary>
/// DataIndex getter & setter
/// </summary>
public int DataIndex
{
set
{
dataIndex = value; gameObject.name = dataIndex.ToString(); if (dataIndex >= )
{
transform.localPosition = container.GetLocalPositionByDataIndex(dataIndex); if (container.onInitializeItem != null)
{
container.onInitializeItem(gameObject, dataIndex);
}
}
} get { return dataIndex; }
}
}
UIWrapContainer作用为UIWrapItem的容器,提供基本的数据判定逻辑。
using UnityEngine;
using UnityEngine.UI;
using System.Collections.Generic; /// <summary>
/// This script makes it possible for a scroll view to wrap its item, creating scroll views.
/// Usage: simply attach this script underneath your scroll view where you would normally place a container:
///
/// + Scroll View
/// |- UIWrapContainer
/// |-- Item 1
/// |-- Item 2
/// |-- Item 3
/// </summary>
[DisallowMultipleComponent]
public class UIWrapContainer : MonoBehaviour
{
public delegate void OnInitializeItem(GameObject go, int dataIndex); public OnInitializeItem onInitializeItem = null; public enum Arraygement
{
Horizontal,
Vertical
} #region public variables /// <summary>
/// Type of arragement
/// </summary>
public Arraygement arrangement = Arraygement.Horizontal; /// <summary>
/// Maximum item per line.
/// If the arrangement is horizontal, this denotes the number of columns.
/// If the arrangement is vertical, this stands for the number of rows.
/// </summary>
public int maxPerLine = ; /// <summary>
/// The width of each of the items.
/// </summary>
public float itemWidth = 100f; /// <summary>
/// The height of each of the items.
/// </summary>
public float itemHeight = 100f; /// <summary>
/// The Horizontal space of each of the items.
/// </summary>
public float itemHorizontalSpace = 0f; /// <summary>
/// The vertical space of each of the items.
/// </summary>
public float itemVerticalSpace = 0f; public ScrollRect scrollRect = null; public RectTransform viewport = null; public RectTransform container = null; public GameObject itemPrefab = null; #endregion #region private variables private int dataCount = ; private int maximumVisualVerticalItemCount = ; private int maximumVisualHorizontalItemCount = ; private int currentScrollLineIndex = -; private IList<UIWrapItem> activeItems = null; private Queue<UIWrapItem> deactiveItems = null; #endregion void Awake()
{
activeItems = new List<UIWrapItem>();
deactiveItems = new Queue<UIWrapItem>(); maximumVisualVerticalItemCount = Mathf.CeilToInt(viewport.rect.height / (itemHeight + itemVerticalSpace));
maximumVisualHorizontalItemCount = Mathf.CeilToInt(viewport.rect.width / (itemWidth + itemHorizontalSpace));
} void Start()
{ } public void Initialize(int dataCount)
{
if (scrollRect == null || container == null || itemPrefab == null)
{
Debug.LogError("Not attach scrollRect or container or itemPrefab instance here, please check.");
return;
} if (dataCount <= )
{
return;
} setDataCount(dataCount); scrollRect.onValueChanged.RemoveAllListeners();
scrollRect.onValueChanged.AddListener(OnValueChanged); deactiveItems.Clear();
activeItems.Clear(); UpdateItems();
} public void RemoveItem(int dataIndex)
{
if (dataIndex < || dataIndex >= dataCount)
{
return;
} bool isDestroy = activeItems.Count >= dataCount;
setDataCount(dataCount - ); for (int index = activeItems.Count - ; index >= ; index--)
{
UIWrapItem item = activeItems[index];
int itemDataIndex = item.DataIndex; if (itemDataIndex == dataIndex)
{
activeItems.Remove(item);
if (isDestroy)
{
GameObject.Destroy(item.gameObject);
}
else
{
item.DataIndex = -;
item.gameObject.SetActive(false);
deactiveItems.Enqueue(item);
}
} if (itemDataIndex > dataIndex)
{
item.DataIndex = itemDataIndex - ;
}
} UpdateItems(GetCurrentScrollLineIndex());
} public void AddItem(int dataIndex)
{
if (dataIndex < || dataIndex > dataCount)
{
return;
} bool isNew = false;
for (int index = activeItems.Count - ; index >= ; index--)
{
UIWrapItem item = activeItems[index];
if (item.DataIndex >= (dataCount - ))
{
isNew = true;
break;
}
} setDataCount(dataCount + ); if (isNew)
{
for (int index = , length = activeItems.Count; index < length; index++)
{
UIWrapItem item = activeItems[index];
int itemDataIndex = item.DataIndex;
if (itemDataIndex >= dataIndex)
{
item.DataIndex = itemDataIndex + ;
}
} UpdateItems(GetCurrentScrollLineIndex());
}
else
{
for (int index = , length = activeItems.Count; index < length; index++)
{
UIWrapItem item = activeItems[index];
int itemDataIndex = item.DataIndex;
if (itemDataIndex >= dataIndex)
{
item.DataIndex = itemDataIndex;
}
}
}
} public Vector3 GetLocalPositionByDataIndex(int dataIndex)
{
float x = 0f;
float y = 0f;
float z = 0f; switch (arrangement)
{
case Arraygement.Horizontal:
{
x = (dataIndex / maxPerLine) * (itemWidth + itemHorizontalSpace);
y = -(dataIndex % maxPerLine) * (itemHeight + itemVerticalSpace);
break;
}
case Arraygement.Vertical:
{
x = (dataIndex % maxPerLine) * (itemWidth + itemHorizontalSpace);
y = -(dataIndex / maxPerLine) * (itemHeight + itemVerticalSpace);
break;
}
} return new Vector3(x, y, z);
} private void setDataCount(int count)
{
if (count != dataCount)
{
dataCount = count;
UpdateContainerSize();
}
} private void OnValueChanged(Vector2 value)
{
switch (arrangement)
{
case Arraygement.Vertical:
{
float y = value.y;
if (y >= 1.0f || y <= 0.0f)
{
return;
}
break;
}
case Arraygement.Horizontal:
{
float x = value.x;
if (x <= 0.0f || x >= 1.0f)
{
return;
}
break;
}
} int scrollPerLineIndex = GetCurrentScrollLineIndex(); if (scrollPerLineIndex == currentScrollLineIndex) { return; } UpdateItems(scrollPerLineIndex);
} private void UpdateItems(int scrollLineIndex)
{
if (scrollLineIndex < )
{
return;
} currentScrollLineIndex = scrollLineIndex; int startDataIndex = currentScrollLineIndex * maxPerLine;
int endDataIndex = (currentScrollLineIndex + (arrangement == Arraygement.Vertical ? maximumVisualVerticalItemCount : maximumVisualHorizontalItemCount)) * maxPerLine; for (int index = activeItems.Count - ; index >= ; index--)
{
UIWrapItem item = activeItems[index];
int itemDataIndex = item.DataIndex;
if (itemDataIndex < startDataIndex || itemDataIndex >= endDataIndex)
{
item.DataIndex = -;
activeItems.Remove(item);
item.gameObject.SetActive(false);
deactiveItems.Enqueue(item);
}
} for (int dataIndex = startDataIndex; dataIndex < endDataIndex; dataIndex++)
{
if (dataIndex >= dataCount)
{
continue;
} if (Exists(dataIndex))
{
continue;
} CreateItem(dataIndex);
}
} private void CreateItem(int dataIndex)
{
UIWrapItem item = null;
if (deactiveItems.Count > )
{
item = deactiveItems.Dequeue();
item.gameObject.SetActive(true);
}
else
{
item = AddChild(itemPrefab, container).AddComponent<UIWrapItem>();
} item.Container = this;
item.DataIndex = dataIndex;
activeItems.Add(item);
} private bool Exists(int dataIndex)
{
if (activeItems == null || activeItems.Count <= )
{
return false;
} for (int index = , length = activeItems.Count; index < length; index++)
{
if (activeItems[index].DataIndex == dataIndex)
{
return true;
}
} return false;
} private GameObject AddChild(GameObject prefab, Transform parent)
{
if (prefab == null || parent == null)
{
Debug.LogError("Could not add child with null of prefab or parent.");
return null;
} GameObject go = GameObject.Instantiate(prefab) as GameObject;
go.layer = parent.gameObject.layer;
go.transform.SetParent(parent, false); return go;
} private void OnDestroy()
{
scrollRect = null;
container = null;
itemPrefab = null;
onInitializeItem = null; activeItems.Clear();
deactiveItems.Clear(); activeItems = null;
deactiveItems = null;
}
}
4、未完待续
实际在开中主要使用数组集合作为参数及动态的Add or Rmove操作,所以接下来将会迭代掉采用数组下标的方式提供数据的初始化,增加删除等操作。
最后实现仓促难免存在bug,请与指正。
UGUI ScrollRect 性能优化的更多相关文章
- UGUI batch 规则和性能优化
UGUI batch 规则和性能优化 (基础) Unity 绘图性能优化 - Draw Call Batching : http://docs.unity3d.com/Manual/DrawCallB ...
- UGUI性能优化
http://www.cnblogs.com/suoluo/p/5417152.html http://blog.csdn.net/uwa4d/article/details/54344423 htt ...
- [转] 擎天哥as3教程系列第二回——性能优化
所谓性能优化主要是让游戏loading和运行的时候不卡. 一 优化fla导出的swf的体积? 1, 在flash中,舞台上的元件最多,生成的swf越大,库里面有连接名的元件越多,swf越大.当舞台 ...
- Unity技术支持团队性能优化经验分享
https://mp.weixin.qq.com/s?__biz=MzU5MjQ1NTEwOA==&mid=2247490321&idx=1&sn=f9f34407ee5c5d ...
- U3D开发性能优化笔记(待增加版本.x)
http://blog.csdn.net/kaitiren/article/details/45071997 此总结由自己经验及网上收集整理优化内容 包括: .代码方面: .函数使用方面: .ui注意 ...
- Unity 性能优化(力荐)
开始之前先分享几款性能优化的插件: 1.SimpleLOD : 除了同样拥有Mesh Baker所具有的Mesh合并.Atlas烘焙等功能,它还能提供Mesh的简化,并对动态蒙皮网格进行了很好的支持. ...
- 01.SQLServer性能优化之----强大的文件组----分盘存储
汇总篇:http://www.cnblogs.com/dunitian/p/4822808.html#tsql 文章内容皆自己的理解,如有不足之处欢迎指正~谢谢 前天有学弟问逆天:“逆天,有没有一种方 ...
- 03.SQLServer性能优化之---存储优化系列
汇总篇:http://www.cnblogs.com/dunitian/p/4822808.html#tsql 概 述:http://www.cnblogs.com/dunitian/p/60413 ...
- Web性能优化:What? Why? How?
为什么要提升web性能? Web性能黄金准则:只有10%~20%的最终用户响应时间花在了下载html文档上,其余的80%~90%时间花在了下载页面组件上. web性能对于用户体验有及其重要的影响,根据 ...
随机推荐
- String类的实现(4)写时拷贝浅析
由于释放内存空间,开辟内存空间时花费时间,因此,在我们在不需要写,只是读的时候就可以不用新开辟内存空间,就用浅拷贝的方式创建对象,当我们需要写的时候才去新开辟内存空间.这种方法就是写时拷贝.这也是一种 ...
- 老李分享:持续集成学好jenkins之解答疑问
老李分享:持续集成学好jenkins之解答疑问 poptest(www.poptest.cn)在培训的过程中使用jenkins搭建持续集成环境,让学员真正交流持续集成到底是什么,怎么去做的. Je ...
- poptest老李谈Socket
poptest是国内唯一一家培养测试开发工程师的培训机构,以学员能胜任自动化测试,性能测试,测试工具开发等工作为目标.如果对课程感兴趣,请大家咨询qq:908821478,咨询电话010-845052 ...
- Uva 11609 Teams (组合数学)
题意:有n个人,选不少于一个人参加比赛,其中一人当队长,有多少种选择方案. 思路:我们首先C(n,1)选出一人当队长,然后剩下的 n-1 人组合的总数为2^(n-1),这里用快速幂解决 代码: #in ...
- JAVA加密算法系列-MD5
package **; import java.security.MessageDigest; import java.security.NoSuchAlgorithmException; publi ...
- 1102: 零起点学算法09——继续练习简单的输入和计算(a-b)
1102: 零起点学算法09--继续练习简单的输入和计算(a-b) Time Limit: 1 Sec Memory Limit: 520 MB 64bit IO Format: %lldSub ...
- ios 关于时间戳与时间转化的笔记
linux系统获取时间戳的方法:time() ; 时间戳转换成需要的时间格式: NSDateFormatter *formatter=[[NSDateFormatter alloc]init]; [f ...
- ArrayList,LinkedList的对比
ArrayList,LinkedList都是Collection接口的通用实现方式,两者采用了不用的存储策略,用来适应不同场合的需要. 实现方式 ArrayList的内部采用集合的方式存储数据 唯一需 ...
- GreenDao与Rx的完美搭配
作为Android开发者,一定不会对 GreenDao 和 ReactiveX 陌生. GreenDao 号称Android最快的关系型数据库 ReactiveX Rx是一个编程模型,目标是 ...
- 转载---关于Spring的69个面试问答
链接:http://www.importnew.com/11657.html 目录 Spring概述 依赖注入 Spring Beans Spring注解 Spring的对象访问 Spring面向切面 ...