zoukankan      html  css  js  c++  java
  • beanUtils 对象之前的 相互赋值转换

    public final class BeanUtils {
    
        /**
         * 将srcObject的字段值赋值到destObject对象中去
         *
         * @param srcObject
         * @param destObject
         * @param <S>
         * @param <T>
         * @return
         */
        public static <S, T> T initDestObject(S srcObject, T destObject) {
            Map<String,Object> srcMap = new HashMap<>();
            Class srcClass = srcObject.getClass();
            Field[] declaredFields = srcClass.getDeclaredFields();
            for (int i = 0; i < declaredFields.length; i++) {
                try {
                    Field field = declaredFields[i];
                    field.setAccessible(true);
                    String fieldName = field.getName();
                    Object value = field.get(srcObject);
                    srcMap.put(fieldName, value);
                } catch (IllegalAccessException e) {
                    e.printStackTrace();
                }
            }
            try {
                destObject = initProperty(destObject, srcMap);
            } catch (IllegalAccessException e) {
                e.printStackTrace();
            }
            System.out.println(srcMap);
            return destObject;
        }
    
        private static <T> T initProperty(T obj, Map<String,Object> map) throws IllegalAccessException {
            Class<?> clazz = obj.getClass();
            Field[] declaredFields = clazz.getDeclaredFields();
            for (int i = 0; i < declaredFields.length; i++) {
                declaredFields[i].setAccessible(true);
                String fieldName = declaredFields[i].getName();
                Set<String> keySet = map.keySet();
                for (String s : keySet) {
                    if (fieldName.equals(s)) {
                        declaredFields[i].set(obj, map.get(s));
                    }
                }
            }
            return obj;
        }
    }
  • 相关阅读:
    Uva1595 对称轴
    Uva712 S树
    Uva673 平衡的括号
    leetcode102 二叉树的层次遍历
    Uva10191 复合词
    C++ multimap的用法
    Uva1103 古代象形符号
    UVa10763 交换学生
    C++ 优先级队列 priority_queue
    ios,zepto穿透解决方案
  • 原文地址:https://www.cnblogs.com/woshuyuqiang/p/9437135.html
Copyright © 2011-2022 走看看