带缓存的素数判断

<!DOCTYPE html>
<html>

<head>
  <title>prime</title>
  <script>
    function assert(value, desc) {
      var li = document.createElement("li");
      li.className = value ? "pass" : "fail";
      li.appendChild(document.createTextNode(desc));
      document.getElementById("results").appendChild(li);
    }

    function isPrime(value) {
      if (value <= 1) {
        console.log('抱歉,素数的讨论范围是大于一的自然数')
        return alert('抱歉,素数的讨论范围是大于一的自然数')
      }
      if (!isPrime.cach) {
        console.log("创建缓存对象");
        isPrime.cach = {};
      }
      debugger;
      if (isPrime.cach[value] !== undefined) {
        console.log("缓存里里可以查到");
        return isPrime.cach[value]
      }
      let prime = true;;
      for (var i = 2, len = Math.pow(value, 1 / 2); i <= len; i++) {
        if (value % i === 0) {
          prime = false;
          break;
        }
      }
      return isPrime.cach[value] = prime;
    }
    console.log(isPrime(6))
    console.log(isPrime(6))


    window.onload = function () {
      assert(true, "The test suite is running.");
      assert(false, "Fail!");
      assert(isPrime(5), "5 is prime!");
      assert(isPrime(5), "The answer was cached!");
    };
  </script>
  <style>
    #results li.pass {
      color: green;
    }

    #results li.fail {
      color: red;
    }
  </style>
</head>

<body>
  <ul id="results"></ul>
</body>

</html>

结果如下:
在这里插入图片描述

  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
列)。生产者将生成的大于20亿的数字发送到消息队列中,消费者从消息队列中接收数字并判断是否为素数。如果是素数,则将结果发送到另一个消息队列中,由生产者从中接收并输出结果。 以下是示例代码,使用Python的pika库实现RabbitMQ消息队列服务: **生产者代码:** ```python import pika import random # 连接RabbitMQ服务器 connection = pika.BlockingConnection(pika.ConnectionParameters('localhost')) channel = connection.channel() # 声明消息队列 channel.queue_declare(queue='number_queue') # 生产随机数并发送到消息队列 number = random.randint(2000000000, 3000000000) channel.basic_publish(exchange='', routing_key='number_queue', body=str(number)) print(" [x] Sent %r" % number) # 关闭连接 connection.close() ``` **消费者代码:** ```python import pika import math # 连接RabbitMQ服务器 connection = pika.BlockingConnection(pika.ConnectionParameters('localhost')) channel = connection.channel() # 声明消息队列 channel.queue_declare(queue='number_queue') channel.queue_declare(queue='prime_queue') # 定义判断素数的函数 def is_prime(n): if n <= 1: return False if n == 2: return True if n % 2 == 0: return False for i in range(3, int(math.sqrt(n)) + 1, 2): if n % i == 0: return False return True # 定义回调函数,接收消息并判断是否为素数 def callback(ch, method, properties, body): number = int(body) if is_prime(number): channel.basic_publish(exchange='', routing_key='prime_queue', body=str(number)) print(" [x] Received %r is a prime number" % number) else: print(" [x] Received %r is not a prime number" % number) ch.basic_ack(delivery_tag=method.delivery_tag) # 限制同时只能处理一个消息 channel.basic_qos(prefetch_count=1) # 接收消息并调用回调函数处理 channel.basic_consume(queue='number_queue', on_message_callback=callback) # 开始接收消息并进入阻塞状态 print(' [*] Waiting for messages. To exit press CTRL+C') channel.start_consuming() ``` **输出结果:** 生产者输出: ``` [x] Sent 2951416152 ``` 消费者输出: ``` [*] Waiting for messages. To exit press CTRL+C [x] Received 2951416152 is not a prime number ``` 如果生产者生成的数字为素数,则消费者输出为: ``` [x] Received 2147483647 is a prime number ```
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值