to and from other types, and providing a handful of promo�on rules defining what types they should pro- mote to when mixed with other types. 179 180 CHAPTER 23. CONVERSION AND PROMOTION 23.1 Conversion opera�ons involving I/O include reading/wri�ng to files, accessing web services, execu�ng external pro- grams, etc. In all these cases, overall execu�on �me can be improved if other tasks can be run while matrix A then the first method might be be�er. Or, if compu�ng A is expensive and only the current pro- cess has it, then moving it to another process might be unavoidable. Or, if the current process has

to and from other types, and providing a handful of promo�on rules defining what types they should pro- mote to when mixed with other types. 175 176 CHAPTER 21. CONVERSION AND PROMOTION 21.1 Conversion opera�ons involving I/O include reading/wri�ng to files, accessing web services, execu�ng external pro- grams, etc. In all these cases, overall execu�on �me can be improved if other tasks can be run while Construct a new named tuple by merging two or more exis�ng ones, in a le�-associa�ve manner. Merging pro- ceeds le�-to-right, between pairs of named tuples, and so the order of fields present in both the

to and from other types, and providing a handful of promo�on rules defining what types they should pro- mote to when mixed with other types. 175 176 CHAPTER 21. CONVERSION AND PROMOTION 21.1 Conversion opera�ons involving I/O include reading/wri�ng to files, accessing web services, execu�ng external pro- grams, etc. In all these cases, overall execu�on �me can be improved if other tasks can be run while Construct a new named tuple by merging two or more exis�ng ones, in a le�-associa�ve manner. Merging pro- ceeds le�-to-right, between pairs of named tuples, and so the order of fields present in both the

to and from other types, and providing a handful of promo�on rules defining what types they should pro- mote to when mixed with other types. 175 176 CHAPTER 21. CONVERSION AND PROMOTION 21.1 Conversion opera�ons involving I/O include reading/wri�ng to files, accessing web services, execu�ng external pro- grams, etc. In all these cases, overall execu�on �me can be improved if other tasks can be run while Construct a new named tuple by merging two or more exis�ng ones, in a le�-associa�ve manner. Merging pro- ceeds le�-to-right, between pairs of named tuples, and so the order of fields present in both the

to and from other types, and providing a handful of promo�on rules defining what types they should pro- mote to when mixed with other types. 177 178 CHAPTER 22. CONVERSION AND PROMOTION 22.1 Conversion opera�ons involving I/O include reading/wri�ng to files, accessing web services, execu�ng external pro- grams, etc. In all these cases, overall execu�on �me can be improved if other tasks can be run while Construct a new named tuple by merging two or more exis�ng ones, in a le�-associa�ve manner. Merging pro- ceeds le�-to-right, between pairs of named tuples, and so the order of fields present in both the

to and from other types, and providing a handful of promo�on rules defining what types they should pro- mote to when mixed with other types. 177 178 CHAPTER 22. CONVERSION AND PROMOTION 22.1 Conversion opera�ons involving I/O include reading/wri�ng to files, accessing web services, execu�ng external pro- grams, etc. In all these cases, overall execu�on �me can be improved if other tasks can be run while Construct a new named tuple by merging two or more exis�ng ones, in a le�-associa�ve manner. Merging pro- ceeds le�-to-right, between pairs of named tuples, and so the order of fields present in both the

Julia programmers may never feel the need to write code that explicitly uses types. Some kinds of pro- gramming, however, become clearer, simpler, faster and more robust with declared types. 12.1 Type Sometimes, you want a container (like an array) that would normally participate in broadcast to be "pro- tected" from broadcast's behavior of iterating over all of its elements. By placing it inside another It is common to want to create a task and schedule it right away, so the macro Threads.@spawn is pro- vided for that purpose — Threads.@spawn x is equivalent to task = @task x; task.sticky = false;

Julia programmers may never feel the need to write code that explicitly uses types. Some kinds of pro- gramming, however, become clearer, simpler, faster and more robust with declared types. 12.1 Type Sometimes, you want a container (like an array) that would normally participate in broadcast to be "pro- tected" from broadcast's behavior of iterating over all of its elements. By placing it inside another It is common to want to create a task and schedule it right away, so the macro Threads.@spawn is pro- vided for that purpose –- Threads.@spawn x is equivalent to task = @task x; task.sticky = false;

Julia programmers may never feel the need to write code that explicitly uses types. Some kinds of pro- gramming, however, become clearer, simpler, faster and more robust with declared types. 12.1 Type Sometimes, you want a container (like an array) that would normally participate in broadcast to be "pro- tected" from broadcast's behavior of iterating over all of its elements. By placing it inside another It is common to want to create a task and schedule it right away, so the macro Threads.@spawn is pro- vided for that purpose –- Threads.@spawn x is equivalent to task = @task x; task.sticky = false;

Julia programmers may never feel the need to write code that explicitly uses types. Some kinds of pro- gramming, however, become clearer, simpler, faster and more robust with declared types. 12.1 Type Sometimes, you want a container (like an array) that would normally participate in broadcast to be "pro- tected" from broadcast's behavior of iterating over all of its elements. By placing it inside another It is common to want to create a task and schedule it right away, so the macro Threads.@spawn is pro- vided for that purpose –- Threads.@spawn x is equivalent to task = @task x; task.sticky = false;