mirror of
https://github.com/linghuam/boutique-books.git
synced 2024-11-21 17:14:56 +00:00
add:zrender
This commit is contained in:
parent
5c2e5606f8
commit
fbbfd35952
0
b00-阅读笔记/zrender源码/z.js
Normal file
0
b00-阅读笔记/zrender源码/z.js
Normal file
32
b00-阅读笔记/zrender源码/z.md
Normal file
32
b00-阅读笔记/zrender源码/z.md
Normal file
@ -0,0 +1,32 @@
|
||||
# zrender
|
||||
|
||||
## 概览
|
||||
|
||||
```js
|
||||
// 对外暴露一个对象
|
||||
var zrender = {
|
||||
version: '4.0.7',
|
||||
init: function (dom, opts) {},
|
||||
dispose: function (zr) {},
|
||||
getInstance: function (id) {},
|
||||
registerPainter: function (name, Ctor) {}
|
||||
// ...... other interface:src/export.js
|
||||
};
|
||||
```
|
||||
|
||||
## 内部类
|
||||
|
||||
* ZRender
|
||||
|
||||
## 几个重要内部对象(类实例)
|
||||
|
||||
* Storage(M)
|
||||
* Painter(V)
|
||||
* Handler(C)
|
||||
* Animation
|
||||
|
||||
## src/core
|
||||
|
||||
### src/core/arrayDiff.js
|
||||
|
||||
> If x and y are strings, where length(x) = n and length(y) = m, the Needleman-Wunsch algorithm finds an optimal alignment in O(nm) time, using O(nm) space. Hirschberg's algorithm is a clever modification of the Needleman-Wunsch Algorithm which still takes O (nm) time, but needs only O(min{n,m}) space and is much faster in practice.
|
Loading…
Reference in New Issue
Block a user