学习记录-随机算法

GeekDengshuo

于 2022-01-23 21:09:19 发布

阅读量825

点赞数

分类专栏：学习记录文章标签：算法

本文链接：https://blog.csdn.net/qq_37904945/article/details/122657321

版权

本文记录了关于随机算法的学习，包括Java的ArrayDeque特性、函数式接口、PyCharm中的自动测试、Python日志模块、布隆过滤器的实现、Python模块导入结构以及随机算法的应用，如蓄水池算法和洗牌算法。

摘要由CSDN通过智能技术生成

2022.01.06 - 20222.01.18 知识点

1.Java数据结构ArrayDeque

看一下数据类的描述

Resizable-array implementation of the Deque interface. Array deques have no capacity restrictions; they grow as necessary to support usage. They are not thread-safe; in the absence of external synchronization, they do not support concurrent access by multiple threads. Null elements are prohibited. This class is likely to be faster than Stack when used as a stack, and faster than LinkedList when used as a queue.
Most ArrayDeque operations run in amortized constant time. Exceptions include remove, removeFirstOccurrence, removeLastOccurrence, contains, iterator.remove(), and the bulk operations, all of which run in linear time.

The iterators returned by this class's iterator method are fail-fast: If the deque is modified at any time after the iterator is created, in any way except through the iterator's own remove method, the iterator will generally throw a ConcurrentModificationException. Thus, in the face of concurrent modification, the iterator fails quickly and cleanly, rather than risking arbitrary, non-deterministic behavior at an undetermined time in the future.

Note that the fail-fast behavior of an iterator cannot be guaranteed as it is, generally speaking, impossible to make any hard guarantees in the presence of unsynchronized concurrent modification. Fail-fast iterators throw ConcurrentModificationException on a best-effort basis. Therefore, it would be wrong to write a program that depended on this exception for its correctness: the fail-fast behavior of iterators should be used only to detect bugs.

extends Deque and Queue
No capacity restrictions
No thread-safe
Faster than Stack(stack) and LinkedList(queue)

Deque的一些特性

Two forms method:

Throw exceptions : add() ,remove() ,elements()
return special value: offer(),poll() ,peek()

  <table BORDER CELLPADDING=3 CELLSPACING=1>
  <caption>Summary of Deque methods</caption>
   <tr>
     <td></td>
     <td ALIGN=CENTER COLSPAN = 2> <b>First Element (Head)</b></td>
     <td ALIGN