Julia v1.2.0 Documentation. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 178 Defining Promo�on Rules . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 179 Case Study: Ra�onal . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 192 Wri�ng binary broadcas�ng rules . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 193 23 Modules 195 23.1 Summary . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 414 How do I check if the current file is being run as the main script? . . . . . . . . . . . . . . . . . . . 414 How0 码力 | 1250 页 | 4.29 MB | 1 年前3
Julia 1.2.0 DEV Documentation. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 180 Defining Promo�on Rules . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 181 Case Study: Ra�onal . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 194 Wri�ng binary broadcas�ng rules . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 195 24 Modules 197 24.1 Summary . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 416 How do I check if the current file is being run as the main script? . . . . . . . . . . . . . . . . . . . 416 How0 码力 | 1252 页 | 4.28 MB | 1 年前3
Julia v1.1.1 Documentation. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 178 Defining Promo�on Rules . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 179 Case Study: Ra�onal . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 192 Wri�ng binary broadcas�ng rules . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 193 23 Modules 195 23.1 Summary . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 408 How do I check if the current file is being run as the main script? . . . . . . . . . . . . . . . . . . . 408 How0 码力 | 1216 页 | 4.21 MB | 1 年前3
Julia 1.1.0 Documentation. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 178 Defining Promo�on Rules . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 179 Case Study: Ra�onal . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 192 Wri�ng binary broadcas�ng rules . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 193 23 Modules 195 23.1 Summary . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 406 How do I check if the current file is being run as the main script? . . . . . . . . . . . . . . . . . . . 406 How0 码力 | 1214 页 | 4.21 MB | 1 年前3
Julia 1.7.0 DEV Documentation. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 166 Defining Promotion Rules . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 168 Case Study: Rational . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 182 Writing binary broadcasting rules . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 183 16 Modules 185 16.1 Namespace . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 414 How do I check if the current file is being run as the main script? . . . . . . . . . . . . . . . . 414 How do I0 码力 | 1399 页 | 4.59 MB | 1 年前3
Julia 1.6.1 Documentation. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 164 Defining Promotion Rules . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 166 Case Study: Rational . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 180 Writing binary broadcasting rules . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 181 16 Modules 183 16.1 Namespace . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 412 How do I check if the current file is being run as the main script? . . . . . . . . . . . . . . . . 412 How do I0 码力 | 1397 页 | 4.59 MB | 1 年前3
Julia 1.6.0 Documentation. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 164 Defining Promotion Rules . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 166 Case Study: Rational . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 180 Writing binary broadcasting rules . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 181 16 Modules 183 16.1 Namespace . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 412 How do I check if the current file is being run as the main script? . . . . . . . . . . . . . . . . 412 How do I0 码力 | 1397 页 | 4.59 MB | 1 年前3
Julia 1.6.0 DEV Documentation. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 164 Defining Promotion Rules . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 166 Case Study: Rational . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 180 Writing binary broadcasting rules . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 181 16 Modules 183 16.1 Namespace . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 412 How do I check if the current file is being run as the main script? . . . . . . . . . . . . . . . . 412 How do I0 码力 | 1383 页 | 4.56 MB | 1 年前3
Julia 1.6.4 Documentationare explained on the linked page. Note that Bool is an integer type and all the usual promotion rules and numeric operators are also defined on it. 5.3 Bitwise Operators The following bitwise operators Unicode code points, but for performance, the Char conversion does not check that every character value is valid. If you want to check that each converted value is a valid code point, use the isvalid function: "xylophone", 5) 4 julia> findnext(isequal('o'), "xylophone", 8) You can use the occursin function to check if a substring is found within a string: julia> occursin("world", "Hello, world.") true julia>0 码力 | 1324 页 | 4.54 MB | 1 年前3
Julia 1.6.3 Documentationare explained on the linked page. Note that Bool is an integer type and all the usual promotion rules and numeric operators are also defined on it. 5.3 Bitwise Operators The following bitwise operators Unicode code points, but for performance, the Char conversion does not check that every character value is valid. If you want to check that each converted value is a valid code point, use the isvalid function: "xylophone", 5) 4 julia> findnext(isequal('o'), "xylophone", 8) You can use the occursin function to check if a substring is found within a string: julia> occursin("world", "Hello, world.") true julia>0 码力 | 1325 页 | 4.54 MB | 1 年前3
共 87 条
- 1
- 2
- 3
- 4
- 5
- 6
- 9













