zoukankan      html  css  js  c++  java
  • 30 多份配置文件合并功能

    maven 依赖

     <dependency>
                <groupId>commons-configuration</groupId>
                <artifactId>commons-configuration</artifactId>
                <version>1.6</version>
            </dependency>

    代码

    package com.da.tool.util.configuration;
    
    import org.apache.commons.configuration.CompositeConfiguration;
    import org.apache.commons.configuration.ConfigurationException;
    import org.apache.commons.configuration.PropertiesConfiguration;
    
    import java.io.FileInputStream;
    import java.io.FileOutputStream;
    import java.io.IOException;
    import java.util.Properties;
    
    /**
     */
    public class ConfigParser {
        public static void main(String[] args) throws IOException, ConfigurationException {
            //配置项  分为默认配置 和用户配置
            //用户配置会覆盖默认配置   下面为类支持
    
            CompositeConfiguration allConfig = new CompositeConfiguration();
    
            Properties defaultProp=new Properties();
            defaultProp.put("A","1");
            defaultProp.put("B","2");
    
            defaultProp.store(new FileOutputStream("defaultProp.properties"),"defaultProp");
    
            PropertiesConfiguration defaultConfig=new PropertiesConfiguration();
            defaultConfig.load(new FileInputStream("defaultProp.properties"));
    
            Properties userProp=new Properties();
            userProp.put("A","10");
            userProp.store(new FileOutputStream("userProp.properties"),"userProp");
    
            PropertiesConfiguration userConfig=new PropertiesConfiguration();
            userConfig.load(new FileInputStream("userProp.properties"));
    
            allConfig.addConfiguration(userConfig);  //两个配置文件中相同的key  先加入的生效
            allConfig.addConfiguration(defaultConfig);
    
            System.out.println("A = " + allConfig.getString("A"));
            System.out.println("B = " + allConfig.getString("B"));
    
        }
    }
  • 相关阅读:
    poj 2378 删点最大分支不超过一半
    poj 3107 删点最大分支最小
    hdu 3586 最小代价切断根与叶子联系
    hdu 4276 树形m时间1进n出
    hdu 4044 树形DP 炮台打怪 (好题)
    poj 3345 树形DP 附属关系+输入输出(好题)
    poj 2486 树形DP n选m连续路径
    hdu 1561 树形DP n个选m个价值最大
    poj 1947 树形背包
    hdu 1011 树形背包
  • 原文地址:https://www.cnblogs.com/yangh2016/p/6343524.html
Copyright © 2011-2022 走看看