zoukankan      html  css  js  c++  java
  • MQ 个人小结

    在PCS项目:

    talking 发送队列
    1.1 创建
    @Bean
    public Queue orderTakingQueue() {

    return createQueue(orderTakingQueueName);
    }

    1.2 绑定


    @Bean
    public Binding orderTakingQueueBinding(Queue orderTakingQueue, DirectExchange orderExchange) {
    return BindingBuilder.bind(orderTakingQueue).to(orderExchange).with(orderTakingQueueName);
    }

    1.3 发送
    public String getOrderTakingQueueName() {
    return orderTakingQueueName;
    }

    @Override
    public void sendOrderInfo(String orderInfo) {
    System.out.println("Send order info to MQ: " + orderInfo);
    rabbitTemplate.convertAndSend(mqConfig.getOrderExchangeName(), mqConfig.getOrderTakingQueueName(), orderInfo);
    }


    2.order 接受队列

    2.1 创建

    @Bean
    public Queue orderTakingQueue() {

    return createQueue(orderTakingQueueName);
    }

    2.2 绑定

    @Bean
    public Binding orderTakingQueueBinding(Queue orderTakingQueue, DirectExchange orderExchange) {
    Binding binding = BindingBuilder.bind(orderTakingQueue).to(orderExchange).with(orderTakingQueueName);
    return binding;
    }


    2.3 接受监听(方法)

    @Bean
    public SimpleMessageListenerContainer pkgQueueListenerContainer(ConnectionFactory connectionFactory,MessageReceiver messageReceiver)
    {
    SimpleMessageListenerContainer container = new SimpleMessageListenerContainer();
    container.setConnectionFactory(connectionFactory);
    container.setQueueNames(orderTakingQueueName);
    container.setMessageListener(new MessageListenerAdapter(messageReceiver, "receiveOrderInfo"));
    container.setConcurrentConsumers(32);
    container.setPrefetchCount(20);
    return container;
    }

  • 相关阅读:
    LCA + 二分(倍增)
    Educational Codeforces Round 5
    BNU 51276
    POJ 1511
    hdu2121
    最小树形图(朱刘算法)
    Educational Codeforces Round 1(D. Igor In the Museum) (BFS+离线访问)
    Educational Codeforces Round 1(C. Nearest vectors)
    POJ-2785 4 Values whose Sum is 0(折半枚举 sort + 二分)
    POJ 1661Help Jimmy(逆向DP Or 记忆化搜索 Or 最短路径)
  • 原文地址:https://www.cnblogs.com/chengjun/p/8795221.html
Copyright © 2011-2022 走看看