Combining Co-Routines and Functions into a Job System
Helmut Hlavacs – Combining Co-Routines and Functions into a Job System - CppCon 2021 1 / 39Helmut Hlavacs – Combining Co-Routines and Functions into a Job System - CppCon 2021 2 / 39 About Myself • Professor Federation for Information Processing) Technical Committee 14 Entertainment ComputingHelmut Hlavacs – Combining Co-Routines and Functions into a Job System - CppCon 2021 3 / 39 Creating Game Engines with C++ Engine + • GUI • = Vienna Vulkan Game Engine 2.0 https://github.com/hlavacs 20Helmut Hlavacs – Combining Co-Routines and Functions into a Job System - CppCon 2021 4 / 39 The Game Loop auto prev = hi0 码力 | 39 页 | 1.23 MB | 5 月前3Julia v1.2.0 Documentation
type inference and just-in- �me (JIT) compila�on, implemented using LLVM. It is mul�-paradigm, combining features of impera�ve, func�onal, and object-oriented programming. Julia provides ease and expressiveness Unicode characters are considered to be equivalent in iden�fiers. Different ways of entering Unicode combining characters (e.g., accents) are treated as equivalent (specifically, Julia iden�fiers are NFC-normalized) the same size (performing the opera�on elementwise), and even arrays of different shapes (e.g. combining row and column vectors to produce a matrix). Moreover, like all vectorized "dot calls," these "dot0 码力 | 1250 页 | 4.29 MB | 1 年前3Julia v1.1.1 Documentation
type inference and just-in- �me (JIT) compila�on, implemented using LLVM. It is mul�-paradigm, combining features of impera�ve, func�onal, and object-oriented programming. Julia provides ease and expressiveness Unicode characters are considered to be equivalent in iden�fiers. Different ways of entering Unicode combining characters (e.g., accents) are treated as equivalent (specifically, Julia iden�fiers are NFC-normalized) the same size (performing the opera�on elementwise), and even arrays of different shapes (e.g. combining row and column vectors to produce a matrix). Moreover, like all vectorized "dot calls," these "dot0 码力 | 1216 页 | 4.21 MB | 1 年前3Julia 1.1.0 Documentation
type inference and just-in- �me (JIT) compila�on, implemented using LLVM. It is mul�-paradigm, combining features of impera�ve, func�onal, and object-oriented programming. Julia provides ease and expressiveness Unicode characters are considered to be equivalent in iden�fiers. Different ways of entering Unicode combining characters (e.g., accents) are treated as equivalent (specifically, Julia iden�fiers are NFC-normalized) the same size (performing the opera�on elementwise), and even arrays of different shapes (e.g. combining row and column vectors to produce a matrix). Moreover, like all vectorized "dot calls," these "dot0 码力 | 1214 页 | 4.21 MB | 1 年前3Julia 1.2.0 DEV Documentation
type inference and just-in- �me (JIT) compila�on, implemented using LLVM. It is mul�-paradigm, combining features of impera�ve, func�onal, and object-oriented programming. Julia provides ease and expressiveness Unicode characters are considered to be equivalent in iden�fiers. Different ways of entering Unicode combining characters (e.g., accents) are treated as equivalent (specifically, Julia iden�fiers are NFC-normalized) the same size (performing the opera�on elementwise), and even arrays of different shapes (e.g. combining row and column vectors to produce a matrix). Moreover, like all vectorized "dot calls," these "dot0 码力 | 1252 页 | 4.28 MB | 1 年前3Back To Basics: Functional Programming in C++
for solving a problem Creating ranges: iota, generator Transforming ranges: transform, filter Combining ranges: cartesian_product, zip, concat Jonathan Müller — @foonathan Back to Basics: Functional for solving a problem Creating ranges: iota, generator Transforming ranges: transform, filter Combining ranges: cartesian_product, zip, concat Splitting ranges: split, chunk_by Jonathan Müller — @foonathan for solving a problem Creating ranges: iota, generator Transforming ranges: transform, filter Combining ranges: cartesian_product, zip, concat Splitting ranges: split, chunk_by Joining ranges: join, join_with0 码力 | 178 页 | 918.67 KB | 5 月前3Julia v1.4.2 Documentation
type inference and just-in-time (JIT) compilation, implemented using LLVM. It is multi-paradigm, combining features of imperative, functional, and object-oriented programming. Julia provides ease and expressiveness characters are considered to be equivalent in identifiers. Different ways of entering Uni- code combining characters (e.g., accents) are treated as equivalent (specifically, Julia identifiers are NFC- the same size (performing the operation elementwise), and even arrays of different shapes (e.g. combining row and column vectors to produce a matrix). Moreover, like all vectorized "dot calls," these "dot0 码力 | 1314 页 | 4.29 MB | 1 年前3Julia v1.3.1 Documentation
type inference and just-in- �me (JIT) compila�on, implemented using LLVM. It is mul�-paradigm, combining features of impera�ve, func�onal, and object-oriented programming. Julia provides ease and expressiveness Unicode characters are considered to be equivalent in iden�fiers. Different ways of entering Unicode combining characters (e.g., accents) are treated as equivalent (specifically, Julia iden�fiers are NFC-normalized) the same size (performing the opera�on elementwise), and even arrays of different shapes (e.g. combining row and column vectors to produce a matrix). Moreover, like all vectorized "dot calls," these "dot0 码力 | 1276 页 | 4.36 MB | 1 年前3Julia v1.5.4 Documentation
type inference and just-in-time (JIT) compilation, implemented using LLVM. It is multi-paradigm, combining features of imperative, functional, and object-oriented programming. Julia provides ease and expressiveness characters are considered to be equivalent in identifiers. Different ways of entering Unicode combining characters (e.g., accents) are treated as equivalent (specifically, Julia identifiers are NFC-normalized) the same size (performing the operation elementwise), and even arrays of different shapes (e.g. combining row and column vectors to produce a matrix). Moreover, like all vectorized "dot calls," these "dot0 码力 | 1337 页 | 4.41 MB | 1 年前3Julia v1.6.6 Documentation
type inference and just-in-time (JIT) compilation, implemented using LLVM. It is multi-paradigm, combining features of imperative, functional, and object-oriented programming. Julia provides ease and expressiveness characters are considered to be equivalent in identifiers. Different ways of entering Unicode combining characters (e.g., accents) are treated as equivalent (specifically, Julia identifiers are NFC-normalized) the same size (performing the operation elementwise), and even arrays of different shapes (e.g. combining row and column vectors to produce a matrix). Moreover, like all vectorized "dot calls," these "dot0 码力 | 1324 页 | 4.54 MB | 1 年前3
共 1000 条
- 1
- 2
- 3
- 4
- 5
- 6
- 100