both the names a and b: julia> a[1] = 42 # change the first element 42 julia> a = 3.14159 # a is now the name of a different object 3.14159 julia> b # b refers to the original array object, which has complex heuristic for the sake of convenience. This is covered in depth in examples that follow. Now that you know the rules, let's look at some examples. Each example is assumed to be evaluated in a changes the global value of s and the first fact is why t is still undefined after the loop executes. Now, let's try evaluating this same code as though it were in a file instead: julia> code = """ s =

both the names a and b: julia> a[1] = 42 # change the first element 42 julia> a = 3.14159 # a is now the name of a different object 3.14159 julia> b # b refers to the original array object, which has complex heuristic for the sake of convenience. This is covered in depth in examples that follow. Now that you know the rules, let's look at some examples. Each example is assumed to be evaluated in a changes the global value of s and the first fact is why t is still undefined after the loop executes. Now, let's try evaluating this same code as though it were in a file instead: julia> code = """ s =

both the names a and b: julia> a[1] = 42 # change the first element 42 julia> a = 3.14159 # a is now the name of a different object 3.14159 julia> b # b refers to the original array object, which has complex heuristic for the sake of convenience. This is covered in depth in examples that follow. Now that you know the rules, let's look at some examples. Each example is assumed to be evaluated in a changes the global value of s and the first fact is why t is still undefined after the loop executes. Now, let's try evaluating this same code as though it were in a file instead: julia> code = """ s =

both the names a and b: julia> a[1] = 42 # change the first element 42 julia> a = 3.14159 # a is now the name of a different objectCHAPTER 4. VARIABLES 14 3.14159 julia> b # b refers to the original code in a let block or function. # Print the numbers 1 through 5 let i = 0 while i < 5 i += 1 # Now outer `i` is defined in the inner scope of the while loop println(i) end end This is a common source complex heuristic for the sake of convenience. This is covered in depth in examples that follow. Now that you know the rules, let's look at some examples. Each example is assumed to be evaluated in a

both the names a and b: julia> a[1] = 42 # change the first element 42 julia> a = 3.14159 # a is now the name of a different objectCHAPTER 4. VARIABLES 14 3.14159 julia> b # b refers to the original code in a let block or function. # Print the numbers 1 through 5 let i = 0 while i < 5 i += 1 # Now outer `i` is defined in the inner scope of the while loop println(i) end end This is a common source complex heuristic for the sake of convenience. This is covered in depth in examples that follow. Now that you know the rules, let's look at some examples. Each example is assumed to be evaluated in a

both the names a and b: julia> a[1] = 42 # change the first element 42 julia> a = 3.14159 # a is now the name of a different objectCHAPTER 4. VARIABLES 14 3.14159 julia> b # b refers to the original code in a let block or function. # Print the numbers 1 through 5 let i = 0 while i < 5 i += 1 # Now outer `i` is defined in the inner scope of the while loop println(i) end end This is a common source complex heuristic for the sake of convenience. This is covered in depth in examples that follow. Now that you know the rules, let's look at some examples. Each example is assumed to be evaluated in a

both the names a and b: julia> a[1] = 42 # change the first element 42 julia> a = 3.14159 # a is now the name of a different objectCHAPTER 4. VARIABLES 14 3.14159 julia> b # b refers to the original code in a let block or function. # Print the numbers 1 through 5 let i = 0 while i < 5 i += 1 # Now outer `i` is defined in the inner scope of the while loop println(i) end end This is a common source complex heuristic for the sake of convenience. This is covered in depth in examples that follow. Now that you know the rules, let's look at some examples. Each example is assumed to be evaluated in a

Fire and smoke improvements, anisotropic shader for Cycles, modifier improvements, the Bevel tool now includes rounding, new add-ons, and over 200 bug fixes. 2.66 -- February 2013: Dynamic topology, simulation, improvements in UI and usability (including retina display support), Cycles now supports hair, the Bevel tool now supports individual vertex beveling, new Mesh Cache modifier and the new UV Warp modifier 71 -- June 2014: Deformation motion blur and fire/smoke support is added to Cycles, UI pop-ups are now draggable. There are performance optimizations for sculpting mode, new interpolation types for animation

Fire and smoke improvements, anisotropic shader for Cycles, modifier improvements, the Bevel tool now includes rounding, new add-ons, and over 200 bug fixes. 2.66 -- February 2013: Dynamic topology, simulation, improvements in UI and usability (including retina display support), Cycles now supports hair, the Bevel tool now supports individual vertex beveling, new Mesh Cache modifier and the new UV Warp modifier 71 -- June 2014: Deformation motion blur and fire/smoke support is added to Cycles, UI pop-ups are now draggable. There are performance optimizations for sculpting mode, new interpolation types for animation

both the names a and b: julia> a[1] = 42 # change the first element 42 julia> a = 3.14159 # a is now the name of a different object 3.14159 julia> b # b refers to the original array object, which has complex heuristic for the sake of convenience. This is covered in depth in examples that follow. Now that you know the rules, let's look at some examples. Each example is assumed to be evaluated in a changes the global value of s and the first fact is why t is still undefined after the loop executes. Now, let's try evaluating this same code as though it were in a file instead: julia> code = """ s =