2017-02-14 91 views
0

我想要獲得我的產品的排序列表。 該列表應該按位於PafElement類中的屬性postition進行排序。它是一個整數。 我開始在方法「getSortedList」 中對產品列表進行排序我已經用四個對象測試了該方法。對象1和2被切換。這意味着對象一位於HashMap中的位置2處,對象二位於位置一處。其他物體都很好。當值爲對象時,按屬性對hashMap進行排序

顯然,HashMap並沒有在地圖的末尾添加新的元素。我想知道,如果有可能實現這一點。

public Product(){} 

public Product(Init activity){ 
    final Init init = activity; 
    Log.i("PRODUCT","Costruct"); 
    // TODO: 12.02.2017 use own logger class 
    TextView productName = (TextView)activity.findViewById(R.id.productName); 

    TextView.OnEditorActionListener listener = new TextView.OnEditorActionListener() { 
     @Override 
     public boolean onEditorAction(TextView v, int actionId, KeyEvent event) { 
      if (event != null) { 
       if (event.getKeyCode() == KeyEvent.KEYCODE_ENTER && event.getAction() == KeyEvent.ACTION_DOWN) { 
        Long milis = System.currentTimeMillis(); 
        setId(milis); 
        setName(v.getText().toString()); 
        setPosition(getNextPosition()); 
        create(init); 
        v.setText(""); 
        v.setVisibility(View.GONE); 
        // TODO: 08.02.2017 log successful creation; 
        return true; 
       } 
      } 
      return false; 
     } 

    }; 

    productName.setOnEditorActionListener(listener); 
    productName.setVisibility(View.VISIBLE); 
} 

public static void toList(Product p){ 
    productList.put(p.getId(),p); 
} 

public static void initialise(Element products){ 
    NodeList productList = products.getChildNodes(); 
    for(int i = 0; i < productList.getLength(); i++){ 
     Node product = productList.item(i); 
     if(product.getNodeName().equals("product")) { 
      Element productElement = (Element) product; 
      String id = productElement.getAttribute("productId"); 
      Integer pos = Integer.parseInt(productElement.getAttribute("position")); 
      String name = productElement.getElementsByTagName("name").item(0).getTextContent(); 
      Product p = new Product(); 
      p.setName(name); 
      p.setId(Long.parseLong(id)); 
      p.setPosition(pos); 
      updatePosition(pos); 
      Product.toList(p); 
     } 
    } 
} 

public static HashMap<String,Product> getList(){ 
    return productList; 
} 

public static HashMap<String,Product> getSortedList(){ 
    HashMap<String,Product> productList = Product.getList(); 
    HashMap<String,Product> sortedList = new HashMap<String, Product>(); 
    int[] positions = new int[productList.size()]; 
    int i = 0; 
    for(String id :productList.keySet()){ 
     Product p = productList.get(id); 
     positions[i] = p.getPosition(); 
     i++; 
    } 

    Arrays.sort(positions); 
    while(sortedList.size() < productList.size()) { 
     for (Integer position : positions) { 
      for (String id : productList.keySet()){ 
       Product p = productList.get(id); 
       if (p.getPosition().equals(position)) { 
        sortedList.put(id, p); 
       } 
      } 
     } 
    } 
    return sortedList; 
} 

public static Product[] getListAsArray(){ 
    Product[] p = new Product[productList.size()]; 
    int i = 0; 
    for(Product product : productList.values()){ 
     p[i] = product; 
     i++; 
    } 
    return p; 
} 

private void create(Init init){ 
    try { 
     DocumentBuilderFactory domFactory = DocumentBuilderFactory.newInstance(); 
     domFactory.setIgnoringComments(true); 
     DocumentBuilder builder = domFactory.newDocumentBuilder(); 
     Document store = builder.parse(new File(init.PATH)); 
     Element pl = store.getElementById("productList"); 
     Element product = store.createElement("product"); 
     Text name = store.createTextNode(this.name); 
     Text id = store.createTextNode(this.id + ""); 
     Element productName = store.createElement("name"); 
     productName.appendChild(name); 
     product.setAttribute("productId",(this.id + "")); 
     product.setIdAttribute("productId",true); 
     product.setAttribute("position",this.position + ""); 
     product.appendChild(productName); 
     pl.appendChild(product); 

     TransformerFactory tf = TransformerFactory.newInstance(); 
     Transformer t = tf.newTransformer(); 
     t.setOutputProperty(OutputKeys.INDENT, "yes"); 
     t.setOutputProperty("{http://xml.apache.org/xslt}indent-amount", "2"); 
     DOMSource domSource = new DOMSource(store); 
     StreamResult sr = new StreamResult(new File(init.PATH)); 
     t.transform(domSource,sr); 
     Log.i("PRODUCT","created"); 

     Product.toList(this); 
     /** 
     * @Important the string in index of has to be the same as one of the headres in class Init.java 
     * */ 
     init.getListAdapter().update("PafElements",this.getName()); 

    }catch(ParserConfigurationException | TransformerException | SAXException | IOException e){ 
     e.printStackTrace(); 
     // TODO: 08.02.2017 use own logger class 
    } 
} 

private static void updatePosition(Integer current){ 
    if(maxPostition != null) { 
     if (current > maxPostition) { 
      maxPostition = current; 
     } 
    }else{ 
     maxPostition = current; 
    } 
} 

private static Integer getNextPosition(){ 
    Integer pos = maxPostition; 
    if(pos == null){ 
     pos = 1; 
    }else{ 
     pos += 1; 
    } 
    maxPostition = pos; 
    return pos; 
} 

回答

0

HashMap的工作原理是覆蓋要在您的地圖中放置對象的類中的equals和hashcode。 HashMap速度很快,可以用const複雜度取出一個對象,它們總是無序的。

你明顯需要的是一個TreeMap。 TreeMap是一個分類的鍵值列表。 你的類需要實現Comparable,你必須編寫你的邏輯來比較你的產品,或者你可以使用Comparator來放置你的TreeMap。 TreeMapDifference between HashMap and TreeMap well explained

相關問題