zoukankan      html  css  js  c++  java
  • java temp

    asdfdasfadsfdsafsaf

    --查询商品信息在每个站点每个门店的具体库存数量
    select g.name as 商品名称,
    t.status as 发布状态, t.is_auth as 审核状态, t.ref_price as 参考价格, 
    s.erp_code as 商品编码, s.vendor as 厂商, s.depot as 库位, s.distribution_site as 发货地点, s.sales_org as 销售组织, s.stock_quantity as 库存数量
    from general_product g, specific_product t, shadow_inventory s 
    where g.erp_code = t.erp_code and g.erp_code = s.erp_code and t.status = '1' and t.is_auth ='1' 
     

    sadfadfadsfdasfdsafas

    package com.javaeye.lindows.rss;
    
    import java.util.Enumeration;
    import java.util.HashMap;
    import java.util.Hashtable;
    
    public class EnumTest {
        public static void main(String[] args) {
    //        java.util.Properties pp = System.getProperties();
    //        java.util.Enumeration en = pp.propertyNames();
    //        while (en.hasMoreElements()) {
    //            String elm = (String) en.nextElement();
    //            System.out.println(elm + " ---->" + pp.getProperty(elm));
    //        }
    
    //        Vector<String> v = new Vector<String>();
    //        v.add(0, "nanjing");
    //        v.add(1, "nanjing");
    //        System.out.println(v);
           
            HashMap<String, String> hMap = new HashMap<String, String>();
            hMap.put("0", "nanjing");
            hMap.put("1", "nanjing");
            hMap.put("2", "nanjing");
            hMap.put("3", "nanjing");
            hMap.put("4", "nanjing");
            System.out.println(hMap);
            System.out.println("Iterator打印<目录>");
            for (int Interator = 0; Interator < args.length; Interator++) {
               
            }
           
    /*        Hashtable<String, String> ht = new Hashtable<String, String>();
            ht.put("01", "nanjing");
            ht.put("02", "nanjing");
            ht.put("03", "nanjing");
            ht.put("04", "nanjing");
            ht.put("05", "nanjing");
            System.out.println("Enumberation<目录>");
            for (Enumeration<String> e = ht.elements(); e.hasMoreElements();) {
            System.out.println(e.nextElement());
            }*/
           
        }
    }
    
     

    asdfafadsfasfasfa

    asdfadsfadsfdsaf

  • 相关阅读:
    P2617 Dynamic Rankings[带修主席树(模板)]
    P2617 Dynamic Rankings[带修主席树(模板)]
    P4127 [AHOI2009]同类分布
    P4127 [AHOI2009]同类分布
    P4550 收集邮票 [期望dp]
    P4550 收集邮票 [期望dp]
    P3168 [CQOI2015]任务查询系统
    蓝桥杯 2的次幂表示 递归
    蓝桥杯 最大的算式 dp
    蓝桥杯 未名湖边的烦恼 递推 dp
  • 原文地址:https://www.cnblogs.com/lindows/p/14390569.html
Copyright © 2011-2022 走看看