将两个向量压平成1张地图的好方法?

问题描述 投票:0回答:1

有没有更好的方法将Notes文档中的两个多值字段展平为SSJS中的地图集合?

到目前为止,我来到了以下内容:

var vw:NotesView = database.getView("configuration");
    if(null != vw){
        var doc:NotesDocument = vw.getFirstDocument();
        if (null != doc){
            var itemname1:string = "userName";
            var itemname2:string = "inboxFile";
            if(doc.hasItem(itemname1) && doc.hasItem(itemname2)){
                var itemvalues1:java.util.Vector = doc.getItemValue(itemname1);
                var itemvalues2:java.util.Vector = doc.getItemValue(itemname2);

                if(itemvalues1.size() == itemvalues2.size()){
                    var map = new java.util.HashMap();
                    var iterator1 = itemvalues1.iterator();
                    var iterator2 = itemvalues2.iterator();                 
                }               

                while (iterator1.hasNext()) {
                    var itemvalue1 = iterator1.next();
                    var itemvalue2 = iterator2.next();
                    if ((typeof(itemvalue1)).endsWith("string")) {
                        map.put(itemvalue1.left(80), itemvalue2.left(80));                      
                    }
                }
                sessionScope.put("setupInbox",map)
            }           
        }
    }   
xpages xpages-ssjs
1个回答
3
投票

如果支持JavaScript forEach构造,您可以使用:

     function mergeVector(keyVector, valueVector) {
        var map = new java.util.HashMap();
        keyVector.forEach(function(curKey, index) {
            if (index < valueVector.size()) {
                map.put(curKey, valueVector.get(index));
            }
        });
        return map;
     }

否则使用:

     function mergeVector(keyVector, valueVector) {
        var map = new java.util.HashMap();
        for(var index = 0; index < keyVector.size(), index++) {
            if (index < valueVector.size()) {
                map.put(keyVector.get(index), valueVector.get(index));
            }
        };
        return map;
     }

希望这可以帮助

© www.soinside.com 2019 - 2024. All rights reserved.