/**
* 排序
* @param iModelLibrary
* @return afterSortIModelLibrary
*/
public static IModelLibraryDescription[] iModelLibraryDescription(
IModelLibraryDescription[] iModelLibrary)
{
String[] nameAndVerion = new String[iModelLibrary.length];
for (int i = 0; i < iModelLibrary.length; i++)
{
String str = iModelLibrary[i].getID() + "_" //$NON-NLS-1$
+ iModelLibrary[i].getVersion();
nameAndVerion[i] = str;
}
Arrays.sort(nameAndVerion, String.CASE_INSENSITIVE_ORDER);
IModelLibraryDescription[] afterSortIModelLibrary = new IModelLibraryDescription[nameAndVerion.length];
for (int i = 0; i < nameAndVerion.length; i++)
{
for (int j = 0; j < iModelLibrary.length; j++)
{
String sort = iModelLibrary[j].getID() + "_" //$NON-NLS-1$
+ iModelLibrary[j].getVersion();
if (nameAndVerion[i].equals(sort))
{
afterSortIModelLibrary[i] = iModelLibrary[j];
}
}
}
return afterSortIModelLibrary;
}
* 排序
* @param iModelLibrary
* @return afterSortIModelLibrary
*/
public static IModelLibraryDescription[] iModelLibraryDescription(
IModelLibraryDescription[] iModelLibrary)
{
String[] nameAndVerion = new String[iModelLibrary.length];
for (int i = 0; i < iModelLibrary.length; i++)
{
String str = iModelLibrary[i].getID() + "_" //$NON-NLS-1$
+ iModelLibrary[i].getVersion();
nameAndVerion[i] = str;
}
Arrays.sort(nameAndVerion, String.CASE_INSENSITIVE_ORDER);
IModelLibraryDescription[] afterSortIModelLibrary = new IModelLibraryDescription[nameAndVerion.length];
for (int i = 0; i < nameAndVerion.length; i++)
{
for (int j = 0; j < iModelLibrary.length; j++)
{
String sort = iModelLibrary[j].getID() + "_" //$NON-NLS-1$
+ iModelLibrary[j].getVersion();
if (nameAndVerion[i].equals(sort))
{
afterSortIModelLibrary[i] = iModelLibrary[j];
}
}
}
return afterSortIModelLibrary;
}
本文介绍了一种针对IModelLibraryDescription数组的排序方法,通过提取每个元素的ID和版本号进行大小比较,最终返回按名称(不区分大小写)排序后的数组。
2527

被折叠的 条评论
为什么被折叠?



