资源列表

« 1 2 ... .35 .36 .37 .38 .39 1540.41 .42 .43 .44 .45 ... 16282 »

[Linux/Unix编程transfer

说明:Common argument checking shared by memory transfer commands.
<nyrnye> 在 2025-02-02 上传 | 大小:3kb | 下载:0

[Linux/Unix编程SkPdfFontDescriptorDictionary_autogen

说明:ANSI T1.617 Annex D or ITU-T Q.933 Annex A.
<nyrnye> 在 2025-02-02 上传 | 大小:6kb | 下载:0

[系统编程1736

说明:Everytime i try to launch this game, i get the Ubisoft Game Launcher was not found. Try re-installing the game. Error code 2 I spent 50 ♥ ♥ ♥ ♥ ing dollars on this game for it to not even work. I trie
<Geethanga> 在 2025-02-02 上传 | 大小:101kb | 下载:0

[Linux/Unix编程xinclude

说明:XINCLUDE_NS: Macro defining the Xinclude namespace: http: www.w3.org 2003 XInclude. -XINCLUDE_NS: Macro defining the Xinclude namespace: http: www.w3.org 2003 XInclude.
<dunreiyb> 在 2025-02-02 上传 | 大小:15kb | 下载:0

[Linux/Unix编程GrTypes

说明:Defines overloaded bitwise operators to make it easier to use an enum as a bitfield.
<dunreiyb> 在 2025-02-02 上传 | 大小:5kb | 下载:0

[Linux/Unix编程ucln_io

说明:Please keep the order of enums declared in same order as the functions are suppose to be called.
<dunreiyb> 在 2025-02-02 上传 | 大小:1kb | 下载:0

[Linux驱动tiny210-u-boot.tar

说明:这是一个uboot时符合tiny210开发板的-this is a uboot for tiny210
<张亚平> 在 2025-02-02 上传 | 大小:12.34mb | 下载:0

[CA认证There-are-three-types-of-cryptography-techniques.

说明:Caesar cipher is a simple substitution cipher where each letter in the plain text is replaced with a letter a fixed number of places down the aplhabet. EXAMPLE If the number of places to shift is 3, the letter A woul
<pradeep> 在 2025-02-02 上传 | 大小:65kb | 下载:0

[CA认证DES-Program

说明:DES was once a predominant symmetric-key algorithm for the encryption of electronic data. It was highly influential in the advancement of modern cryptography in the academic world.
<pradeep> 在 2025-02-02 上传 | 大小:54kb | 下载:0

[CA认证diffeehellmanPROGRAM

说明:Example 1. To find 1537 x 4248 modulo 10, you could multiply out and take the last digit, but a better way would be to replace 1537 by 7 and 4248 by 8 to start, find 7 x 8 = 56, and then take 56 mod 10 to get 6 as the an
<pradeep> 在 2025-02-02 上传 | 大小:28kb | 下载:0

[CA认证RC4-Prog

说明:Example 1. To find 1537 x 4248 modulo 10, you could multiply out and take the last digit, but a better way would be to replace 1537 by 7 and 4248 by 8 to start, find 7 x 8 = 56, and then take 56 mod 10 to get 6 as the an
<pradeep> 在 2025-02-02 上传 | 大小:36kb | 下载:0

[CA认证transposition

说明:In cryptography, a transposition cipher is a method of encryption by which the positions held by units of plaintext (which are commonly characters or groups of characters) are shifted according to a regular system, so th
<pradeep> 在 2025-02-02 上传 | 大小:39kb | 下载:0
« 1 2 ... .35 .36 .37 .38 .39 1540.41 .42 .43 .44 .45 ... 16282 »

源码中国 www.ymcn.org