zoukankan      html  css  js  c++  java
  • ADF中遍历VO中的行数据(Iterator)

    在ADF中VO实质上就是一个迭代器,

    1.在Application Module的实现类中,直接借助VO实现类和Row的实现类

     TestVOImpl organizationUser = (TestVOImpl) this.getTestVO1();
     while(organizationUser.hasNext()){
             TestVORowImpl   userRow =(TestVORowImpl) organizationUser.next();
    }

    2.在Application Module的实现类中,按照行数来遍历

     ProcessTaskVOImpl processTaskVO = this.getProcessTaskVO1();
     Row[] processTaskRowSet = processTaskVO.getAllRowsInRange(); //
     for(int i=0,rowSetSize=processTaskRowSet.length;i<rowSetSize;i++){
          ProcessTaskVORowImpl processTaskRow =(ProcessTaskVORowImpl) processTaskRowSet[i];
    }

    3.在Manage bean中遍历

    BindingContext bindingContext = BindingContext.getCurrent();
    BindingContainer bindingContainer = bindingContext.getCurrentBindingsEntry();
    DCBindingContainer dcb = (DCBindingContainer)bindingContainer;
    DCIteratorBinding serviceLogIterator = dcb.findIteratorBinding("ServiceLogPolicyVO1Iterator");
    ServiceLogPolicyVOImpl vo = (ServiceLogPolicyVOImpl) serviceLogIterator.getViewObject();
       for (int i = 0, rowCount = vo.getEstimatedRowCount(); i < rowCount; i++) {
             ServiceLogPolicyVORowImpl serviceRowImpl = (ServiceLogPolicyVORowImpl)vo.getRowAtRangeIndex(i); 
    }
  • 相关阅读:
    对于近期学习上的复习与整理
    ACM的奇计淫巧_输入挂
    hdu2602 DP (01背包)
    hdu 1723 DP/递推
    hdu1428 记忆化搜索(BFS预处理最短路径和+DP+DFS)
    hdu1355
    hdu1331&&hdu1579记忆化搜索(DP+DFS)
    hdu1257 dp(最长上升子序列)
    hdu1208 dp
    hdu 1203 dp(关于概率的```背包?)
  • 原文地址:https://www.cnblogs.com/qizhelongdeyang/p/3822036.html
Copyright © 2011-2022 走看看