Closed isopen closed 6 years ago
I spent a whole day torturing myself with the file https://github.com/tdlib/td/blob/master/td/generate/scheme/td_api.tl I could not smash it into pieces. Because there are too many characters '\n' and the descriptions for attributes can be in one line. In addition, the beginning of the file is not standard. There is also the beginning of '//-'.
Please help me with the documentation to your wonderful library :((
P.S.
Apply there already some Fibonacci mechanism with caching. Further optimization is not needed and it should be fine. 0, 1, 1, 2, 3, 5, 8, 13, 21, 34, 55, 89, 144, 233, 377, 610, 987, 1597, 2584, 4181, 6765, 10946, 17711, … Excellent shows what is happening. or Just here goes normally and full speed Sieve of Eratosthenes. https://upload.wikimedia.org/wikipedia/commons/8/8c/New_Animation_Sieve_of_Eratosthenes.gif or It seems Preston. The situation is very similar to the Preston cycles. Preston cycles demo: https://github.com/isopen/tdlib/blob/master/U%2B1910Preston.cs
Легенда:
Z{v64} = 1 + 2 + 4 + ... + 2^63 = sum{v0^63}[2^i] = 2^64 - 1
irb: 2**64-1
18446744073709551615
python: 2**64-1
18446744073709551615L
@isopen Try without documentation.
I still don't get this guy
Fibonacci numbers are elements of a numerical sequence. Please try to imagine a chessboard.
For this case, something unstable happened, but can be expressed as a sequence. Documentation successfully found.
@levlam helped me. Very capable young man.
tdlib.com tdlib.org lib.td tdlib.ru it would be very cool (i like the last) You can organize the documentation directly on github. There is a wonderful section of the Wiki.
That's cool https://github.com/tdlib/td/blob/master/td/generate/scheme/td_api.tl But it is not very convenient to send information in parts.
Leo Please give another link to the documentation. Preferably without "Telegram" inscriptions. Just a list of methods and transitions to the appropriate pages. I do not want to use VPN. Honestly.
Please. Help