Package com.leansoft.bigqueue.thrift

Examples of com.leansoft.bigqueue.thrift.QueueResponse

52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
      req.setData("hello world".getBytes());
      client.enqueue(TOPIC, req);
     
      System.out.println("big queue size after enqueue : " + client.getSize(TOPIC));
     
      QueueResponse resp = client.peek(TOPIC);
      System.out.println("big queue size after peek : " + client.getSize(TOPIC));
      System.out.println("peeked message : " + new String(resp.getData()));
     
      resp = client.dequeue(TOPIC);
      System.out.println("big queue size after dequeue : " + client.getSize(TOPIC));
      System.out.println("dequeued message : " + new String(resp.getData()));
    } finally {
      this.closeClient();
    }
   
  }
View Full Code Here
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
    this.queueMap = new HashMap<String, IBigQueue>();
  }

  @Override
  public QueueResponse enqueue(String topic, QueueRequest req) throws TException {
    QueueResponse resp = new QueueResponse();
    if (topic == null) {
      resp.setResultCode(ResultCode.FAILURE);
      return resp;
    }
    IBigQueue bigQueue = queueMap.get(topic);
    if (bigQueue == null) {
      synchronized(lock) {
        bigQueue = queueMap.get(topic);
        if (bigQueue == null) {
          try {
            bigQueue = new BigQueueImpl(queueDir, topic);
            queueMap.put(topic, bigQueue);
          } catch (IOException e) {
            resp.setResultCode(ResultCode.FAILURE);
            return resp;
          }
        }
      }
    }
   
    if (req.getData() != null && req.getData().length > 0) {
      try {
        bigQueue.enqueue(req.getData());
      } catch (IOException e) {
        resp.setResultCode(ResultCode.FAILURE);
        return resp;
      }
      resp.setResultCode(ResultCode.SUCCESS);
      return resp;
    } else {
      resp.setResultCode(ResultCode.FAILURE);
      return resp;
    }
  }
View Full Code Here
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
    }
  }

  @Override
  public QueueResponse dequeue(String topic) throws TException {
    QueueResponse resp = new QueueResponse();
    byte[] data = null;
    IBigQueue bigQueue = queueMap.get(topic);
    if (bigQueue != null) {
      try {
        data = bigQueue.dequeue();
      } catch (IOException e) {
        resp.setResultCode(ResultCode.FAILURE);
        return resp;
      }
    }
    resp.setResultCode(ResultCode.SUCCESS);
    resp.setData(data);
    return resp;
  }
View Full Code Here
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
    return resp;
  }

  @Override
  public QueueResponse peek(String topic) throws TException {
    QueueResponse resp = new QueueResponse();
    byte[] data = null;
    IBigQueue bigQueue = queueMap.get(topic);
    if (bigQueue != null) {
      try {
        data = bigQueue.peek();
      } catch (IOException e) {
        resp.setResultCode(ResultCode.FAILURE);
        return resp;
      }
    }
    resp.setResultCode(ResultCode.SUCCESS);
    resp.setData(data);
    return resp;
  }
View Full Code Here
276
277
278
279
280
281
282
283
284
285
286
287
288
            // instead pre-gen a log when the producer is initialized
//            byte[] logEvent = RandomLogGenerator.genRandomLogEventBytes(LOG_MESSAGE_SIZE_LIMIT);
            long begin = System.currentTimeMillis();
            QueueRequest request = new QueueRequest();
            request.setData(logEvent);
            QueueResponse response = client.enqueue(TestClient.TOPIC, request);
            long end = System.currentTimeMillis();
            if (response.getResultCode() == ResultCode.SUCCESS) {
              testResult.successCount++;
            } else {
              testResult.failureCount++;
            }
            testResult.totalBytesSent += logEvent.length;
View Full Code Here
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
       
        int nullCount = 0;
       
        while(true) {
          long begin = System.currentTimeMillis();
          QueueResponse response = this.client.dequeue(TestClient.TOPIC);
          long end = System.currentTimeMillis();
          if (response.getData() != null) {
            if (response.getResultCode() == ResultCode.SUCCESS) {
              testResult.successCount++;
            } else {
              testResult.failureCount++;
            }
            nullCount = 0;
            testResult.totalBytesReceived += response.getData().length;
            testResult.totalDelay += end - begin;
            testResult.loopCount++;
          } else {
            nullCount++;
          }
View Full Code Here
TOP

Related Classes of com.leansoft.bigqueue.thrift.QueueResponse

  • com.leansoft.thriftqueue.client.ThriftQueueClientDemo
  • com.leansoft.thriftqueue.load.LoadTester$LogConsumer
  • com.leansoft.thriftqueue.load.LoadTester$LogProducer
  • com.leansoft.thriftqueue.server.ThriftQueueServiceImpl
    • Copyright © 2018 www.massapicom. All rights reserved.
    All source code are property of their respective owners. Java is a trademark of Sun Microsystems, Inc and owned by ORACLE Inc. Contact coftware#gmail.com.