Reusable Code & Reusable Data Structures
}; 1 2 3 4 5 6 7 8 9 10 11 50RUNTIME POLYMORPHISM using bi = boost::intrusive; class dialog_widget : bi::list_base_hook<bi::link_mode<bi::auto_unlink>> { dialog_widget(dialog& parent) { parent dialog { bi::listwidgets; }; 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 51RUNTIME POLYMORPHISM using bi = boost::intrusive; class dialog_widget : bi::list_base_hook<bi::link_mode<bi::auto_unlink>> dialog { bi::list widgets; }; 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 using bi = boost::intrusive; class dialog_widget : bi::list_base_hook<bi::link_mode<bi::auto_unlink>> { }; bi::list 0 码力 | 132 页 | 14.20 MB | 5 月前3The Idris Tutorial Version 0.9.18
data Binary : Nat -> Type where bEnd : Binary Z bO : Binary n -> Binary (n + n) bI : Binary n -> Binary (S (n + n)) bO and bI take a binary number as an argument and effectively shift it one bit left, adding (n:Nat) -> Binary n natToBin Z = bEnd natToBin (S k) with (parity k) natToBin (S (j + j)) | even = bI (natToBin j) natToBin (S (S (j + j))) | odd ?= bO (natToBin (S j)) The problem with the odd case need a Show instance for Binary n: instance Show (Binary n) where show (bO x) = show x ++ "0" show (bI x) = show x ++ "1" show bEnd = "" 48 Chapter 10. Provisional Definitions CHAPTER 11 Interactive0 码力 | 69 页 | 316.20 KB | 1 年前3The Idris Tutorial Version 0.11
data Binary : Nat -> Type where BEnd : Binary Z BO : Binary n -> Binary (n + n) BI : Binary n -> Binary (S (n + n)) BO and BI take a binary number as an argument and effectively shift it one bit left, adding (n:Nat) -> Binary n natToBin Z = BEnd natToBin (S k) with (parity k) natToBin (S (j + j)) | Even = BI (natToBin j) natToBin (S (S (j + j))) | Odd ?= BO (natToBin (S j)) The problem with the Odd case need a Show implementation for Binary n: Show (Binary n) where show (BO x) = show x ++ "0" show (BI x) = show x ++ "1" show BEnd = "" 50 Chapter 11. Provisional Definitions CHAPTER 12 Interactive0 码力 | 71 页 | 314.20 KB | 1 年前3The Idris Tutorial Version 0.9.20.1
data Binary : Nat -> Type where BEnd : Binary Z BO : Binary n -> Binary (n + n) BI : Binary n -> Binary (S (n + n)) BO and BI take a binary number as an argument and effectively shift it one bit left, adding (n:Nat) -> Binary n natToBin Z = BEnd natToBin (S k) with (parity k) natToBin (S (j + j)) | Even = BI (natToBin j) natToBin (S (S (j + j))) | Odd ?= BO (natToBin (S j)) The problem with the Odd case need a Show instance for Binary n: instance Show (Binary n) where show (BO x) = show x ++ "0" show (BI x) = show x ++ "1" show BEnd = "" 50 Chapter 11. Provisional Definitions CHAPTER 12 Interactive0 码力 | 71 页 | 316.18 KB | 1 年前3Guía Práctica de RISC-V: El Atlas de una Arquitectura Abierta Primera Edición, 1.0.5
Carga los datos retornados en elementos secuenciales del registro vector destino. Load indexado tam- bién es llamado gather y store in- dexado también se llama scatter. Utilizamos arreglos dispersos como (La Figura 5.7 en la página 60, Capítulo 5), el cual explicaremos paso a paso. La V en RISC-V tam- bién es por vec- tor. Los arquitectos de RISC-V tenían mucha experiencia positiva con arquitecturas vectorizadas Thread-Local Storage: Almacenamiento local del thread. Í n d i c e ABI, véase también application bi- nary interface ABI de RISC-V, véase Application Binary Interface de RISC-V, 44 Add, 20, 129 immediate0 码力 | 217 页 | 29.97 MB | 1 年前3尝试用RUST写教学操作系统
用RUST写操作系统: 2018年春季操作系统课 http://os.cs.tsinghua.edu.cn/oscourse/OS2018spring/projects#A.2Bi.2F56C4u.2Bi6FbnpqMkAli6Q- 9 用RUST写操作系统: 2018年秋季操作系统专题训练课 http://os.cs.tsinghua.edu.cn/oscourse/OsTrain2018#rustos0 码力 | 23 页 | 1.53 MB | 1 年前3Go vs. GoPlus(Go+)
数据科学的原始时期:数学软件时代 • SQL (1973) • SAS (1976) • MATLAB (1984) • Excel (1985) • Limited Domains (有限领域) ,比如 BI (Business Intelligence) • Limited Data (有限数据规模) • 数据科学不是基础设施,而是数学应用软件 • 全能力:统计/预测/洞察/规划/决策/… 数据科学的基建时期:大数据的兴起 • 迭代的是 y=F(x) 中的 F 预测 • 和大数据并不是互相取代的关系,而是能力加强 数据科学的大爆发时期:DT 时代 • 从前 -Limited Domains (有限领域): 比如 BI (Business Intelligence) -Limited Data (有限数据规模): 比如 Excel、Matlab • 未来 -Full Domains (全领域): 智能应用 (Intelligent0 码力 | 54 页 | 1.82 MB | 1 年前3High-Performance Numerical Integration in the Age of C++26
˜b1 ˜b2 ˜b3 . . . ˜bs−1 ˜bs ˜yn+1 = yn + h s � i=1 ˜biki en+1 = ˜yn+1 − yn+1 = h s � i=1 (˜bi − bi)ki (error estimate) CppCon - Vincent Reverdy - September 20th, 2024 - Aurora, Colorado, USA 34 CC00 码力 | 57 页 | 4.14 MB | 5 月前3Kotlin language specification Version 1.9-rfc+0.1
at i on s , i . e . , K ot l i n /J VM , K ot l i n /J S an d K ot l i n /Nat i v e . C o m pa t i bi l i t y K ot l i n Lan gu age S p e c i fi c at i on i s s t i l l i n p r ogr e s s an d h as e x et er M o d i fi er } m o d i fi e r : ( cl a s s M o d i fi er | m em ber M o d i fi er | vi s i bi l i t y M o d i fi er | f u n ct i o n M o d i fi er | p r o p - er t y M o d i fi er | i n h er i e d s t o u s e a p ar am e t e r i z e d t y p e i n a t y p e - s af e w ay , t h e y m ay u s e bi va r i a n t t y p e ar gu m e n t ⋆, w h i c h i s r ou gh l y e q u i v al e n t t o a c om b i n0 码力 | 310 页 | 1.39 MB | 1 年前3MuPDF 1.22.0 Documentation
b) • op_rg(r, g, b) • op_K(c, m, y, k) • op_k(c, m, y, k) Shadings, images and XObjects • op_BI(image, colorspace) • op_sh(name, shade) API not settled, arguments may change in the future. • op_Do_image(name no longer requires a mask flag. The image already knows if it is a mask. • pdf_processor.op_BI() The op_BI callback is now passed an additional colorspace resource name. 170 Chapter 7. Changes CHAPTER0 码力 | 175 页 | 698.87 KB | 7 月前3
共 305 条
- 1
- 2
- 3
- 4
- 5
- 6
- 31