zoukankan      html  css  js  c++  java
  • ArcGIS Server按属性查询

     public void  query(TaskEvent event) {
      WebContext context=event.getWebContext();
         WebGraphics graphics=context.getWebGraphics();
         WebQuery query=context.getWebQuery();
       
         List searchLayer=new ArrayList();
         searchLayer.add("bird_xy");
       
         List layers = query.getQueryLayers();
         List<WebLayerInfo> queryLayer = new ArrayList<WebLayerInfo>();
         for(Iterator iterator=layers.iterator(); iterator.hasNext();){
             Object item = iterator.next();
             if(item instanceof WebLayerInfo){
                  WebLayerInfo layerinfo = (WebLayerInfo)item;
                  if(layerinfo.getName().equals("bird_xy")){  
                      queryLayer.add(layerinfo);
                  }
             }
         }

         List<String> returnFields =new ArrayList<String>();
         returnFields.add("lat");   
         returnFields.add("lon");
       
         PredefinedQueryCriteria pqc=new PredefinedQueryCriteria();
         pqc.setWhereClause("lat='%"+this.keyWord+"%'");
         pqc.setDisplayFieldName("lat");
         pqc.setFetchResultDetails(true);
         pqc.setReturnFields(returnFields);
         List resultList = new ArrayList();
         resultList = query.query(pqc, queryLayer);
            
         if(resultList.size()!=0){
          for(int i=0;i<resultList.size();i++){
           QueryResult result = (QueryResult)resultList.get(i);
           result.highlight();
          }
         }
      
     }

  • 相关阅读:
    Populating Next Right Pointers in Each Node II
    Populating Next Right Pointers in Each Node
    Construct Binary Tree from Preorder and Inorder Traversal
    Construct Binary Tree from Inorder and Postorder Traversal
    Path Sum
    Symmetric Tree
    Solve Tree Problems Recursively
    632. Smallest Range(priority_queue)
    609. Find Duplicate File in System
    poj3159最短路spfa+邻接表
  • 原文地址:https://www.cnblogs.com/frostbelt/p/1763131.html
Copyright © 2011-2022 走看看