mongo api,distinct查询后,循环查询

为了减轻手工查询,测试对比数据的工作量。写成代码还挺好用的,在这里记录下:

import com.mongodb.*;
import java.util.List;

public class Test3 {
        public static void main(String[] args){
        try {
            MongoURI uri = new MongoURI("mongodb://IP:端口/test2");//Constants.DIC_DB_ADDR);
            // Open the db
            Mongo mongo = new Mongo(uri);
            DB db = mongo.getDB(uri.getDatabase());
            int sum=0;
            DBCollection coll = db.getCollection("test");//Constants.DIC_TABLE);
          /*  DBObject greatThanEqualAndLessThanEqual=new BasicDBObject();
            greatThanEqualAndLessThanEqual.put("$gte", "1446620400000");
            greatThanEqualAndLessThanEqual.put("$lt", "1446624000000");
            DBObject orGreatThan=new BasicDBObject("err","0");
            DBObject orGreatThan2=new BasicDBObject("err","-");*/

            DBObject ageCompare=new BasicDBObject();
            DBObject distinctkey=new BasicDBObject();
     /*       ageCompare.put("pid","10014326");
            ageCompare.put("ac", "time");
            ageCompare.put("p1", "2");*/
            List<String> lidList = coll.distinct("lid");
            for(int x=0;x<lidList.size();x++) {
                for (long i = 1455520200000l; i < 1455606600000l; i = i + 300000) {

                    ageCompare.put("lid", lidList.get(x));
                    //ageCompare.put("ty", "1");
                    ageCompare.put("ts", i);
                    DBCursor cur = coll.find(ageCompare);
                    //System.out.println(cur.count());
                    if (cur.count() == 2)
                        System.out.println(lidList.get(x)+":"+i);
                }
            }
            //ageCompare.put("$or", new Object[]{orGreatThan,orGreatThan2});

             int result;

            //System.out.println(sum);

            mongo.close();
        }  catch (Exception e) {
            // Die fast
            throw new RuntimeException(e);
        }

    }
}

  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值