[{"data":1,"prerenderedAt":3118},["ShallowReactive",2],{"item-lessons-light-ch25-command-based-programming":3,"item-examples-light-ch25-command-based-programming":444,"item-exercises-light-ch25-command-based-programming":753,"item-lesson-full-ch25-command-based-programming-25.4":1070,"item-example-full-ch25-command-based-programming-25.4":1541,"item-exercise-full-ch25-command-based-programming-25.4":1971},[4,8,12,16,20,24,28,32,36,40,44,48,52,56,60,64,68,72,76,80,84,88,92,96,100,104,108,112,116,120,124,128,132,136,140,144,148,152,156,160,164,168,172,176,180,184,188,192,196,200,204,208,212,216,220,224,228,232,236,240,244,248,252,256,260,264,268,272,276,280,284,288,292,296,300,304,308,312,316,320,324,328,332,336,340,344,348,352,356,360,364,368,372,376,380,384,388,392,396,400,404,408,412,416,420,424,428,432,436,440],{"path":5,"title":6,"stem":7},"\u002Fshockwave-curriculum\u002Flessons\u002Fch01-why-java-for-frc\u002F1-why-java-for-frc","Why Java for FRC?","shockwave-curriculum\u002Flessons\u002Fch01-why-java-for-frc\u002F1.1-why-java-for-frc",{"path":9,"title":10,"stem":11},"\u002Fshockwave-curriculum\u002Flessons\u002Fch01-why-java-for-frc\u002F2-intro-to-algorithms-programming-and-compilers","Intro to Algorithms, Programming and Compilers","shockwave-curriculum\u002Flessons\u002Fch01-why-java-for-frc\u002F1.2-intro-to-algorithms-programming-and-compilers",{"path":13,"title":14,"stem":15},"\u002Fshockwave-curriculum\u002Flessons\u002Fch02-variables-and-types\u002F1-variables-and-data-types","Variables & Data Types","shockwave-curriculum\u002Flessons\u002Fch02-variables-and-types\u002F2.1-variables-and-data-types",{"path":17,"title":18,"stem":19},"\u002Fshockwave-curriculum\u002Flessons\u002Fch02-variables-and-types\u002F2-expressions-and-output","Expressions & Output","shockwave-curriculum\u002Flessons\u002Fch02-variables-and-types\u002F2.2-expressions-and-output",{"path":21,"title":22,"stem":23},"\u002Fshockwave-curriculum\u002Flessons\u002Fch02-variables-and-types\u002F3-assignment-and-input","Assignment & Input","shockwave-curriculum\u002Flessons\u002Fch02-variables-and-types\u002F2.3-assignment-and-input",{"path":25,"title":26,"stem":27},"\u002Fshockwave-curriculum\u002Flessons\u002Fch02-variables-and-types\u002F4-casting-and-ranges-of-values","Casting & Ranges of Values","shockwave-curriculum\u002Flessons\u002Fch02-variables-and-types\u002F2.4-casting-and-ranges-of-values",{"path":29,"title":30,"stem":31},"\u002Fshockwave-curriculum\u002Flessons\u002Fch02-variables-and-types\u002F5-compound-assignment-operators","Compound Assignment Operators","shockwave-curriculum\u002Flessons\u002Fch02-variables-and-types\u002F2.5-compound-assignment-operators",{"path":33,"title":34,"stem":35},"\u002Fshockwave-curriculum\u002Flessons\u002Fch03-apis-libraries-and-documentation\u002F1-apis-and-libraries","APIs and Libraries","shockwave-curriculum\u002Flessons\u002Fch03-apis-libraries-and-documentation\u002F3.1-apis-and-libraries",{"path":37,"title":38,"stem":39},"\u002Fshockwave-curriculum\u002Flessons\u002Fch03-apis-libraries-and-documentation\u002F2-documentation-with-comments-and-preconditions","Documentation with Comments and Preconditions","shockwave-curriculum\u002Flessons\u002Fch03-apis-libraries-and-documentation\u002F3.2-documentation-with-comments-and-preconditions",{"path":41,"title":42,"stem":43},"\u002Fshockwave-curriculum\u002Flessons\u002Fch03-apis-libraries-and-documentation\u002F3-packages-and-imports","Packages & Imports","shockwave-curriculum\u002Flessons\u002Fch03-apis-libraries-and-documentation\u002F3.3-packages-and-imports",{"path":45,"title":46,"stem":47},"\u002Fshockwave-curriculum\u002Flessons\u002Fch04-using-objects-and-calling-methods\u002F1-methods-signatures-and-parameters","Methods, Signatures & Parameters","shockwave-curriculum\u002Flessons\u002Fch04-using-objects-and-calling-methods\u002F4.1-methods-signatures-and-parameters",{"path":49,"title":50,"stem":51},"\u002Fshockwave-curriculum\u002Flessons\u002Fch04-using-objects-and-calling-methods\u002F2-calling-class-methods","Calling Class Methods","shockwave-curriculum\u002Flessons\u002Fch04-using-objects-and-calling-methods\u002F4.2-calling-class-methods",{"path":53,"title":54,"stem":55},"\u002Fshockwave-curriculum\u002Flessons\u002Fch04-using-objects-and-calling-methods\u002F3-using-the-math-class","Using the Math Class","shockwave-curriculum\u002Flessons\u002Fch04-using-objects-and-calling-methods\u002F4.3-using-the-math-class",{"path":57,"title":58,"stem":59},"\u002Fshockwave-curriculum\u002Flessons\u002Fch04-using-objects-and-calling-methods\u002F4-objects-instances-of-classes","Objects — Instances of Classes","shockwave-curriculum\u002Flessons\u002Fch04-using-objects-and-calling-methods\u002F4.4-objects-instances-of-classes",{"path":61,"title":62,"stem":63},"\u002Fshockwave-curriculum\u002Flessons\u002Fch04-using-objects-and-calling-methods\u002F5-creating-and-initializing-objects-constructors","Creating & Initializing Objects: Constructors","shockwave-curriculum\u002Flessons\u002Fch04-using-objects-and-calling-methods\u002F4.5-creating-and-initializing-objects-constructors",{"path":65,"title":66,"stem":67},"\u002Fshockwave-curriculum\u002Flessons\u002Fch04-using-objects-and-calling-methods\u002F6-calling-instance-methods","Calling Instance Methods","shockwave-curriculum\u002Flessons\u002Fch04-using-objects-and-calling-methods\u002F4.6-calling-instance-methods",{"path":69,"title":70,"stem":71},"\u002Fshockwave-curriculum\u002Flessons\u002Fch05-control-structures\u002F1-5.2-if-statements-and-for-loops","Control Structures: if Statements & For Loops","shockwave-curriculum\u002Flessons\u002Fch05-control-structures\u002F5.1-5.2-if-statements-and-for-loops",{"path":73,"title":74,"stem":75},"\u002Fshockwave-curriculum\u002Flessons\u002Fch05-control-structures\u002F10-nested-iteration","Nested Iteration","shockwave-curriculum\u002Flessons\u002Fch05-control-structures\u002F5.10-nested-iteration",{"path":77,"title":78,"stem":79},"\u002Fshockwave-curriculum\u002Flessons\u002Fch05-control-structures\u002F11-informal-runtime-analysis-of-loops","Informal Runtime Analysis of Loops","shockwave-curriculum\u002Flessons\u002Fch05-control-structures\u002F5.11-informal-runtime-analysis-of-loops",{"path":81,"title":82,"stem":83},"\u002Fshockwave-curriculum\u002Flessons\u002Fch05-control-structures\u002F12-switch-statements-and-expressions","switch Statements and Expressions","shockwave-curriculum\u002Flessons\u002Fch05-control-structures\u002F5.12-switch-statements-and-expressions",{"path":85,"title":86,"stem":87},"\u002Fshockwave-curriculum\u002Flessons\u002Fch05-control-structures\u002F3-algorithms-with-selection-and-repetition","Algorithms with Selection and Repetition","shockwave-curriculum\u002Flessons\u002Fch05-control-structures\u002F5.3-algorithms-with-selection-and-repetition",{"path":89,"title":90,"stem":91},"\u002Fshockwave-curriculum\u002Flessons\u002Fch05-control-structures\u002F4-boolean-expressions","Boolean Expressions","shockwave-curriculum\u002Flessons\u002Fch05-control-structures\u002F5.4-boolean-expressions",{"path":93,"title":94,"stem":95},"\u002Fshockwave-curriculum\u002Flessons\u002Fch05-control-structures\u002F5-nested-if-statements","Nested if Statements","shockwave-curriculum\u002Flessons\u002Fch05-control-structures\u002F5.5-nested-if-statements",{"path":97,"title":98,"stem":99},"\u002Fshockwave-curriculum\u002Flessons\u002Fch05-control-structures\u002F6-compound-boolean-expressions","Compound Boolean Expressions","shockwave-curriculum\u002Flessons\u002Fch05-control-structures\u002F5.6-compound-boolean-expressions",{"path":101,"title":102,"stem":103},"\u002Fshockwave-curriculum\u002Flessons\u002Fch05-control-structures\u002F7-comparing-boolean-expressions-de-morgans-laws","Comparing Boolean Expressions (De Morgan's Laws)","shockwave-curriculum\u002Flessons\u002Fch05-control-structures\u002F5.7-comparing-boolean-expressions-de-morgans-laws",{"path":105,"title":106,"stem":107},"\u002Fshockwave-curriculum\u002Flessons\u002Fch05-control-structures\u002F8-while-loops","While Loops","shockwave-curriculum\u002Flessons\u002Fch05-control-structures\u002F5.8-while-loops",{"path":109,"title":110,"stem":111},"\u002Fshockwave-curriculum\u002Flessons\u002Fch05-control-structures\u002F9-implementing-selection-and-iteration-algorithms","Implementing Selection and Iteration Algorithms","shockwave-curriculum\u002Flessons\u002Fch05-control-structures\u002F5.9-implementing-selection-and-iteration-algorithms",{"path":113,"title":114,"stem":115},"\u002Fshockwave-curriculum\u002Flessons\u002Fch06-strings\u002F1-strings","Strings","shockwave-curriculum\u002Flessons\u002Fch06-strings\u002F6.1-strings",{"path":117,"title":118,"stem":119},"\u002Fshockwave-curriculum\u002Flessons\u002Fch06-strings\u002F2-string-algorithms","String Algorithms","shockwave-curriculum\u002Flessons\u002Fch06-strings\u002F6.2-string-algorithms",{"path":121,"title":122,"stem":123},"\u002Fshockwave-curriculum\u002Flessons\u002Fch07-the-class-blueprint\u002F1-anatomy-of-a-java-class","The Class Blueprint","shockwave-curriculum\u002Flessons\u002Fch07-the-class-blueprint\u002F7.1-anatomy-of-a-java-class",{"path":125,"title":126,"stem":127},"\u002Fshockwave-curriculum\u002Flessons\u002Fch07-the-class-blueprint\u002F2-methods-how-to-write-them","Methods: How to Write Them","shockwave-curriculum\u002Flessons\u002Fch07-the-class-blueprint\u002F7.2-methods-how-to-write-them",{"path":129,"title":130,"stem":131},"\u002Fshockwave-curriculum\u002Flessons\u002Fch07-the-class-blueprint\u002F3-methods-passing-and-returning-references-of-an-object","Methods: Passing & Returning References of an Object","shockwave-curriculum\u002Flessons\u002Fch07-the-class-blueprint\u002F7.3-methods-passing-and-returning-references-of-an-object",{"path":133,"title":134,"stem":135},"\u002Fshockwave-curriculum\u002Flessons\u002Fch07-the-class-blueprint\u002F4-class-static-variables-and-methods","Class (static) Variables & Methods","shockwave-curriculum\u002Flessons\u002Fch07-the-class-blueprint\u002F7.4-class-static-variables-and-methods",{"path":137,"title":138,"stem":139},"\u002Fshockwave-curriculum\u002Flessons\u002Fch08-constructors-and-this\u002F1-8.2-constructors-and-this","Constructors & \"this\"","shockwave-curriculum\u002Flessons\u002Fch08-constructors-and-this\u002F8.1-8.2-constructors-and-this",{"path":141,"title":142,"stem":143},"\u002Fshockwave-curriculum\u002Flessons\u002Fch09-storing-data\u002F1-array-creation-and-access","Array Creation and Access","shockwave-curriculum\u002Flessons\u002Fch09-storing-data\u002F9.1-array-creation-and-access",{"path":145,"title":146,"stem":147},"\u002Fshockwave-curriculum\u002Flessons\u002Fch09-storing-data\u002F2-arraylist-and-its-methods","ArrayList and its Methods","shockwave-curriculum\u002Flessons\u002Fch09-storing-data\u002F9.2-arraylist-and-its-methods",{"path":149,"title":150,"stem":151},"\u002Fshockwave-curriculum\u002Flessons\u002Fch09-storing-data\u002F3-optional-hashmap-dictionary-data-structure","HashMap (Dictionary) Data Structure","shockwave-curriculum\u002Flessons\u002Fch09-storing-data\u002F9.3-optional-hashmap-dictionary-data-structure",{"path":153,"title":154,"stem":155},"\u002Fshockwave-curriculum\u002Flessons\u002Fch09-storing-data\u002F4-array-traversals","Array Traversals","shockwave-curriculum\u002Flessons\u002Fch09-storing-data\u002F9.4-array-traversals",{"path":157,"title":158,"stem":159},"\u002Fshockwave-curriculum\u002Flessons\u002Fch09-storing-data\u002F5-implementing-array-algorithms","Implementing Array Algorithms","shockwave-curriculum\u002Flessons\u002Fch09-storing-data\u002F9.5-implementing-array-algorithms",{"path":161,"title":162,"stem":163},"\u002Fshockwave-curriculum\u002Flessons\u002Fch09-storing-data\u002F6-arraylist-traversals","ArrayList Traversals","shockwave-curriculum\u002Flessons\u002Fch09-storing-data\u002F9.6-arraylist-traversals",{"path":165,"title":166,"stem":167},"\u002Fshockwave-curriculum\u002Flessons\u002Fch09-storing-data\u002F7-implementing-arraylist-algorithms","Implementing ArrayList Algorithms","shockwave-curriculum\u002Flessons\u002Fch09-storing-data\u002F9.7-implementing-arraylist-algorithms",{"path":169,"title":170,"stem":171},"\u002Fshockwave-curriculum\u002Flessons\u002Fch09-storing-data\u002F8-using-text-files","Using Text Files","shockwave-curriculum\u002Flessons\u002Fch09-storing-data\u002F9.8-using-text-files",{"path":173,"title":174,"stem":175},"\u002Fshockwave-curriculum\u002Flessons\u002Fch10-2d-arrays\u002F1-2d-array-creation-and-access","2D Array Creation and Access","shockwave-curriculum\u002Flessons\u002Fch10-2d-arrays\u002F10.1-2d-array-creation-and-access",{"path":177,"title":178,"stem":179},"\u002Fshockwave-curriculum\u002Flessons\u002Fch10-2d-arrays\u002F2-2d-array-traversals-nested-loops","2D Array Traversals: Nested Loops","shockwave-curriculum\u002Flessons\u002Fch10-2d-arrays\u002F10.2-2d-array-traversals-nested-loops",{"path":181,"title":182,"stem":183},"\u002Fshockwave-curriculum\u002Flessons\u002Fch10-2d-arrays\u002F3-implementing-2d-array-algorithms","Implementing 2D Array Algorithms","shockwave-curriculum\u002Flessons\u002Fch10-2d-arrays\u002F10.3-implementing-2d-array-algorithms",{"path":185,"title":186,"stem":187},"\u002Fshockwave-curriculum\u002Flessons\u002Fch11-enums-named-choices\u002F11-enums-named-choices","Enums: Named Choices","shockwave-curriculum\u002Flessons\u002Fch11-enums-named-choices\u002F11-enums-named-choices",{"path":189,"title":190,"stem":191},"\u002Fshockwave-curriculum\u002Flessons\u002Fch12-exceptions-and-try-catch\u002F12-exceptions-and-try-catch","Exceptions & try\u002Fcatch","shockwave-curriculum\u002Flessons\u002Fch12-exceptions-and-try-catch\u002F12-exceptions-and-try-catch",{"path":193,"title":194,"stem":195},"\u002Fshockwave-curriculum\u002Flessons\u002Fch13-common-gotchas\u002F13-common-gotchas","Common Gotchas","shockwave-curriculum\u002Flessons\u002Fch13-common-gotchas\u002F13-common-gotchas",{"path":197,"title":198,"stem":199},"\u002Fshockwave-curriculum\u002Flessons\u002Fch14-why-design-patterns\u002F14-why-design-patterns","Why Design Patterns?","shockwave-curriculum\u002Flessons\u002Fch14-why-design-patterns\u002F14-why-design-patterns",{"path":201,"title":202,"stem":203},"\u002Fshockwave-curriculum\u002Flessons\u002Fch15-advanced-collections\u002F15-advanced-collections","Advanced Collections (Set\u002FQueue\u002FMap)","shockwave-curriculum\u002Flessons\u002Fch15-advanced-collections\u002F15-advanced-collections",{"path":205,"title":206,"stem":207},"\u002Fshockwave-curriculum\u002Flessons\u002Fch16-writing-your-own-generics\u002F16-writing-your-own-generics","Writing Your Own Generics","shockwave-curriculum\u002Flessons\u002Fch16-writing-your-own-generics\u002F16-writing-your-own-generics",{"path":209,"title":210,"stem":211},"\u002Fshockwave-curriculum\u002Flessons\u002Fch17-inheritance-and-abstractions\u002F1-inheritance-superclass-subclass","Inheritance, Superclass, Subclass","shockwave-curriculum\u002Flessons\u002Fch17-inheritance-and-abstractions\u002F17.1-inheritance-superclass-subclass",{"path":213,"title":214,"stem":215},"\u002Fshockwave-curriculum\u002Flessons\u002Fch17-inheritance-and-abstractions\u002F2-inheritance-and-constructors","Inheritance and Constructors","shockwave-curriculum\u002Flessons\u002Fch17-inheritance-and-abstractions\u002F17.2-inheritance-and-constructors",{"path":217,"title":218,"stem":219},"\u002Fshockwave-curriculum\u002Flessons\u002Fch17-inheritance-and-abstractions\u002F3-inheritance-hierarchies","Inheritance Hierarchies","shockwave-curriculum\u002Flessons\u002Fch17-inheritance-and-abstractions\u002F17.3-inheritance-hierarchies",{"path":221,"title":222,"stem":223},"\u002Fshockwave-curriculum\u002Flessons\u002Fch17-inheritance-and-abstractions\u002F4-object-superclass","Object Superclass","shockwave-curriculum\u002Flessons\u002Fch17-inheritance-and-abstractions\u002F17.4-object-superclass",{"path":225,"title":226,"stem":227},"\u002Fshockwave-curriculum\u002Flessons\u002Fch17-inheritance-and-abstractions\u002F5-abstract-classes-and-methods","Abstract Classes and Methods","shockwave-curriculum\u002Flessons\u002Fch17-inheritance-and-abstractions\u002F17.5-abstract-classes-and-methods",{"path":229,"title":230,"stem":231},"\u002Fshockwave-curriculum\u002Flessons\u002Fch18-polymorphism-many-forms\u002F1-overriding-methods","Overriding Methods","shockwave-curriculum\u002Flessons\u002Fch18-polymorphism-many-forms\u002F18.1-overriding-methods",{"path":233,"title":234,"stem":235},"\u002Fshockwave-curriculum\u002Flessons\u002Fch18-polymorphism-many-forms\u002F2-super-keyword","super Keyword","shockwave-curriculum\u002Flessons\u002Fch18-polymorphism-many-forms\u002F18.2-super-keyword",{"path":237,"title":238,"stem":239},"\u002Fshockwave-curriculum\u002Flessons\u002Fch18-polymorphism-many-forms\u002F3-polymorphism","Polymorphism","shockwave-curriculum\u002Flessons\u002Fch18-polymorphism-many-forms\u002F18.3-polymorphism",{"path":241,"title":242,"stem":243},"\u002Fshockwave-curriculum\u002Flessons\u002Fch19-interfaces-as-contracts\u002F19-interfaces-as-contracts","Interfaces as Contracts","shockwave-curriculum\u002Flessons\u002Fch19-interfaces-as-contracts\u002F19-interfaces-as-contracts",{"path":245,"title":246,"stem":247},"\u002Fshockwave-curriculum\u002Flessons\u002Fch19-interfaces-as-contracts\u002F1-lambdas-and-method-references","Lambdas & Method References","shockwave-curriculum\u002Flessons\u002Fch19-interfaces-as-contracts\u002F19.1-lambdas-and-method-references",{"path":249,"title":250,"stem":251},"\u002Fshockwave-curriculum\u002Flessons\u002Fch20-the-io-layer-pattern\u002F20-the-io-layer-pattern","The IO-Layer Pattern","shockwave-curriculum\u002Flessons\u002Fch20-the-io-layer-pattern\u002F20-the-io-layer-pattern",{"path":253,"title":254,"stem":255},"\u002Fshockwave-curriculum\u002Flessons\u002Fch21-static-factories\u002F21-static-factories","Static Factories","shockwave-curriculum\u002Flessons\u002Fch21-static-factories\u002F21-static-factories",{"path":257,"title":258,"stem":259},"\u002Fshockwave-curriculum\u002Flessons\u002Fch22-the-builder-pattern\u002F22-the-builder-pattern","The Builder Pattern","shockwave-curriculum\u002Flessons\u002Fch22-the-builder-pattern\u002F22-the-builder-pattern",{"path":261,"title":262,"stem":263},"\u002Fshockwave-curriculum\u002Flessons\u002Fch23-encapsulation-and-final\u002F1-scope-and-access","Access, final, and Immutability","shockwave-curriculum\u002Flessons\u002Fch23-encapsulation-and-final\u002F23.1-scope-and-access",{"path":265,"title":266,"stem":267},"\u002Fshockwave-curriculum\u002Flessons\u002Fch24-optional-avoiding-null-pointer-exceptions\u002F24-optional-avoiding-null-pointer-exceptions","Optional: Avoiding Null Pointer Exceptions","shockwave-curriculum\u002Flessons\u002Fch24-optional-avoiding-null-pointer-exceptions\u002F24-optional-avoiding-null-pointer-exceptions",{"path":269,"title":270,"stem":271},"\u002Fshockwave-curriculum\u002Flessons\u002Fch25-command-based-programming\u002F1-what-is-command-based-programming","What Is Command-Based Programming?","shockwave-curriculum\u002Flessons\u002Fch25-command-based-programming\u002F25.1-what-is-command-based-programming",{"path":273,"title":274,"stem":275},"\u002Fshockwave-curriculum\u002Flessons\u002Fch25-command-based-programming\u002F2-commands-and-command-compositions","Commands & Command Compositions","shockwave-curriculum\u002Flessons\u002Fch25-command-based-programming\u002F25.2-commands-and-command-compositions",{"path":277,"title":278,"stem":279},"\u002Fshockwave-curriculum\u002Flessons\u002Fch25-command-based-programming\u002F3-the-command-scheduler","The Command Scheduler","shockwave-curriculum\u002Flessons\u002Fch25-command-based-programming\u002F25.3-the-command-scheduler",{"path":281,"title":282,"stem":283},"\u002Fshockwave-curriculum\u002Flessons\u002Fch25-command-based-programming\u002F4-state-machines-logic","State Machines: Logic","shockwave-curriculum\u002Flessons\u002Fch25-command-based-programming\u002F25.4-state-machines-logic",{"path":285,"title":286,"stem":287},"\u002Fshockwave-curriculum\u002Flessons\u002Fch25-command-based-programming\u002F5-managing-transitions","Managing Transitions","shockwave-curriculum\u002Flessons\u002Fch25-command-based-programming\u002F25.5-managing-transitions",{"path":289,"title":290,"stem":291},"\u002Fshockwave-curriculum\u002Flessons\u002Fch25-command-based-programming\u002F6-binding-commands-to-triggers","Binding Commands to Triggers","shockwave-curriculum\u002Flessons\u002Fch25-command-based-programming\u002F25.6-binding-commands-to-triggers",{"path":293,"title":294,"stem":295},"\u002Fshockwave-curriculum\u002Flessons\u002Fch25-command-based-programming\u002F7-structuring-a-command-based-robot-project","Structuring a Command-Based Robot Project","shockwave-curriculum\u002Flessons\u002Fch25-command-based-programming\u002F25.7-structuring-a-command-based-robot-project",{"path":297,"title":298,"stem":299},"\u002Fshockwave-curriculum\u002Flessons\u002Fch26-architecture-takeaways\u002F26-architecture-takeaways","Architecture Takeaways","shockwave-curriculum\u002Flessons\u002Fch26-architecture-takeaways\u002F26-architecture-takeaways",{"path":301,"title":302,"stem":303},"\u002Fshockwave-curriculum\u002Flessons\u002Fch27-program-design-and-abstraction\u002F1-abstraction-and-program-design","Abstraction and Program Design","shockwave-curriculum\u002Flessons\u002Fch27-program-design-and-abstraction\u002F27.1-abstraction-and-program-design",{"path":305,"title":306,"stem":307},"\u002Fshockwave-curriculum\u002Flessons\u002Fch27-program-design-and-abstraction\u002F2-impact-of-program-design","Impact of Program Design","shockwave-curriculum\u002Flessons\u002Fch27-program-design-and-abstraction\u002F27.2-impact-of-program-design",{"path":309,"title":310,"stem":311},"\u002Fshockwave-curriculum\u002Flessons\u002Fch28-algorithms-searching-sorting-recursion\u002F1-searching-algorithms","Searching Algorithms","shockwave-curriculum\u002Flessons\u002Fch28-algorithms-searching-sorting-recursion\u002F28.1-searching-algorithms",{"path":313,"title":314,"stem":315},"\u002Fshockwave-curriculum\u002Flessons\u002Fch28-algorithms-searching-sorting-recursion\u002F2-sorting-algorithms","Sorting Algorithms","shockwave-curriculum\u002Flessons\u002Fch28-algorithms-searching-sorting-recursion\u002F28.2-sorting-algorithms",{"path":317,"title":318,"stem":319},"\u002Fshockwave-curriculum\u002Flessons\u002Fch28-algorithms-searching-sorting-recursion\u002F3-recursion","Recursion","shockwave-curriculum\u002Flessons\u002Fch28-algorithms-searching-sorting-recursion\u002F28.3-recursion",{"path":321,"title":322,"stem":323},"\u002Fshockwave-curriculum\u002Flessons\u002Fch28-algorithms-searching-sorting-recursion\u002F4-recursive-searching-and-sorting","Recursive Searching and Sorting","shockwave-curriculum\u002Flessons\u002Fch28-algorithms-searching-sorting-recursion\u002F28.4-recursive-searching-and-sorting",{"path":325,"title":326,"stem":327},"\u002Fshockwave-curriculum\u002Flessons\u002Fch29-git-and-github-basics\u002F1-coming-soon","Git & GitHub Basics — Coming Soon","shockwave-curriculum\u002Flessons\u002Fch29-git-and-github-basics\u002F29.1-coming-soon",{"path":329,"title":330,"stem":331},"\u002Fshockwave-curriculum\u002Flessons\u002Fch30-git-history-and-merging\u002F1-coming-soon","Git — History & Merging — Coming Soon","shockwave-curriculum\u002Flessons\u002Fch30-git-history-and-merging\u002F30.1-coming-soon",{"path":333,"title":334,"stem":335},"\u002Fshockwave-curriculum\u002Flessons\u002Fch31-dev-environment-and-tooling\u002F1-coming-soon","Dev Environment & Tooling — Coming Soon","shockwave-curriculum\u002Flessons\u002Fch31-dev-environment-and-tooling\u002F31.1-coming-soon",{"path":337,"title":338,"stem":339},"\u002Fshockwave-curriculum\u002Flessons\u002Fch32-unit-testing\u002F1-coming-soon","Unit Testing — Coming Soon","shockwave-curriculum\u002Flessons\u002Fch32-unit-testing\u002F32.1-coming-soon",{"path":341,"title":342,"stem":343},"\u002Fshockwave-curriculum\u002Flessons\u002Fch33-advantagekit-autologging\u002F1-coming-soon","AdvantageKit — AutoLogging — Coming Soon","shockwave-curriculum\u002Flessons\u002Fch33-advantagekit-autologging\u002F33.1-coming-soon",{"path":345,"title":346,"stem":347},"\u002Fshockwave-curriculum\u002Flessons\u002Fch34-log-replay\u002F1-coming-soon","Log Replay — Coming Soon","shockwave-curriculum\u002Flessons\u002Fch34-log-replay\u002F34.1-coming-soon",{"path":349,"title":350,"stem":351},"\u002Fshockwave-curriculum\u002Flessons\u002Fch35-advantagescope-i-visualization\u002F1-coming-soon","AdvantageScope I: Visualization — Coming Soon","shockwave-curriculum\u002Flessons\u002Fch35-advantagescope-i-visualization\u002F35.1-coming-soon",{"path":353,"title":354,"stem":355},"\u002Fshockwave-curriculum\u002Flessons\u002Fch36-advantagescope-ii-custom-3d-assets\u002F1-coming-soon","AdvantageScope II: Custom 3D Assets — Coming Soon","shockwave-curriculum\u002Flessons\u002Fch36-advantagescope-ii-custom-3d-assets\u002F36.1-coming-soon",{"path":357,"title":358,"stem":359},"\u002Fshockwave-curriculum\u002Flessons\u002Fch37-autonomous-i\u002F1-coming-soon","Autonomous I — Coming Soon","shockwave-curriculum\u002Flessons\u002Fch37-autonomous-i\u002F37.1-coming-soon",{"path":361,"title":362,"stem":363},"\u002Fshockwave-curriculum\u002Flessons\u002Fch38-autonomous-ii-pathplanner-and-trajectories\u002F1-coming-soon","Autonomous II: PathPlanner & Trajectories — Coming Soon","shockwave-curriculum\u002Flessons\u002Fch38-autonomous-ii-pathplanner-and-trajectories\u002F38.1-coming-soon",{"path":365,"title":366,"stem":367},"\u002Fshockwave-curriculum\u002Flessons\u002Fch39-control-fundamentals\u002F1-coming-soon","Control Fundamentals — Coming Soon","shockwave-curriculum\u002Flessons\u002Fch39-control-fundamentals\u002F39.1-coming-soon",{"path":369,"title":370,"stem":371},"\u002Fshockwave-curriculum\u002Flessons\u002Fch40-motion-profiles\u002F1-coming-soon","Motion Profiles — Coming Soon","shockwave-curriculum\u002Flessons\u002Fch40-motion-profiles\u002F40.1-coming-soon",{"path":373,"title":374,"stem":375},"\u002Fshockwave-curriculum\u002Flessons\u002Fch41-hardware-fundamentals\u002F1-coming-soon","Hardware Fundamentals — Coming Soon","shockwave-curriculum\u002Flessons\u002Fch41-hardware-fundamentals\u002F41.1-coming-soon",{"path":377,"title":378,"stem":379},"\u002Fshockwave-curriculum\u002Flessons\u002Fch42-photonvision\u002F1-coming-soon","PhotonVision — Coming Soon","shockwave-curriculum\u002Flessons\u002Fch42-photonvision\u002F42.1-coming-soon",{"path":381,"title":382,"stem":383},"\u002Fshockwave-curriculum\u002Flessons\u002Fch43-apriltags-and-pose\u002F1-coming-soon","AprilTags & Pose — Coming Soon","shockwave-curriculum\u002Flessons\u002Fch43-apriltags-and-pose\u002F43.1-coming-soon",{"path":385,"title":386,"stem":387},"\u002Fshockwave-curriculum\u002Flessons\u002Fch44-subsystems-i\u002F1-coming-soon","Subsystems I — Coming Soon","shockwave-curriculum\u002Flessons\u002Fch44-subsystems-i\u002F44.1-coming-soon",{"path":389,"title":390,"stem":391},"\u002Fshockwave-curriculum\u002Flessons\u002Fch45-subsystems-ii-advanced\u002F1-coming-soon","Subsystems II — Advanced — Coming Soon","shockwave-curriculum\u002Flessons\u002Fch45-subsystems-ii-advanced\u002F45.1-coming-soon",{"path":393,"title":394,"stem":395},"\u002Fshockwave-curriculum\u002Flessons\u002Fch46-team-utilities-i\u002F1-coming-soon","Team Utilities I — Coming Soon","shockwave-curriculum\u002Flessons\u002Fch46-team-utilities-i\u002F46.1-coming-soon",{"path":397,"title":398,"stem":399},"\u002Fshockwave-curriculum\u002Flessons\u002Fch47-field-constants\u002F1-coming-soon","Field Constants — Coming Soon","shockwave-curriculum\u002Flessons\u002Fch47-field-constants\u002F47.1-coming-soon",{"path":401,"title":402,"stem":403},"\u002Fshockwave-curriculum\u002Flessons\u002Fch48-troubleshooting-i-runtime-debug\u002F1-coming-soon","Troubleshooting I — Runtime Debug — Coming Soon","shockwave-curriculum\u002Flessons\u002Fch48-troubleshooting-i-runtime-debug\u002F48.1-coming-soon",{"path":405,"title":406,"stem":407},"\u002Fshockwave-curriculum\u002Flessons\u002Fch49-troubleshooting-ii-can-and-sim\u002F1-coming-soon","Troubleshooting II: CAN & Sim — Coming Soon","shockwave-curriculum\u002Flessons\u002Fch49-troubleshooting-ii-can-and-sim\u002F49.1-coming-soon",{"path":409,"title":410,"stem":411},"\u002Fshockwave-curriculum\u002Flessons\u002Fch50-vendor-libraries-talonfx\u002F1-coming-soon","Vendor Libraries: TalonFX — Coming Soon","shockwave-curriculum\u002Flessons\u002Fch50-vendor-libraries-talonfx\u002F50.1-coming-soon",{"path":413,"title":414,"stem":415},"\u002Fshockwave-curriculum\u002Flessons\u002Fch51-robot-alerts\u002F1-coming-soon","Robot Alerts — Coming Soon","shockwave-curriculum\u002Flessons\u002Fch51-robot-alerts\u002F51.1-coming-soon",{"path":417,"title":418,"stem":419},"\u002Fshockwave-curriculum\u002Flessons\u002Fch52-wpilib-commands\u002F1-coming-soon","WPILib Commands — Coming Soon","shockwave-curriculum\u002Flessons\u002Fch52-wpilib-commands\u002F52.1-coming-soon",{"path":421,"title":422,"stem":423},"\u002Fshockwave-curriculum\u002Flessons\u002Fch53-wpilib-geometry\u002F1-coming-soon","WPILib Geometry — Coming Soon","shockwave-curriculum\u002Flessons\u002Fch53-wpilib-geometry\u002F53.1-coming-soon",{"path":425,"title":426,"stem":427},"\u002Fshockwave-curriculum\u002Flessons\u002Fch54-networktables\u002F1-coming-soon","NetworkTables — Coming Soon","shockwave-curriculum\u002Flessons\u002Fch54-networktables\u002F54.1-coming-soon",{"path":429,"title":430,"stem":431},"\u002Fshockwave-curriculum\u002Flessons\u002Fch55-command-scheduler\u002F1-coming-soon","Command Scheduler — Coming Soon","shockwave-curriculum\u002Flessons\u002Fch55-command-scheduler\u002F55.1-coming-soon",{"path":433,"title":434,"stem":435},"\u002Fshockwave-curriculum\u002Flessons\u002Fch56-wpilib-timers\u002F1-coming-soon","WPILib Timers — Coming Soon","shockwave-curriculum\u002Flessons\u002Fch56-wpilib-timers\u002F56.1-coming-soon",{"path":437,"title":438,"stem":439},"\u002Fshockwave-curriculum\u002Flessons\u002Fch57-wpilib-triggers\u002F1-coming-soon","WPILib Triggers — Coming Soon","shockwave-curriculum\u002Flessons\u002Fch57-wpilib-triggers\u002F57.1-coming-soon",{"path":441,"title":442,"stem":443},"\u002Fshockwave-curriculum\u002Flessons\u002Fch58-vendor-units-and-conversions\u002F1-coming-soon","Vendor Units & Conversions — Coming Soon","shockwave-curriculum\u002Flessons\u002Fch58-vendor-units-and-conversions\u002F58.1-coming-soon",[445,449,453,457,461,465,469,473,477,481,485,489,493,497,501,505,509,513,517,521,525,529,533,537,541,545,549,553,557,561,565,569,573,577,581,585,589,593,597,601,605,609,613,617,621,625,629,633,637,641,645,649,653,657,661,665,669,673,677,681,685,689,693,697,701,705,709,713,717,721,725,729,733,737,741,745,749],{"path":446,"title":447,"stem":448},"\u002Fshockwave-curriculum\u002Fexamples\u002Fch01-why-java-for-frc\u002F2-intro-to-algorithms-programming-and-compilers","Intro to Algorithms, Programming and Compilers — Worked Example","shockwave-curriculum\u002Fexamples\u002Fch01-why-java-for-frc\u002F1.2-intro-to-algorithms-programming-and-compilers",{"path":450,"title":451,"stem":452},"\u002Fshockwave-curriculum\u002Fexamples\u002Fch02-variables-and-types\u002F1-variables-and-data-types","Variables & Data Types — Worked Example","shockwave-curriculum\u002Fexamples\u002Fch02-variables-and-types\u002F2.1-variables-and-data-types",{"path":454,"title":455,"stem":456},"\u002Fshockwave-curriculum\u002Fexamples\u002Fch02-variables-and-types\u002F2-expressions-and-output","Expressions & Output — Worked Example","shockwave-curriculum\u002Fexamples\u002Fch02-variables-and-types\u002F2.2-expressions-and-output",{"path":458,"title":459,"stem":460},"\u002Fshockwave-curriculum\u002Fexamples\u002Fch02-variables-and-types\u002F3-assignment-and-input","Assignment & Input — Worked Example","shockwave-curriculum\u002Fexamples\u002Fch02-variables-and-types\u002F2.3-assignment-and-input",{"path":462,"title":463,"stem":464},"\u002Fshockwave-curriculum\u002Fexamples\u002Fch02-variables-and-types\u002F4-casting-and-ranges-of-values","Casting & Ranges of Values — Worked Example","shockwave-curriculum\u002Fexamples\u002Fch02-variables-and-types\u002F2.4-casting-and-ranges-of-values",{"path":466,"title":467,"stem":468},"\u002Fshockwave-curriculum\u002Fexamples\u002Fch02-variables-and-types\u002F5-compound-assignment-operators","Compound Assignment Operators — Worked Example","shockwave-curriculum\u002Fexamples\u002Fch02-variables-and-types\u002F2.5-compound-assignment-operators",{"path":470,"title":471,"stem":472},"\u002Fshockwave-curriculum\u002Fexamples\u002Fch03-apis-libraries-and-documentation\u002F1-apis-and-libraries","APIs and Libraries — Worked Example","shockwave-curriculum\u002Fexamples\u002Fch03-apis-libraries-and-documentation\u002F3.1-apis-and-libraries",{"path":474,"title":475,"stem":476},"\u002Fshockwave-curriculum\u002Fexamples\u002Fch03-apis-libraries-and-documentation\u002F2-documentation-with-comments-and-preconditions","Documentation with Comments and Preconditions — Worked Example","shockwave-curriculum\u002Fexamples\u002Fch03-apis-libraries-and-documentation\u002F3.2-documentation-with-comments-and-preconditions",{"path":478,"title":479,"stem":480},"\u002Fshockwave-curriculum\u002Fexamples\u002Fch03-apis-libraries-and-documentation\u002F3-packages-and-imports","Packages & Imports — Worked Example","shockwave-curriculum\u002Fexamples\u002Fch03-apis-libraries-and-documentation\u002F3.3-packages-and-imports",{"path":482,"title":483,"stem":484},"\u002Fshockwave-curriculum\u002Fexamples\u002Fch04-using-objects-and-calling-methods\u002F1-methods-signatures-and-parameters","Methods, Signatures & Parameters — Worked Example","shockwave-curriculum\u002Fexamples\u002Fch04-using-objects-and-calling-methods\u002F4.1-methods-signatures-and-parameters",{"path":486,"title":487,"stem":488},"\u002Fshockwave-curriculum\u002Fexamples\u002Fch04-using-objects-and-calling-methods\u002F2-calling-class-methods","Calling Class Methods — Worked Example","shockwave-curriculum\u002Fexamples\u002Fch04-using-objects-and-calling-methods\u002F4.2-calling-class-methods",{"path":490,"title":491,"stem":492},"\u002Fshockwave-curriculum\u002Fexamples\u002Fch04-using-objects-and-calling-methods\u002F3-using-the-math-class","Using the Math Class — Worked Example","shockwave-curriculum\u002Fexamples\u002Fch04-using-objects-and-calling-methods\u002F4.3-using-the-math-class",{"path":494,"title":495,"stem":496},"\u002Fshockwave-curriculum\u002Fexamples\u002Fch04-using-objects-and-calling-methods\u002F4-objects-instances-of-classes","Objects — Instances of Classes — Worked Example","shockwave-curriculum\u002Fexamples\u002Fch04-using-objects-and-calling-methods\u002F4.4-objects-instances-of-classes",{"path":498,"title":499,"stem":500},"\u002Fshockwave-curriculum\u002Fexamples\u002Fch04-using-objects-and-calling-methods\u002F5-creating-and-initializing-objects-constructors","Creating & Initializing Objects: Constructors — Worked Example","shockwave-curriculum\u002Fexamples\u002Fch04-using-objects-and-calling-methods\u002F4.5-creating-and-initializing-objects-constructors",{"path":502,"title":503,"stem":504},"\u002Fshockwave-curriculum\u002Fexamples\u002Fch04-using-objects-and-calling-methods\u002F6-calling-instance-methods","Calling Instance Methods — Worked Example","shockwave-curriculum\u002Fexamples\u002Fch04-using-objects-and-calling-methods\u002F4.6-calling-instance-methods",{"path":506,"title":507,"stem":508},"\u002Fshockwave-curriculum\u002Fexamples\u002Fch05-control-structures\u002F1-5.2-if-statements-and-for-loops","if Statements & For Loops — Worked Example","shockwave-curriculum\u002Fexamples\u002Fch05-control-structures\u002F5.1-5.2-if-statements-and-for-loops",{"path":510,"title":511,"stem":512},"\u002Fshockwave-curriculum\u002Fexamples\u002Fch05-control-structures\u002F10-nested-iteration","Nested Iteration — Worked Example","shockwave-curriculum\u002Fexamples\u002Fch05-control-structures\u002F5.10-nested-iteration",{"path":514,"title":515,"stem":516},"\u002Fshockwave-curriculum\u002Fexamples\u002Fch05-control-structures\u002F11-informal-runtime-analysis-of-loops","Informal Runtime Analysis of Loops — Worked Example","shockwave-curriculum\u002Fexamples\u002Fch05-control-structures\u002F5.11-informal-runtime-analysis-of-loops",{"path":518,"title":519,"stem":520},"\u002Fshockwave-curriculum\u002Fexamples\u002Fch05-control-structures\u002F12-switch-statements-and-expressions","switch Statements and Expressions — Worked Example","shockwave-curriculum\u002Fexamples\u002Fch05-control-structures\u002F5.12-switch-statements-and-expressions",{"path":522,"title":523,"stem":524},"\u002Fshockwave-curriculum\u002Fexamples\u002Fch05-control-structures\u002F3-algorithms-with-selection-and-repetition","Algorithms with Selection and Repetition — Worked Example","shockwave-curriculum\u002Fexamples\u002Fch05-control-structures\u002F5.3-algorithms-with-selection-and-repetition",{"path":526,"title":527,"stem":528},"\u002Fshockwave-curriculum\u002Fexamples\u002Fch05-control-structures\u002F4-boolean-expressions","Boolean Expressions — Worked Example","shockwave-curriculum\u002Fexamples\u002Fch05-control-structures\u002F5.4-boolean-expressions",{"path":530,"title":531,"stem":532},"\u002Fshockwave-curriculum\u002Fexamples\u002Fch05-control-structures\u002F5-nested-if-statements","Nested if Statements — Worked Example","shockwave-curriculum\u002Fexamples\u002Fch05-control-structures\u002F5.5-nested-if-statements",{"path":534,"title":535,"stem":536},"\u002Fshockwave-curriculum\u002Fexamples\u002Fch05-control-structures\u002F6-compound-boolean-expressions","Compound Boolean Expressions — Worked Example","shockwave-curriculum\u002Fexamples\u002Fch05-control-structures\u002F5.6-compound-boolean-expressions",{"path":538,"title":539,"stem":540},"\u002Fshockwave-curriculum\u002Fexamples\u002Fch05-control-structures\u002F7-comparing-boolean-expressions-de-morgans-laws","Comparing Boolean Expressions (De Morgan's Laws) — Worked Example","shockwave-curriculum\u002Fexamples\u002Fch05-control-structures\u002F5.7-comparing-boolean-expressions-de-morgans-laws",{"path":542,"title":543,"stem":544},"\u002Fshockwave-curriculum\u002Fexamples\u002Fch05-control-structures\u002F8-while-loops","While Loops — Worked Example","shockwave-curriculum\u002Fexamples\u002Fch05-control-structures\u002F5.8-while-loops",{"path":546,"title":547,"stem":548},"\u002Fshockwave-curriculum\u002Fexamples\u002Fch05-control-structures\u002F9-implementing-selection-and-iteration-algorithms","Implementing Selection and Iteration Algorithms — Worked Example","shockwave-curriculum\u002Fexamples\u002Fch05-control-structures\u002F5.9-implementing-selection-and-iteration-algorithms",{"path":550,"title":551,"stem":552},"\u002Fshockwave-curriculum\u002Fexamples\u002Fch06-strings\u002F1-strings","Strings — Worked Example","shockwave-curriculum\u002Fexamples\u002Fch06-strings\u002F6.1-strings",{"path":554,"title":555,"stem":556},"\u002Fshockwave-curriculum\u002Fexamples\u002Fch06-strings\u002F2-string-algorithms","String Algorithms — Worked Example","shockwave-curriculum\u002Fexamples\u002Fch06-strings\u002F6.2-string-algorithms",{"path":558,"title":559,"stem":560},"\u002Fshockwave-curriculum\u002Fexamples\u002Fch07-the-class-blueprint\u002F1-anatomy-of-a-java-class","Anatomy of a Java Class — Worked Example","shockwave-curriculum\u002Fexamples\u002Fch07-the-class-blueprint\u002F7.1-anatomy-of-a-java-class",{"path":562,"title":563,"stem":564},"\u002Fshockwave-curriculum\u002Fexamples\u002Fch07-the-class-blueprint\u002F2-methods-how-to-write-them","Methods: How to Write Them — Worked Example","shockwave-curriculum\u002Fexamples\u002Fch07-the-class-blueprint\u002F7.2-methods-how-to-write-them",{"path":566,"title":567,"stem":568},"\u002Fshockwave-curriculum\u002Fexamples\u002Fch07-the-class-blueprint\u002F3-methods-passing-and-returning-references-of-an-object","Methods: Passing & Returning References of an Object — Worked Example","shockwave-curriculum\u002Fexamples\u002Fch07-the-class-blueprint\u002F7.3-methods-passing-and-returning-references-of-an-object",{"path":570,"title":571,"stem":572},"\u002Fshockwave-curriculum\u002Fexamples\u002Fch07-the-class-blueprint\u002F4-class-static-variables-and-methods","Class (static) Variables & Methods — Worked Example","shockwave-curriculum\u002Fexamples\u002Fch07-the-class-blueprint\u002F7.4-class-static-variables-and-methods",{"path":574,"title":575,"stem":576},"\u002Fshockwave-curriculum\u002Fexamples\u002Fch08-constructors-and-this\u002F1-8.2-constructors-and-this","Constructors & \"this\" — Worked Example","shockwave-curriculum\u002Fexamples\u002Fch08-constructors-and-this\u002F8.1-8.2-constructors-and-this",{"path":578,"title":579,"stem":580},"\u002Fshockwave-curriculum\u002Fexamples\u002Fch09-storing-data\u002F1-array-creation-and-access","Array Creation and Access — Worked Example","shockwave-curriculum\u002Fexamples\u002Fch09-storing-data\u002F9.1-array-creation-and-access",{"path":582,"title":583,"stem":584},"\u002Fshockwave-curriculum\u002Fexamples\u002Fch09-storing-data\u002F2-arraylist-and-its-methods","ArrayList and its Methods — Worked Example","shockwave-curriculum\u002Fexamples\u002Fch09-storing-data\u002F9.2-arraylist-and-its-methods",{"path":586,"title":587,"stem":588},"\u002Fshockwave-curriculum\u002Fexamples\u002Fch09-storing-data\u002F3-optional-hashmap-dictionary-data-structure","HashMap (Dictionary) Data Structure — Worked Example","shockwave-curriculum\u002Fexamples\u002Fch09-storing-data\u002F9.3-optional-hashmap-dictionary-data-structure",{"path":590,"title":591,"stem":592},"\u002Fshockwave-curriculum\u002Fexamples\u002Fch09-storing-data\u002F4-array-traversals","Array Traversals — Worked Example","shockwave-curriculum\u002Fexamples\u002Fch09-storing-data\u002F9.4-array-traversals",{"path":594,"title":595,"stem":596},"\u002Fshockwave-curriculum\u002Fexamples\u002Fch09-storing-data\u002F5-implementing-array-algorithms","Implementing Array Algorithms — Worked Example","shockwave-curriculum\u002Fexamples\u002Fch09-storing-data\u002F9.5-implementing-array-algorithms",{"path":598,"title":599,"stem":600},"\u002Fshockwave-curriculum\u002Fexamples\u002Fch09-storing-data\u002F6-arraylist-traversals","ArrayList Traversals — Worked Example","shockwave-curriculum\u002Fexamples\u002Fch09-storing-data\u002F9.6-arraylist-traversals",{"path":602,"title":603,"stem":604},"\u002Fshockwave-curriculum\u002Fexamples\u002Fch09-storing-data\u002F7-implementing-arraylist-algorithms","Implementing ArrayList Algorithms — Worked Example","shockwave-curriculum\u002Fexamples\u002Fch09-storing-data\u002F9.7-implementing-arraylist-algorithms",{"path":606,"title":607,"stem":608},"\u002Fshockwave-curriculum\u002Fexamples\u002Fch09-storing-data\u002F8-using-text-files","Using Text Files — Worked Example","shockwave-curriculum\u002Fexamples\u002Fch09-storing-data\u002F9.8-using-text-files",{"path":610,"title":611,"stem":612},"\u002Fshockwave-curriculum\u002Fexamples\u002Fch10-2d-arrays\u002F1-2d-array-creation-and-access","2D Array Creation and Access — Worked Example","shockwave-curriculum\u002Fexamples\u002Fch10-2d-arrays\u002F10.1-2d-array-creation-and-access",{"path":614,"title":615,"stem":616},"\u002Fshockwave-curriculum\u002Fexamples\u002Fch10-2d-arrays\u002F2-2d-array-traversals-nested-loops","2D Array Traversals: Nested Loops — Worked Example","shockwave-curriculum\u002Fexamples\u002Fch10-2d-arrays\u002F10.2-2d-array-traversals-nested-loops",{"path":618,"title":619,"stem":620},"\u002Fshockwave-curriculum\u002Fexamples\u002Fch10-2d-arrays\u002F3-implementing-2d-array-algorithms","Implementing 2D Array Algorithms — Worked Example","shockwave-curriculum\u002Fexamples\u002Fch10-2d-arrays\u002F10.3-implementing-2d-array-algorithms",{"path":622,"title":623,"stem":624},"\u002Fshockwave-curriculum\u002Fexamples\u002Fch11-enums-named-choices\u002F11-enums-named-choices","Enums: Named Choices — Worked Example","shockwave-curriculum\u002Fexamples\u002Fch11-enums-named-choices\u002F11-enums-named-choices",{"path":626,"title":627,"stem":628},"\u002Fshockwave-curriculum\u002Fexamples\u002Fch12-exceptions-and-try-catch\u002F12-exceptions-and-try-catch","Exceptions & try\u002Fcatch — Worked Example","shockwave-curriculum\u002Fexamples\u002Fch12-exceptions-and-try-catch\u002F12-exceptions-and-try-catch",{"path":630,"title":631,"stem":632},"\u002Fshockwave-curriculum\u002Fexamples\u002Fch13-common-gotchas\u002F13-common-gotchas","Common Gotchas — Worked Example","shockwave-curriculum\u002Fexamples\u002Fch13-common-gotchas\u002F13-common-gotchas",{"path":634,"title":635,"stem":636},"\u002Fshockwave-curriculum\u002Fexamples\u002Fch15-advanced-collections\u002F15-advanced-collections","Advanced Collections (Set\u002FQueue\u002FMap) — Worked Example","shockwave-curriculum\u002Fexamples\u002Fch15-advanced-collections\u002F15-advanced-collections",{"path":638,"title":639,"stem":640},"\u002Fshockwave-curriculum\u002Fexamples\u002Fch16-writing-your-own-generics\u002F16-writing-your-own-generics","Writing Your Own Generics — Worked Example","shockwave-curriculum\u002Fexamples\u002Fch16-writing-your-own-generics\u002F16-writing-your-own-generics",{"path":642,"title":643,"stem":644},"\u002Fshockwave-curriculum\u002Fexamples\u002Fch17-inheritance-and-abstractions\u002F1-inheritance-superclass-subclass","Inheritance, Superclass, Subclass — Worked Example","shockwave-curriculum\u002Fexamples\u002Fch17-inheritance-and-abstractions\u002F17.1-inheritance-superclass-subclass",{"path":646,"title":647,"stem":648},"\u002Fshockwave-curriculum\u002Fexamples\u002Fch17-inheritance-and-abstractions\u002F2-inheritance-and-constructors","Inheritance and Constructors — Worked Example","shockwave-curriculum\u002Fexamples\u002Fch17-inheritance-and-abstractions\u002F17.2-inheritance-and-constructors",{"path":650,"title":651,"stem":652},"\u002Fshockwave-curriculum\u002Fexamples\u002Fch17-inheritance-and-abstractions\u002F3-inheritance-hierarchies","Inheritance Hierarchies — Worked Example","shockwave-curriculum\u002Fexamples\u002Fch17-inheritance-and-abstractions\u002F17.3-inheritance-hierarchies",{"path":654,"title":655,"stem":656},"\u002Fshockwave-curriculum\u002Fexamples\u002Fch17-inheritance-and-abstractions\u002F4-object-superclass","Object Superclass — Worked Example","shockwave-curriculum\u002Fexamples\u002Fch17-inheritance-and-abstractions\u002F17.4-object-superclass",{"path":658,"title":659,"stem":660},"\u002Fshockwave-curriculum\u002Fexamples\u002Fch17-inheritance-and-abstractions\u002F5-abstract-classes-and-methods","Abstract Classes and Methods — Worked Example","shockwave-curriculum\u002Fexamples\u002Fch17-inheritance-and-abstractions\u002F17.5-abstract-classes-and-methods",{"path":662,"title":663,"stem":664},"\u002Fshockwave-curriculum\u002Fexamples\u002Fch18-polymorphism-many-forms\u002F1-overriding-methods","Overriding Methods — Worked Example","shockwave-curriculum\u002Fexamples\u002Fch18-polymorphism-many-forms\u002F18.1-overriding-methods",{"path":666,"title":667,"stem":668},"\u002Fshockwave-curriculum\u002Fexamples\u002Fch18-polymorphism-many-forms\u002F2-super-keyword","super Keyword — Worked Example","shockwave-curriculum\u002Fexamples\u002Fch18-polymorphism-many-forms\u002F18.2-super-keyword",{"path":670,"title":671,"stem":672},"\u002Fshockwave-curriculum\u002Fexamples\u002Fch18-polymorphism-many-forms\u002F3-polymorphism","Polymorphism — Worked Example","shockwave-curriculum\u002Fexamples\u002Fch18-polymorphism-many-forms\u002F18.3-polymorphism",{"path":674,"title":675,"stem":676},"\u002Fshockwave-curriculum\u002Fexamples\u002Fch19-interfaces-as-contracts\u002F19-interfaces-as-contracts","Interfaces as Contracts — Worked Example","shockwave-curriculum\u002Fexamples\u002Fch19-interfaces-as-contracts\u002F19-interfaces-as-contracts",{"path":678,"title":679,"stem":680},"\u002Fshockwave-curriculum\u002Fexamples\u002Fch19-interfaces-as-contracts\u002F1-lambdas-and-method-references","Lambdas & Method References — Worked Example","shockwave-curriculum\u002Fexamples\u002Fch19-interfaces-as-contracts\u002F19.1-lambdas-and-method-references",{"path":682,"title":683,"stem":684},"\u002Fshockwave-curriculum\u002Fexamples\u002Fch20-the-io-layer-pattern\u002F20-the-io-layer-pattern","The IO-Layer Pattern — Worked Example","shockwave-curriculum\u002Fexamples\u002Fch20-the-io-layer-pattern\u002F20-the-io-layer-pattern",{"path":686,"title":687,"stem":688},"\u002Fshockwave-curriculum\u002Fexamples\u002Fch21-static-factories\u002F21-static-factories","Static Factories — Worked Example","shockwave-curriculum\u002Fexamples\u002Fch21-static-factories\u002F21-static-factories",{"path":690,"title":691,"stem":692},"\u002Fshockwave-curriculum\u002Fexamples\u002Fch22-the-builder-pattern\u002F22-the-builder-pattern","The Builder Pattern — Worked Example","shockwave-curriculum\u002Fexamples\u002Fch22-the-builder-pattern\u002F22-the-builder-pattern",{"path":694,"title":695,"stem":696},"\u002Fshockwave-curriculum\u002Fexamples\u002Fch23-encapsulation-and-final\u002F1-scope-and-access","Access, final, and Immutability — Worked Example","shockwave-curriculum\u002Fexamples\u002Fch23-encapsulation-and-final\u002F23.1-scope-and-access",{"path":698,"title":699,"stem":700},"\u002Fshockwave-curriculum\u002Fexamples\u002Fch24-optional-avoiding-null-pointer-exceptions\u002F24-optional-avoiding-null-pointer-exceptions","Optional: Avoiding Null Pointer Exceptions — Worked Example","shockwave-curriculum\u002Fexamples\u002Fch24-optional-avoiding-null-pointer-exceptions\u002F24-optional-avoiding-null-pointer-exceptions",{"path":702,"title":703,"stem":704},"\u002Fshockwave-curriculum\u002Fexamples\u002Fch25-command-based-programming\u002F1-what-is-command-based-programming","What Is Command-Based Programming? — Worked Example","shockwave-curriculum\u002Fexamples\u002Fch25-command-based-programming\u002F25.1-what-is-command-based-programming",{"path":706,"title":707,"stem":708},"\u002Fshockwave-curriculum\u002Fexamples\u002Fch25-command-based-programming\u002F2-commands-and-command-compositions","Commands & Command Compositions — Worked Example","shockwave-curriculum\u002Fexamples\u002Fch25-command-based-programming\u002F25.2-commands-and-command-compositions",{"path":710,"title":711,"stem":712},"\u002Fshockwave-curriculum\u002Fexamples\u002Fch25-command-based-programming\u002F3-the-command-scheduler","The Command Scheduler — Worked Example","shockwave-curriculum\u002Fexamples\u002Fch25-command-based-programming\u002F25.3-the-command-scheduler",{"path":714,"title":715,"stem":716},"\u002Fshockwave-curriculum\u002Fexamples\u002Fch25-command-based-programming\u002F4-state-machines-logic","State Machines: Logic — Worked Example","shockwave-curriculum\u002Fexamples\u002Fch25-command-based-programming\u002F25.4-state-machines-logic",{"path":718,"title":719,"stem":720},"\u002Fshockwave-curriculum\u002Fexamples\u002Fch25-command-based-programming\u002F5-managing-transitions","Managing Transitions — Worked Example","shockwave-curriculum\u002Fexamples\u002Fch25-command-based-programming\u002F25.5-managing-transitions",{"path":722,"title":723,"stem":724},"\u002Fshockwave-curriculum\u002Fexamples\u002Fch25-command-based-programming\u002F6-binding-commands-to-triggers","Binding Commands to Triggers — Worked Example","shockwave-curriculum\u002Fexamples\u002Fch25-command-based-programming\u002F25.6-binding-commands-to-triggers",{"path":726,"title":727,"stem":728},"\u002Fshockwave-curriculum\u002Fexamples\u002Fch25-command-based-programming\u002F7-structuring-a-command-based-robot-project","Structuring a Command-Based Robot Project — Worked Example","shockwave-curriculum\u002Fexamples\u002Fch25-command-based-programming\u002F25.7-structuring-a-command-based-robot-project",{"path":730,"title":731,"stem":732},"\u002Fshockwave-curriculum\u002Fexamples\u002Fch26-architecture-takeaways\u002F26-architecture-takeaways","Architecture Takeaways — Worked Example","shockwave-curriculum\u002Fexamples\u002Fch26-architecture-takeaways\u002F26-architecture-takeaways",{"path":734,"title":735,"stem":736},"\u002Fshockwave-curriculum\u002Fexamples\u002Fch27-program-design-and-abstraction\u002F1-abstraction-and-program-design","Abstraction and Program Design — Worked Example","shockwave-curriculum\u002Fexamples\u002Fch27-program-design-and-abstraction\u002F27.1-abstraction-and-program-design",{"path":738,"title":739,"stem":740},"\u002Fshockwave-curriculum\u002Fexamples\u002Fch28-algorithms-searching-sorting-recursion\u002F1-searching-algorithms","Searching Algorithms — Worked Example","shockwave-curriculum\u002Fexamples\u002Fch28-algorithms-searching-sorting-recursion\u002F28.1-searching-algorithms",{"path":742,"title":743,"stem":744},"\u002Fshockwave-curriculum\u002Fexamples\u002Fch28-algorithms-searching-sorting-recursion\u002F2-sorting-algorithms","Sorting Algorithms — Worked Example","shockwave-curriculum\u002Fexamples\u002Fch28-algorithms-searching-sorting-recursion\u002F28.2-sorting-algorithms",{"path":746,"title":747,"stem":748},"\u002Fshockwave-curriculum\u002Fexamples\u002Fch28-algorithms-searching-sorting-recursion\u002F3-recursion","Recursion — Worked Example","shockwave-curriculum\u002Fexamples\u002Fch28-algorithms-searching-sorting-recursion\u002F28.3-recursion",{"path":750,"title":751,"stem":752},"\u002Fshockwave-curriculum\u002Fexamples\u002Fch28-algorithms-searching-sorting-recursion\u002F4-recursive-searching-and-sorting","Recursive Searching and Sorting — Worked Example","shockwave-curriculum\u002Fexamples\u002Fch28-algorithms-searching-sorting-recursion\u002F28.4-recursive-searching-and-sorting",[754,758,762,766,770,774,778,782,786,790,794,798,802,806,810,814,818,822,826,830,834,838,842,846,850,854,858,862,866,870,874,878,882,886,890,894,898,902,906,910,914,918,922,926,930,934,938,942,946,950,954,958,962,966,970,974,978,982,986,990,994,998,1002,1006,1010,1014,1018,1022,1026,1030,1034,1038,1042,1046,1050,1054,1058,1062,1066],{"path":755,"title":756,"stem":757},"\u002Fshockwave-curriculum\u002Fexercises\u002Fch01-why-java-for-frc\u002F2-intro-to-algorithms-programming-and-compilers","Intro to Algorithms, Programming and Compilers — Exercises","shockwave-curriculum\u002Fexercises\u002Fch01-why-java-for-frc\u002F1.2-intro-to-algorithms-programming-and-compilers",{"path":759,"title":760,"stem":761},"\u002Fshockwave-curriculum\u002Fexercises\u002Fch02-variables-and-types\u002F1-variables-and-data-types","Variables & Data Types — Exercises","shockwave-curriculum\u002Fexercises\u002Fch02-variables-and-types\u002F2.1-variables-and-data-types",{"path":763,"title":764,"stem":765},"\u002Fshockwave-curriculum\u002Fexercises\u002Fch02-variables-and-types\u002F2-expressions-and-output","Expressions & Output — Exercises","shockwave-curriculum\u002Fexercises\u002Fch02-variables-and-types\u002F2.2-expressions-and-output",{"path":767,"title":768,"stem":769},"\u002Fshockwave-curriculum\u002Fexercises\u002Fch02-variables-and-types\u002F3-assignment-and-input","Assignment & Input — Exercises","shockwave-curriculum\u002Fexercises\u002Fch02-variables-and-types\u002F2.3-assignment-and-input",{"path":771,"title":772,"stem":773},"\u002Fshockwave-curriculum\u002Fexercises\u002Fch02-variables-and-types\u002F4-casting-and-ranges-of-values","Casting & Ranges of Values — Exercises","shockwave-curriculum\u002Fexercises\u002Fch02-variables-and-types\u002F2.4-casting-and-ranges-of-values",{"path":775,"title":776,"stem":777},"\u002Fshockwave-curriculum\u002Fexercises\u002Fch02-variables-and-types\u002F5-compound-assignment-operators","Compound Assignment Operators — Exercises","shockwave-curriculum\u002Fexercises\u002Fch02-variables-and-types\u002F2.5-compound-assignment-operators",{"path":779,"title":780,"stem":781},"\u002Fshockwave-curriculum\u002Fexercises\u002Fch03-apis-libraries-and-documentation\u002F1-apis-and-libraries","APIs and Libraries — Exercises","shockwave-curriculum\u002Fexercises\u002Fch03-apis-libraries-and-documentation\u002F3.1-apis-and-libraries",{"path":783,"title":784,"stem":785},"\u002Fshockwave-curriculum\u002Fexercises\u002Fch03-apis-libraries-and-documentation\u002F2-documentation-with-comments-and-preconditions","Documentation with Comments and Preconditions — Exercises","shockwave-curriculum\u002Fexercises\u002Fch03-apis-libraries-and-documentation\u002F3.2-documentation-with-comments-and-preconditions",{"path":787,"title":788,"stem":789},"\u002Fshockwave-curriculum\u002Fexercises\u002Fch03-apis-libraries-and-documentation\u002F3-packages-and-imports","Packages & Imports — Exercises","shockwave-curriculum\u002Fexercises\u002Fch03-apis-libraries-and-documentation\u002F3.3-packages-and-imports",{"path":791,"title":792,"stem":793},"\u002Fshockwave-curriculum\u002Fexercises\u002Fch04-using-objects-and-calling-methods\u002F1-methods-signatures-and-parameters","Methods, Signatures & Parameters — Exercises","shockwave-curriculum\u002Fexercises\u002Fch04-using-objects-and-calling-methods\u002F4.1-methods-signatures-and-parameters",{"path":795,"title":796,"stem":797},"\u002Fshockwave-curriculum\u002Fexercises\u002Fch04-using-objects-and-calling-methods\u002F2-calling-class-methods","Calling Class Methods — Exercises","shockwave-curriculum\u002Fexercises\u002Fch04-using-objects-and-calling-methods\u002F4.2-calling-class-methods",{"path":799,"title":800,"stem":801},"\u002Fshockwave-curriculum\u002Fexercises\u002Fch04-using-objects-and-calling-methods\u002F3-using-the-math-class","Using the Math Class — Exercises","shockwave-curriculum\u002Fexercises\u002Fch04-using-objects-and-calling-methods\u002F4.3-using-the-math-class",{"path":803,"title":804,"stem":805},"\u002Fshockwave-curriculum\u002Fexercises\u002Fch04-using-objects-and-calling-methods\u002F4-objects-instances-of-classes","Objects — Instances of Classes — Exercises","shockwave-curriculum\u002Fexercises\u002Fch04-using-objects-and-calling-methods\u002F4.4-objects-instances-of-classes",{"path":807,"title":808,"stem":809},"\u002Fshockwave-curriculum\u002Fexercises\u002Fch04-using-objects-and-calling-methods\u002F5-creating-and-initializing-objects-constructors","Creating & Initializing Objects: Constructors — Exercises","shockwave-curriculum\u002Fexercises\u002Fch04-using-objects-and-calling-methods\u002F4.5-creating-and-initializing-objects-constructors",{"path":811,"title":812,"stem":813},"\u002Fshockwave-curriculum\u002Fexercises\u002Fch04-using-objects-and-calling-methods\u002F6-calling-instance-methods","Calling Instance Methods — Exercises","shockwave-curriculum\u002Fexercises\u002Fch04-using-objects-and-calling-methods\u002F4.6-calling-instance-methods",{"path":815,"title":816,"stem":817},"\u002Fshockwave-curriculum\u002Fexercises\u002Fch05-control-structures\u002F1-5.2-if-statements-and-for-loops","if Statements & For Loops — Exercises","shockwave-curriculum\u002Fexercises\u002Fch05-control-structures\u002F5.1-5.2-if-statements-and-for-loops",{"path":819,"title":820,"stem":821},"\u002Fshockwave-curriculum\u002Fexercises\u002Fch05-control-structures\u002F10-nested-iteration","Nested Iteration — Exercises","shockwave-curriculum\u002Fexercises\u002Fch05-control-structures\u002F5.10-nested-iteration",{"path":823,"title":824,"stem":825},"\u002Fshockwave-curriculum\u002Fexercises\u002Fch05-control-structures\u002F11-informal-runtime-analysis-of-loops","Informal Runtime Analysis of Loops — Exercises","shockwave-curriculum\u002Fexercises\u002Fch05-control-structures\u002F5.11-informal-runtime-analysis-of-loops",{"path":827,"title":828,"stem":829},"\u002Fshockwave-curriculum\u002Fexercises\u002Fch05-control-structures\u002F12-switch-statements-and-expressions","switch Statements and Expressions — Exercises","shockwave-curriculum\u002Fexercises\u002Fch05-control-structures\u002F5.12-switch-statements-and-expressions",{"path":831,"title":832,"stem":833},"\u002Fshockwave-curriculum\u002Fexercises\u002Fch05-control-structures\u002F3-algorithms-with-selection-and-repetition","Algorithms with Selection and Repetition — Exercises","shockwave-curriculum\u002Fexercises\u002Fch05-control-structures\u002F5.3-algorithms-with-selection-and-repetition",{"path":835,"title":836,"stem":837},"\u002Fshockwave-curriculum\u002Fexercises\u002Fch05-control-structures\u002F4-boolean-expressions","Boolean Expressions — Exercises","shockwave-curriculum\u002Fexercises\u002Fch05-control-structures\u002F5.4-boolean-expressions",{"path":839,"title":840,"stem":841},"\u002Fshockwave-curriculum\u002Fexercises\u002Fch05-control-structures\u002F5-nested-if-statements","Nested if Statements — Exercises","shockwave-curriculum\u002Fexercises\u002Fch05-control-structures\u002F5.5-nested-if-statements",{"path":843,"title":844,"stem":845},"\u002Fshockwave-curriculum\u002Fexercises\u002Fch05-control-structures\u002F6-compound-boolean-expressions","Compound Boolean Expressions — Exercises","shockwave-curriculum\u002Fexercises\u002Fch05-control-structures\u002F5.6-compound-boolean-expressions",{"path":847,"title":848,"stem":849},"\u002Fshockwave-curriculum\u002Fexercises\u002Fch05-control-structures\u002F7-comparing-boolean-expressions-de-morgans-laws","Comparing Boolean Expressions (De Morgan's Laws) — Exercises","shockwave-curriculum\u002Fexercises\u002Fch05-control-structures\u002F5.7-comparing-boolean-expressions-de-morgans-laws",{"path":851,"title":852,"stem":853},"\u002Fshockwave-curriculum\u002Fexercises\u002Fch05-control-structures\u002F8-while-loops","While Loops — Exercises","shockwave-curriculum\u002Fexercises\u002Fch05-control-structures\u002F5.8-while-loops",{"path":855,"title":856,"stem":857},"\u002Fshockwave-curriculum\u002Fexercises\u002Fch05-control-structures\u002F9-implementing-selection-and-iteration-algorithms","Implementing Selection and Iteration Algorithms — Exercises","shockwave-curriculum\u002Fexercises\u002Fch05-control-structures\u002F5.9-implementing-selection-and-iteration-algorithms",{"path":859,"title":860,"stem":861},"\u002Fshockwave-curriculum\u002Fexercises\u002Fch06-strings\u002F1-strings","Strings — Exercises","shockwave-curriculum\u002Fexercises\u002Fch06-strings\u002F6.1-strings",{"path":863,"title":864,"stem":865},"\u002Fshockwave-curriculum\u002Fexercises\u002Fch06-strings\u002F2-string-algorithms","String Algorithms — Exercises","shockwave-curriculum\u002Fexercises\u002Fch06-strings\u002F6.2-string-algorithms",{"path":867,"title":868,"stem":869},"\u002Fshockwave-curriculum\u002Fexercises\u002Fch07-the-class-blueprint\u002F1-anatomy-of-a-java-class","Anatomy of a Java Class — Exercises","shockwave-curriculum\u002Fexercises\u002Fch07-the-class-blueprint\u002F7.1-anatomy-of-a-java-class",{"path":871,"title":872,"stem":873},"\u002Fshockwave-curriculum\u002Fexercises\u002Fch07-the-class-blueprint\u002F2-methods-how-to-write-them","Methods: How to Write Them — Exercises","shockwave-curriculum\u002Fexercises\u002Fch07-the-class-blueprint\u002F7.2-methods-how-to-write-them",{"path":875,"title":876,"stem":877},"\u002Fshockwave-curriculum\u002Fexercises\u002Fch07-the-class-blueprint\u002F3-methods-passing-and-returning-references-of-an-object","Methods: Passing & Returning References of an Object — Exercises","shockwave-curriculum\u002Fexercises\u002Fch07-the-class-blueprint\u002F7.3-methods-passing-and-returning-references-of-an-object",{"path":879,"title":880,"stem":881},"\u002Fshockwave-curriculum\u002Fexercises\u002Fch07-the-class-blueprint\u002F4-class-static-variables-and-methods","Class (static) Variables & Methods — Exercises","shockwave-curriculum\u002Fexercises\u002Fch07-the-class-blueprint\u002F7.4-class-static-variables-and-methods",{"path":883,"title":884,"stem":885},"\u002Fshockwave-curriculum\u002Fexercises\u002Fch08-constructors-and-this\u002F1-8.2-constructors-and-this","Constructors & \"this\" — Exercises","shockwave-curriculum\u002Fexercises\u002Fch08-constructors-and-this\u002F8.1-8.2-constructors-and-this",{"path":887,"title":888,"stem":889},"\u002Fshockwave-curriculum\u002Fexercises\u002Fch09-storing-data\u002F1-array-creation-and-access","Array Creation and Access — Exercises","shockwave-curriculum\u002Fexercises\u002Fch09-storing-data\u002F9.1-array-creation-and-access",{"path":891,"title":892,"stem":893},"\u002Fshockwave-curriculum\u002Fexercises\u002Fch09-storing-data\u002F2-arraylist-and-its-methods","ArrayList and its Methods — Exercises","shockwave-curriculum\u002Fexercises\u002Fch09-storing-data\u002F9.2-arraylist-and-its-methods",{"path":895,"title":896,"stem":897},"\u002Fshockwave-curriculum\u002Fexercises\u002Fch09-storing-data\u002F3-optional-hashmap-dictionary-data-structure","HashMap (Dictionary) Data Structure — Exercises","shockwave-curriculum\u002Fexercises\u002Fch09-storing-data\u002F9.3-optional-hashmap-dictionary-data-structure",{"path":899,"title":900,"stem":901},"\u002Fshockwave-curriculum\u002Fexercises\u002Fch09-storing-data\u002F4-array-traversals","Array Traversals — Exercises","shockwave-curriculum\u002Fexercises\u002Fch09-storing-data\u002F9.4-array-traversals",{"path":903,"title":904,"stem":905},"\u002Fshockwave-curriculum\u002Fexercises\u002Fch09-storing-data\u002F5-implementing-array-algorithms","Implementing Array Algorithms — Exercises","shockwave-curriculum\u002Fexercises\u002Fch09-storing-data\u002F9.5-implementing-array-algorithms",{"path":907,"title":908,"stem":909},"\u002Fshockwave-curriculum\u002Fexercises\u002Fch09-storing-data\u002F6-arraylist-traversals","ArrayList Traversals — Exercises","shockwave-curriculum\u002Fexercises\u002Fch09-storing-data\u002F9.6-arraylist-traversals",{"path":911,"title":912,"stem":913},"\u002Fshockwave-curriculum\u002Fexercises\u002Fch09-storing-data\u002F7-implementing-arraylist-algorithms","Implementing ArrayList Algorithms — Exercises","shockwave-curriculum\u002Fexercises\u002Fch09-storing-data\u002F9.7-implementing-arraylist-algorithms",{"path":915,"title":916,"stem":917},"\u002Fshockwave-curriculum\u002Fexercises\u002Fch09-storing-data\u002F8-using-text-files","Using Text Files — Exercises","shockwave-curriculum\u002Fexercises\u002Fch09-storing-data\u002F9.8-using-text-files",{"path":919,"title":920,"stem":921},"\u002Fshockwave-curriculum\u002Fexercises\u002Fch10-2d-arrays\u002F1-2d-array-creation-and-access","2D Array Creation and Access — Exercises","shockwave-curriculum\u002Fexercises\u002Fch10-2d-arrays\u002F10.1-2d-array-creation-and-access",{"path":923,"title":924,"stem":925},"\u002Fshockwave-curriculum\u002Fexercises\u002Fch10-2d-arrays\u002F2-2d-array-traversals-nested-loops","2D Array Traversals: Nested Loops — Exercises","shockwave-curriculum\u002Fexercises\u002Fch10-2d-arrays\u002F10.2-2d-array-traversals-nested-loops",{"path":927,"title":928,"stem":929},"\u002Fshockwave-curriculum\u002Fexercises\u002Fch10-2d-arrays\u002F3-implementing-2d-array-algorithms","Implementing 2D Array Algorithms — Exercises","shockwave-curriculum\u002Fexercises\u002Fch10-2d-arrays\u002F10.3-implementing-2d-array-algorithms",{"path":931,"title":932,"stem":933},"\u002Fshockwave-curriculum\u002Fexercises\u002Fch11-enums-named-choices\u002F11-enums-named-choices","Enums: Named Choices — Exercises","shockwave-curriculum\u002Fexercises\u002Fch11-enums-named-choices\u002F11-enums-named-choices",{"path":935,"title":936,"stem":937},"\u002Fshockwave-curriculum\u002Fexercises\u002Fch12-exceptions-and-try-catch\u002F12-exceptions-and-try-catch","Exceptions & try\u002Fcatch — Exercises","shockwave-curriculum\u002Fexercises\u002Fch12-exceptions-and-try-catch\u002F12-exceptions-and-try-catch",{"path":939,"title":940,"stem":941},"\u002Fshockwave-curriculum\u002Fexercises\u002Fch13-common-gotchas\u002F13-common-gotchas","Common Gotchas — Exercises","shockwave-curriculum\u002Fexercises\u002Fch13-common-gotchas\u002F13-common-gotchas",{"path":943,"title":944,"stem":945},"\u002Fshockwave-curriculum\u002Fexercises\u002Fch14-why-design-patterns\u002F14-why-design-patterns","Why Design Patterns? — Exercises","shockwave-curriculum\u002Fexercises\u002Fch14-why-design-patterns\u002F14-why-design-patterns",{"path":947,"title":948,"stem":949},"\u002Fshockwave-curriculum\u002Fexercises\u002Fch15-advanced-collections\u002F15-advanced-collections","Advanced Collections (Set\u002FQueue\u002FMap) — Exercises","shockwave-curriculum\u002Fexercises\u002Fch15-advanced-collections\u002F15-advanced-collections",{"path":951,"title":952,"stem":953},"\u002Fshockwave-curriculum\u002Fexercises\u002Fch16-writing-your-own-generics\u002F16-writing-your-own-generics","Writing Your Own Generics — Exercises","shockwave-curriculum\u002Fexercises\u002Fch16-writing-your-own-generics\u002F16-writing-your-own-generics",{"path":955,"title":956,"stem":957},"\u002Fshockwave-curriculum\u002Fexercises\u002Fch17-inheritance-and-abstractions\u002F1-inheritance-superclass-subclass","Inheritance, Superclass, Subclass — Exercises","shockwave-curriculum\u002Fexercises\u002Fch17-inheritance-and-abstractions\u002F17.1-inheritance-superclass-subclass",{"path":959,"title":960,"stem":961},"\u002Fshockwave-curriculum\u002Fexercises\u002Fch17-inheritance-and-abstractions\u002F2-inheritance-and-constructors","Inheritance and Constructors — Exercises","shockwave-curriculum\u002Fexercises\u002Fch17-inheritance-and-abstractions\u002F17.2-inheritance-and-constructors",{"path":963,"title":964,"stem":965},"\u002Fshockwave-curriculum\u002Fexercises\u002Fch17-inheritance-and-abstractions\u002F3-inheritance-hierarchies","Inheritance Hierarchies — Exercises","shockwave-curriculum\u002Fexercises\u002Fch17-inheritance-and-abstractions\u002F17.3-inheritance-hierarchies",{"path":967,"title":968,"stem":969},"\u002Fshockwave-curriculum\u002Fexercises\u002Fch17-inheritance-and-abstractions\u002F4-object-superclass","Object Superclass — Exercises","shockwave-curriculum\u002Fexercises\u002Fch17-inheritance-and-abstractions\u002F17.4-object-superclass",{"path":971,"title":972,"stem":973},"\u002Fshockwave-curriculum\u002Fexercises\u002Fch17-inheritance-and-abstractions\u002F5-abstract-classes-and-methods","Abstract Classes and Methods — Exercises","shockwave-curriculum\u002Fexercises\u002Fch17-inheritance-and-abstractions\u002F17.5-abstract-classes-and-methods",{"path":975,"title":976,"stem":977},"\u002Fshockwave-curriculum\u002Fexercises\u002Fch18-polymorphism-many-forms\u002F1-overriding-methods","Overriding Methods — Exercises","shockwave-curriculum\u002Fexercises\u002Fch18-polymorphism-many-forms\u002F18.1-overriding-methods",{"path":979,"title":980,"stem":981},"\u002Fshockwave-curriculum\u002Fexercises\u002Fch18-polymorphism-many-forms\u002F2-super-keyword","super Keyword — Exercises","shockwave-curriculum\u002Fexercises\u002Fch18-polymorphism-many-forms\u002F18.2-super-keyword",{"path":983,"title":984,"stem":985},"\u002Fshockwave-curriculum\u002Fexercises\u002Fch18-polymorphism-many-forms\u002F3-polymorphism","Polymorphism — Exercises","shockwave-curriculum\u002Fexercises\u002Fch18-polymorphism-many-forms\u002F18.3-polymorphism",{"path":987,"title":988,"stem":989},"\u002Fshockwave-curriculum\u002Fexercises\u002Fch19-interfaces-as-contracts\u002F19-interfaces-as-contracts","Interfaces as Contracts — Exercises","shockwave-curriculum\u002Fexercises\u002Fch19-interfaces-as-contracts\u002F19-interfaces-as-contracts",{"path":991,"title":992,"stem":993},"\u002Fshockwave-curriculum\u002Fexercises\u002Fch19-interfaces-as-contracts\u002F1-lambdas-and-method-references","Lambdas & Method References — Exercises","shockwave-curriculum\u002Fexercises\u002Fch19-interfaces-as-contracts\u002F19.1-lambdas-and-method-references",{"path":995,"title":996,"stem":997},"\u002Fshockwave-curriculum\u002Fexercises\u002Fch20-the-io-layer-pattern\u002F20-the-io-layer-pattern","The IO-Layer Pattern — Exercises","shockwave-curriculum\u002Fexercises\u002Fch20-the-io-layer-pattern\u002F20-the-io-layer-pattern",{"path":999,"title":1000,"stem":1001},"\u002Fshockwave-curriculum\u002Fexercises\u002Fch21-static-factories\u002F21-static-factories","Static Factories — Exercises","shockwave-curriculum\u002Fexercises\u002Fch21-static-factories\u002F21-static-factories",{"path":1003,"title":1004,"stem":1005},"\u002Fshockwave-curriculum\u002Fexercises\u002Fch22-the-builder-pattern\u002F22-the-builder-pattern","The Builder Pattern — Exercises","shockwave-curriculum\u002Fexercises\u002Fch22-the-builder-pattern\u002F22-the-builder-pattern",{"path":1007,"title":1008,"stem":1009},"\u002Fshockwave-curriculum\u002Fexercises\u002Fch23-encapsulation-and-final\u002F1-scope-and-access","Access, final, and Immutability — Exercises","shockwave-curriculum\u002Fexercises\u002Fch23-encapsulation-and-final\u002F23.1-scope-and-access",{"path":1011,"title":1012,"stem":1013},"\u002Fshockwave-curriculum\u002Fexercises\u002Fch24-optional-avoiding-null-pointer-exceptions\u002F24-optional-avoiding-null-pointer-exceptions","Optional: Avoiding Null Pointer Exceptions — Exercises","shockwave-curriculum\u002Fexercises\u002Fch24-optional-avoiding-null-pointer-exceptions\u002F24-optional-avoiding-null-pointer-exceptions",{"path":1015,"title":1016,"stem":1017},"\u002Fshockwave-curriculum\u002Fexercises\u002Fch25-command-based-programming\u002F1-what-is-command-based-programming","What Is Command-Based Programming? — Exercises","shockwave-curriculum\u002Fexercises\u002Fch25-command-based-programming\u002F25.1-what-is-command-based-programming",{"path":1019,"title":1020,"stem":1021},"\u002Fshockwave-curriculum\u002Fexercises\u002Fch25-command-based-programming\u002F2-commands-and-command-compositions","Commands & Command Compositions — Exercises","shockwave-curriculum\u002Fexercises\u002Fch25-command-based-programming\u002F25.2-commands-and-command-compositions",{"path":1023,"title":1024,"stem":1025},"\u002Fshockwave-curriculum\u002Fexercises\u002Fch25-command-based-programming\u002F3-the-command-scheduler","The Command Scheduler — Exercises","shockwave-curriculum\u002Fexercises\u002Fch25-command-based-programming\u002F25.3-the-command-scheduler",{"path":1027,"title":1028,"stem":1029},"\u002Fshockwave-curriculum\u002Fexercises\u002Fch25-command-based-programming\u002F4-state-machines-logic","State Machines: Logic — Exercises","shockwave-curriculum\u002Fexercises\u002Fch25-command-based-programming\u002F25.4-state-machines-logic",{"path":1031,"title":1032,"stem":1033},"\u002Fshockwave-curriculum\u002Fexercises\u002Fch25-command-based-programming\u002F5-managing-transitions","Managing Transitions — Exercises","shockwave-curriculum\u002Fexercises\u002Fch25-command-based-programming\u002F25.5-managing-transitions",{"path":1035,"title":1036,"stem":1037},"\u002Fshockwave-curriculum\u002Fexercises\u002Fch25-command-based-programming\u002F6-binding-commands-to-triggers","Binding Commands to Triggers — Exercises","shockwave-curriculum\u002Fexercises\u002Fch25-command-based-programming\u002F25.6-binding-commands-to-triggers",{"path":1039,"title":1040,"stem":1041},"\u002Fshockwave-curriculum\u002Fexercises\u002Fch25-command-based-programming\u002F7-structuring-a-command-based-robot-project","Structuring a Command-Based Robot Project — Exercises","shockwave-curriculum\u002Fexercises\u002Fch25-command-based-programming\u002F25.7-structuring-a-command-based-robot-project",{"path":1043,"title":1044,"stem":1045},"\u002Fshockwave-curriculum\u002Fexercises\u002Fch26-architecture-takeaways\u002F26-architecture-takeaways","Architecture Takeaways — Exercises","shockwave-curriculum\u002Fexercises\u002Fch26-architecture-takeaways\u002F26-architecture-takeaways",{"path":1047,"title":1048,"stem":1049},"\u002Fshockwave-curriculum\u002Fexercises\u002Fch27-program-design-and-abstraction\u002F1-abstraction-and-program-design","Abstraction and Program Design — Exercises","shockwave-curriculum\u002Fexercises\u002Fch27-program-design-and-abstraction\u002F27.1-abstraction-and-program-design",{"path":1051,"title":1052,"stem":1053},"\u002Fshockwave-curriculum\u002Fexercises\u002Fch27-program-design-and-abstraction\u002F2-impact-of-program-design","Impact of Program Design — Exercises","shockwave-curriculum\u002Fexercises\u002Fch27-program-design-and-abstraction\u002F27.2-impact-of-program-design",{"path":1055,"title":1056,"stem":1057},"\u002Fshockwave-curriculum\u002Fexercises\u002Fch28-algorithms-searching-sorting-recursion\u002F1-searching-algorithms","Searching Algorithms — Exercises","shockwave-curriculum\u002Fexercises\u002Fch28-algorithms-searching-sorting-recursion\u002F28.1-searching-algorithms",{"path":1059,"title":1060,"stem":1061},"\u002Fshockwave-curriculum\u002Fexercises\u002Fch28-algorithms-searching-sorting-recursion\u002F2-sorting-algorithms","Sorting Algorithms — Exercises","shockwave-curriculum\u002Fexercises\u002Fch28-algorithms-searching-sorting-recursion\u002F28.2-sorting-algorithms",{"path":1063,"title":1064,"stem":1065},"\u002Fshockwave-curriculum\u002Fexercises\u002Fch28-algorithms-searching-sorting-recursion\u002F3-recursion","Recursion — Exercises","shockwave-curriculum\u002Fexercises\u002Fch28-algorithms-searching-sorting-recursion\u002F28.3-recursion",{"path":1067,"title":1068,"stem":1069},"\u002Fshockwave-curriculum\u002Fexercises\u002Fch28-algorithms-searching-sorting-recursion\u002F4-recursive-searching-and-sorting","Recursive Searching and Sorting — Exercises","shockwave-curriculum\u002Fexercises\u002Fch28-algorithms-searching-sorting-recursion\u002F28.4-recursive-searching-and-sorting",{"id":1071,"title":282,"body":1072,"description":1094,"extension":1535,"meta":1536,"navigation":1411,"path":281,"seo":1539,"stem":283,"__hash__":1540},"lessons\u002Fshockwave-curriculum\u002Flessons\u002Fch25-command-based-programming\u002F25.4-state-machines-logic.md",{"type":1073,"value":1074,"toc":1525},"minimark",[1075,1079,1084,1088,1124,1142,1146,1158,1224,1228,1231,1239,1246,1321,1336,1340,1356,1360,1363,1419,1426,1430,1437,1441,1482,1486,1503,1521],[1076,1077,282],"h1",{"id":1078},"state-machines-logic",[1080,1081,1083],"h2",{"id":1082},"the-problem-tracking-state-with-booleans-doesnt-scale","The Problem: Tracking State With Booleans Doesn't Scale",[1085,1086,1087],"p",{},"A mechanism often needs to remember \"what am I currently doing\" — an intake might be idle, actively intaking, holding a game piece, or scoring. Tracking that with a pile of booleans gets unmanageable fast:",[1089,1090,1095],"pre",{"className":1091,"code":1092,"language":1093,"meta":1094,"style":1094},"language-java shiki shiki-themes github-light github-dark","private boolean isIdle;\nprivate boolean isIntaking;\nprivate boolean isHolding;\nprivate boolean isScoring;\n","java","",[1096,1097,1098,1106,1112,1118],"code",{"__ignoreMap":1094},[1099,1100,1103],"span",{"class":1101,"line":1102},"line",1,[1099,1104,1105],{},"private boolean isIdle;\n",[1099,1107,1109],{"class":1101,"line":1108},2,[1099,1110,1111],{},"private boolean isIntaking;\n",[1099,1113,1115],{"class":1101,"line":1114},3,[1099,1116,1117],{},"private boolean isHolding;\n",[1099,1119,1121],{"class":1101,"line":1120},4,[1099,1122,1123],{},"private boolean isScoring;\n",[1085,1125,1126,1127,1130,1131,1134,1135,1138,1139,1141],{},"Nothing stops two of these from accidentally being ",[1096,1128,1129],{},"true"," at the same time — a bug that's easy to introduce and hard to spot, since \"impossible\" combinations (",[1096,1132,1133],{},"isIdle"," and ",[1096,1136,1137],{},"isScoring"," both ",[1096,1140,1129],{},") compile just fine.",[1080,1143,1145],{"id":1144},"the-state-machine-design-pattern","The State Machine Design Pattern",[1085,1147,1148,1149,1153,1154,1157],{},"A ",[1150,1151,1152],"strong",{},"state machine"," is a design pattern for exactly this problem: a system that is always in ",[1150,1155,1156],{},"exactly one"," of a fixed set of named states, and moves between them according to defined rules. It has five parts:",[1159,1160,1161,1186,1195,1207,1213],"ul",{},[1162,1163,1164,1167,1168,1171,1172,1171,1175,1171,1178,1181,1182,1185],"li",{},[1150,1165,1166],{},"States"," — every situation the mechanism can be in, each with a name: ",[1096,1169,1170],{},"IDLE",", ",[1096,1173,1174],{},"INTAKING",[1096,1176,1177],{},"HOLDING",[1096,1179,1180],{},"SCORING",". Each state has its own ",[1150,1183,1184],{},"state action",": what the mechanism does, every loop, while it's in that state (for example, \"run the rollers inward at half speed\").",[1162,1187,1188,1191,1192,1194],{},[1150,1189,1190],{},"The start state"," — the one state the machine is in when the robot turns on (",[1096,1193,1170],{},").",[1162,1196,1197,1200,1201,1203,1204,1206],{},[1150,1198,1199],{},"Transitions"," — the allowed moves from one state to another, like ",[1096,1202,1174],{}," → ",[1096,1205,1177],{},". A move that isn't listed can't happen.",[1162,1208,1209,1212],{},[1150,1210,1211],{},"Guard conditions"," — the condition that must be true for a transition to happen, like \"the sensor sees a game piece.\" A guard can check a sensor, a timer, or a driver's button.",[1162,1214,1215,1218,1219,1223],{},[1150,1216,1217],{},"Entry actions"," — anything that should happen exactly ",[1220,1221,1222],"em",{},"once",", at the moment the machine enters a state, like logging the change or resetting a timer. (This is different from the state action, which repeats every loop.)",[1080,1225,1227],{"id":1226},"drawing-it-the-state-diagram","Drawing It: The State Diagram",[1085,1229,1230],{},"Before writing any code, draw the machine. Each box is a state, each arrow is a transition labeled with its guard, and the arrow from \"start\" marks the start state:",[1089,1232,1237],{"className":1233,"code":1235,"language":1236},[1234],"language-text","             start\n               │\n               ▼\n         ┌───────────┐   intake button pressed   ┌───────────┐\n         │   IDLE    │ ────────────────────────▶ │ INTAKING  │\n         └───────────┘                           └───────────┘\n               ▲                                       │\n               │ sensor no longer                      │ sensor sees\n               │ sees a piece                          │ a piece\n               │                                       ▼\n         ┌───────────┐   score button pressed    ┌───────────┐\n         │  SCORING  │ ◀──────────────────────── │  HOLDING  │\n         └───────────┘                           └───────────┘\n","text",[1096,1238,1235],{"__ignoreMap":1094},[1085,1240,1241,1242,1245],{},"The same machine as a ",[1150,1243,1244],{},"transition table"," — one row per arrow:",[1247,1248,1249,1265],"table",{},[1250,1251,1252],"thead",{},[1253,1254,1255,1259,1262],"tr",{},[1256,1257,1258],"th",{},"From",[1256,1260,1261],{},"To",[1256,1263,1264],{},"Guard condition",[1266,1267,1268,1282,1295,1308],"tbody",{},[1253,1269,1270,1275,1279],{},[1271,1272,1273],"td",{},[1096,1274,1170],{},[1271,1276,1277],{},[1096,1278,1174],{},[1271,1280,1281],{},"the driver presses the intake button",[1253,1283,1284,1288,1292],{},[1271,1285,1286],{},[1096,1287,1174],{},[1271,1289,1290],{},[1096,1291,1177],{},[1271,1293,1294],{},"the sensor sees a game piece",[1253,1296,1297,1301,1305],{},[1271,1298,1299],{},[1096,1300,1177],{},[1271,1302,1303],{},[1096,1304,1180],{},[1271,1306,1307],{},"the driver presses the score button",[1253,1309,1310,1314,1318],{},[1271,1311,1312],{},[1096,1313,1180],{},[1271,1315,1316],{},[1096,1317,1170],{},[1271,1319,1320],{},"the sensor no longer sees a game piece",[1085,1322,1323,1324,1326,1327,1329,1330,1332,1333,1335],{},"And the state actions, one per state: ",[1096,1325,1170],{}," stops the rollers, ",[1096,1328,1174],{}," runs them inward, ",[1096,1331,1177],{}," applies gentle hold pressure, and ",[1096,1334,1180],{}," runs them outward. The diagram and the table carry the same information; the diagram is easier to reason about, and the table maps almost line for line onto code (Lesson 25.5).",[1080,1337,1339],{"id":1338},"leaving-the-start-state","Leaving the Start State",[1085,1341,1342,1343,1345,1346,1348,1349,1352,1353,1355],{},"Look at the diagram again and follow the arrows from \"start.\" The machine begins in ",[1096,1344,1170],{}," and stays there — every loop — until a guard on one of ",[1096,1347,1170],{},"'s outgoing arrows becomes true. Here that's the driver pressing the intake button. If the start state had ",[1220,1350,1351],{},"no"," outgoing transition, the machine would sit in ",[1096,1354,1170],{}," forever and the intake would never do anything. Every state needs at least one way out, unless it's deliberately a final state, and the guards on those exits are how the outside world — drivers, sensors, timers — steers the machine.",[1080,1357,1359],{"id":1358},"representing-the-states-one-enum-one-field","Representing the States: One Enum, One Field",[1085,1361,1362],{},"Enums (Ch.11) are exactly the tool for the states — a fixed, named set of mutually exclusive values, with the compiler enforcing that a variable can only ever be one of them:",[1089,1364,1366],{"className":1091,"code":1365,"language":1093,"meta":1094,"style":1094},"public enum IntakeState\n{\n    IDLE,\n    INTAKING,\n    HOLDING,\n    SCORING\n}\n\nprivate IntakeState currentState = IntakeState.IDLE;\n",[1096,1367,1368,1373,1378,1383,1388,1394,1400,1406,1413],{"__ignoreMap":1094},[1099,1369,1370],{"class":1101,"line":1102},[1099,1371,1372],{},"public enum IntakeState\n",[1099,1374,1375],{"class":1101,"line":1108},[1099,1376,1377],{},"{\n",[1099,1379,1380],{"class":1101,"line":1114},[1099,1381,1382],{},"    IDLE,\n",[1099,1384,1385],{"class":1101,"line":1120},[1099,1386,1387],{},"    INTAKING,\n",[1099,1389,1391],{"class":1101,"line":1390},5,[1099,1392,1393],{},"    HOLDING,\n",[1099,1395,1397],{"class":1101,"line":1396},6,[1099,1398,1399],{},"    SCORING\n",[1099,1401,1403],{"class":1101,"line":1402},7,[1099,1404,1405],{},"}\n",[1099,1407,1409],{"class":1101,"line":1408},8,[1099,1410,1412],{"emptyLinePlaceholder":1411},true,"\n",[1099,1414,1416],{"class":1101,"line":1415},9,[1099,1417,1418],{},"private IntakeState currentState = IntakeState.IDLE;\n",[1085,1420,1421,1422,1425],{},"Now the mechanism's state is a single variable, initialized to the start state, and it's structurally impossible for it to be two states at once. The enum only covers the ",[1220,1423,1424],{},"states",", though; the transitions, guards, and actions are logic, and they're the subject of Lesson 25.5.",[1080,1427,1429],{"id":1428},"real-codebases-do-this-at-scale","Real Codebases Do This at Scale",[1085,1431,1432,1433,1436],{},"This exact pattern — an enum representing a fixed set of named states for a mechanism — is how real, competitive FRC codebases (like Team 5817's own production code) structure their mechanisms, just with more states and richer per-state behavior than this introductory example: an elevator's states might be tied to interpolated target heights that shift based on scoring distance, or a roller's states might each carry their own target voltage. The underlying idea is identical to ",[1096,1434,1435],{},"IntakeState"," above — a state machine core built on an enum — dressed up with more sophisticated per-state data as a mechanism's real requirements grow. The subsystem chapters later in this course build directly on this pattern.",[1080,1438,1440],{"id":1439},"common-pitfalls","Common Pitfalls",[1159,1442,1443,1449,1470,1476],{},[1162,1444,1445,1448],{},[1150,1446,1447],{},"Reaching for several independent booleans instead of one enum."," This lets impossible\u002Fcontradictory combinations exist in the code, even though only one is ever supposed to be true — an enum makes that mistake structurally impossible.",[1162,1450,1451,1454,1455,1458,1459,1461,1462,1465,1466,1469],{},[1150,1452,1453],{},"Forgetting a state machine needs an initial value."," ",[1096,1456,1457],{},"currentState"," should always be initialized to the real start state (like ",[1096,1460,1170],{},") — an uninitialized state variable is a ",[1096,1463,1464],{},"null"," waiting to cause a ",[1096,1467,1468],{},"NullPointerException"," (Ch.12\u002F13) the first time anything reads it.",[1162,1471,1472,1475],{},[1150,1473,1474],{},"Designing a state with no way out."," If no transition leaves a state — especially the start state — the machine gets stuck there for the rest of the match. Check every box in the diagram for at least one outgoing arrow.",[1162,1477,1478,1481],{},[1150,1479,1480],{},"Confusing an entry action with a state action."," Something meant to happen once (logging the change, resetting a timer) placed in a state action runs every loop — fifty times a second — instead of once.",[1080,1483,1485],{"id":1484},"key-takeaways","Key Takeaways",[1159,1487,1488,1491,1494,1497,1500],{},[1162,1489,1490],{},"Tracking \"what state am I in\" with multiple independent booleans allows impossible combinations and doesn't scale.",[1162,1492,1493],{},"A state machine is always in exactly one of a fixed set of states; it has a start state, transitions between states, guard conditions that decide when each transition happens, state actions that repeat every loop, and entry actions that run once on entering a state.",[1162,1495,1496],{},"Draw the state diagram (or write the transition table) before the code, and make sure every state — especially the start state — has a way out.",[1162,1498,1499],{},"A single enum field, initialized to the start state, represents the current state and guarantees it's exactly one thing at a time.",[1162,1501,1502],{},"This pattern is exactly what real, competitive FRC codebases use for their mechanisms, and the later subsystem chapters build on it.",[1085,1504,1505,1506,1509,1510,1171,1513,1516,1517,1520],{},"Derived from ",[1096,1507,1508],{},"other-reference-repo",": ",[1096,1511,1512],{},"team-5817-training\u002Fsubsystems\u002F02-state-based-servo-subsystems.md",[1096,1514,1515],{},"03-state-based-roller-subsystems.md"," (T5817 31.1-4)\n",[1150,1518,1519],{},"Deck context:"," mechacoder-test\u002Fsrc\u002Flessons\u002Fjava-2.js, slide 10 (\"State Machines: Logic\") — IntakeState enum example",[1522,1523,1524],"style",{},"html .default .shiki span {color: var(--shiki-default);background: var(--shiki-default-bg);font-style: var(--shiki-default-font-style);font-weight: var(--shiki-default-font-weight);text-decoration: var(--shiki-default-text-decoration);}html .shiki span {color: var(--shiki-default);background: var(--shiki-default-bg);font-style: var(--shiki-default-font-style);font-weight: var(--shiki-default-font-weight);text-decoration: var(--shiki-default-text-decoration);}html .dark .shiki span {color: var(--shiki-dark);background: var(--shiki-dark-bg);font-style: var(--shiki-dark-font-style);font-weight: var(--shiki-dark-font-weight);text-decoration: var(--shiki-dark-text-decoration);}html.dark .shiki span {color: var(--shiki-dark);background: var(--shiki-dark-bg);font-style: var(--shiki-dark-font-style);font-weight: var(--shiki-dark-font-weight);text-decoration: var(--shiki-dark-text-decoration);}",{"title":1094,"searchDepth":1108,"depth":1108,"links":1526},[1527,1528,1529,1530,1531,1532,1533,1534],{"id":1082,"depth":1108,"text":1083},{"id":1144,"depth":1108,"text":1145},{"id":1226,"depth":1108,"text":1227},{"id":1338,"depth":1108,"text":1339},{"id":1358,"depth":1108,"text":1359},{"id":1428,"depth":1108,"text":1429},{"id":1439,"depth":1108,"text":1440},{"id":1484,"depth":1108,"text":1485},"md",{"outlineRef":1537,"status":1538},"25.4 — State Machines: Logic (enum) (T5817 31.1-4)","new — authored lesson (fuller depth than the teaser slide; expanded to the full State Machine design pattern)",{"title":282,"description":1094},"q29SM8VozK10WHYAE5F3p0cilQPVWdGPPtbYzENKFbI",{"id":1542,"title":715,"body":1543,"description":1094,"extension":1535,"meta":1966,"navigation":1411,"path":714,"seo":1969,"stem":716,"__hash__":1970},"examples\u002Fshockwave-curriculum\u002Fexamples\u002Fch25-command-based-programming\u002F25.4-state-machines-logic.md",{"type":1073,"value":1544,"toc":1955},[1545,1548,1552,1555,1559,1577,1581,1601,1604,1619,1632,1636,1669,1676,1680,1683,1689,1731,1753,1757,1760,1769,1778,1782,1785,1794,1811,1815,1818,1908,1919,1928,1932,1953],[1076,1546,715],{"id":1547},"state-machines-logic-worked-example",[1080,1549,1551],{"id":1550},"problem","Problem",[1085,1553,1554],{},"A climber mechanism is always in one of three situations: stowed inside the frame, extending its hook up to the bar, or actively climbing. A teammate tracks this with three booleans, and a bug report says the dashboard once showed the climber as \"stowed\" and \"extending\" at the same time. Replace the booleans with a state machine that makes that bug impossible, and design its transitions: the hook extends when the driver presses the climb button, and the climb starts once a sensor reports the hook is at the top. Once the robot is climbing, it stays climbing for the rest of the match.",[1080,1556,1558],{"id":1557},"step-1-plan-it-first","Step 1: Plan It First",[1560,1561,1562,1565,1568,1571,1574],"ol",{},[1162,1563,1564],{},"Find out how the boolean version allows the bug.",[1162,1566,1567],{},"List every state the climber can be in, and make each one an enum constant.",[1162,1569,1570],{},"Design the transitions: draw the state diagram and write the transition table, with a guard condition for each arrow.",[1162,1572,1573],{},"Replace the booleans with one field of that enum type, initialized to the start state.",[1162,1575,1576],{},"Check that changing state is now a single assignment that can't leave two states \"on.\"",[1080,1578,1580],{"id":1579},"step-2-see-how-the-booleans-allow-the-bug","Step 2: See How the Booleans Allow the Bug",[1089,1582,1584],{"className":1091,"code":1583,"language":1093,"meta":1094,"style":1094},"private boolean isStowed = true;\nprivate boolean isExtending = false;\nprivate boolean isClimbing = false;\n",[1096,1585,1586,1591,1596],{"__ignoreMap":1094},[1099,1587,1588],{"class":1101,"line":1102},[1099,1589,1590],{},"private boolean isStowed = true;\n",[1099,1592,1593],{"class":1101,"line":1108},[1099,1594,1595],{},"private boolean isExtending = false;\n",[1099,1597,1598],{"class":1101,"line":1114},[1099,1599,1600],{},"private boolean isClimbing = false;\n",[1085,1602,1603],{},"Starting to extend should mean turning one flag off and another on:",[1089,1605,1607],{"className":1091,"code":1606,"language":1093,"meta":1094,"style":1094},"isExtending = true;\n\u002F\u002F forgot: isStowed = false;\n",[1096,1608,1609,1614],{"__ignoreMap":1094},[1099,1610,1611],{"class":1101,"line":1102},[1099,1612,1613],{},"isExtending = true;\n",[1099,1615,1616],{"class":1101,"line":1108},[1099,1617,1618],{},"\u002F\u002F forgot: isStowed = false;\n",[1085,1620,1621,1622,1134,1625,1628,1629,1631],{},"One missed line, and ",[1096,1623,1624],{},"isStowed",[1096,1626,1627],{},"isExtending"," are both ",[1096,1630,1129],{},". The compiler can't catch it — as far as Java is concerned, any combination of three booleans is legal, even though only three of the eight combinations make sense.",[1080,1633,1635],{"id":1634},"step-3-one-enum-constant-per-state","Step 3: One Enum Constant per State",[1089,1637,1639],{"className":1091,"code":1638,"language":1093,"meta":1094,"style":1094},"public enum ClimberState\n{\n    STOWED,\n    EXTENDING,\n    CLIMBING\n}\n",[1096,1640,1641,1646,1650,1655,1660,1665],{"__ignoreMap":1094},[1099,1642,1643],{"class":1101,"line":1102},[1099,1644,1645],{},"public enum ClimberState\n",[1099,1647,1648],{"class":1101,"line":1108},[1099,1649,1377],{},[1099,1651,1652],{"class":1101,"line":1114},[1099,1653,1654],{},"    STOWED,\n",[1099,1656,1657],{"class":1101,"line":1120},[1099,1658,1659],{},"    EXTENDING,\n",[1099,1661,1662],{"class":1101,"line":1390},[1099,1663,1664],{},"    CLIMBING\n",[1099,1666,1667],{"class":1101,"line":1396},[1099,1668,1405],{},[1085,1670,1671,1672,1675],{},"Every situation the climber can really be in gets exactly one name, and nothing else is possible. ",[1096,1673,1674],{},"STOWED"," is the start state — the climber really does start the match stowed.",[1080,1677,1679],{"id":1678},"step-4-design-the-transitions","Step 4: Design the Transitions",[1085,1681,1682],{},"Two moves are allowed, each with its own guard condition:",[1089,1684,1687],{"className":1685,"code":1686,"language":1236,"meta":1094},[1234],"      start\n        │\n        ▼\n  ┌───────────┐  climb button pressed  ┌───────────┐  hook sensor at top  ┌───────────┐\n  │  STOWED   │ ─────────────────────▶ │ EXTENDING │ ───────────────────▶ │ CLIMBING  │\n  └───────────┘                        └───────────┘                      └───────────┘\n",[1096,1688,1686],{"__ignoreMap":1094},[1247,1690,1691,1701],{},[1250,1692,1693],{},[1253,1694,1695,1697,1699],{},[1256,1696,1258],{},[1256,1698,1261],{},[1256,1700,1264],{},[1266,1702,1703,1717],{},[1253,1704,1705,1709,1714],{},[1271,1706,1707],{},[1096,1708,1674],{},[1271,1710,1711],{},[1096,1712,1713],{},"EXTENDING",[1271,1715,1716],{},"the driver presses the climb button",[1253,1718,1719,1723,1728],{},[1271,1720,1721],{},[1096,1722,1713],{},[1271,1724,1725],{},[1096,1726,1727],{},"CLIMBING",[1271,1729,1730],{},"the hook sensor reports the hook is at the top",[1085,1732,1733,1734,1736,1737,1739,1740,1742,1743,1746,1747,1749,1750,1752],{},"Check every state for a way out. ",[1096,1735,1674],{}," has one (the driver's button), so the machine can leave its start state. ",[1096,1738,1713],{}," has one (the sensor). ",[1096,1741,1727],{}," has none — and that's deliberate: once the robot is hanging, it's a ",[1150,1744,1745],{},"final state"," for the rest of the match. Notice also that there's no arrow from ",[1096,1748,1674],{}," straight to ",[1096,1751,1727],{},": a move that isn't in the table can't happen.",[1080,1754,1756],{"id":1755},"step-5-one-field-with-a-real-starting-value","Step 5: One Field, With a Real Starting Value",[1085,1758,1759],{},"The three booleans become a single field:",[1089,1761,1763],{"className":1091,"code":1762,"language":1093,"meta":1094,"style":1094},"private ClimberState currentState = ClimberState.STOWED;\n",[1096,1764,1765],{"__ignoreMap":1094},[1099,1766,1767],{"class":1101,"line":1102},[1099,1768,1762],{},[1085,1770,1771,1772,1774,1775,1777],{},"The field starts at the start state, ",[1096,1773,1674],{},". Leaving it uninitialized would make it ",[1096,1776,1464],{}," — not any of the three states — until something assigned it.",[1080,1779,1781],{"id":1780},"step-6-changing-state","Step 6: Changing State",[1085,1783,1784],{},"Starting to extend is now one assignment:",[1089,1786,1788],{"className":1091,"code":1787,"language":1093,"meta":1094,"style":1094},"currentState = ClimberState.EXTENDING;\n",[1096,1789,1790],{"__ignoreMap":1094},[1099,1791,1792],{"class":1101,"line":1102},[1099,1793,1787],{},[1085,1795,1796,1797,1799,1800,1802,1803,1805,1806,1203,1808,1810],{},"There's no second line to forget. ",[1096,1798,1457],{}," held ",[1096,1801,1674],{},"; now it holds ",[1096,1804,1713],{},"; it can never hold both, because a variable only holds one value at a time. (When this assignment should happen — only when the ",[1096,1807,1674],{},[1096,1809,1713],{}," guard is true — is Lesson 25.5's job.)",[1080,1812,1814],{"id":1813},"step-7-check-it-runs","Step 7: Check It Runs",[1085,1816,1817],{},"A quick standalone program confirms the state really is exactly one thing at a time:",[1089,1819,1821],{"className":1091,"code":1820,"language":1093,"meta":1094,"style":1094},"public class ClimberStateCheck\n{\n    public static void main(String[] args)\n    {\n        ClimberState currentState = ClimberState.STOWED;\n        System.out.println(currentState); \u002F\u002F STOWED\n        currentState = ClimberState.EXTENDING;\n        System.out.println(currentState); \u002F\u002F EXTENDING\n    }\n}\n\nenum ClimberState\n{\n    STOWED,\n    EXTENDING,\n    CLIMBING\n}\n",[1096,1822,1823,1828,1832,1837,1842,1847,1852,1857,1862,1867,1872,1877,1883,1888,1893,1898,1903],{"__ignoreMap":1094},[1099,1824,1825],{"class":1101,"line":1102},[1099,1826,1827],{},"public class ClimberStateCheck\n",[1099,1829,1830],{"class":1101,"line":1108},[1099,1831,1377],{},[1099,1833,1834],{"class":1101,"line":1114},[1099,1835,1836],{},"    public static void main(String[] args)\n",[1099,1838,1839],{"class":1101,"line":1120},[1099,1840,1841],{},"    {\n",[1099,1843,1844],{"class":1101,"line":1390},[1099,1845,1846],{},"        ClimberState currentState = ClimberState.STOWED;\n",[1099,1848,1849],{"class":1101,"line":1396},[1099,1850,1851],{},"        System.out.println(currentState); \u002F\u002F STOWED\n",[1099,1853,1854],{"class":1101,"line":1402},[1099,1855,1856],{},"        currentState = ClimberState.EXTENDING;\n",[1099,1858,1859],{"class":1101,"line":1408},[1099,1860,1861],{},"        System.out.println(currentState); \u002F\u002F EXTENDING\n",[1099,1863,1864],{"class":1101,"line":1415},[1099,1865,1866],{},"    }\n",[1099,1868,1870],{"class":1101,"line":1869},10,[1099,1871,1405],{},[1099,1873,1875],{"class":1101,"line":1874},11,[1099,1876,1412],{"emptyLinePlaceholder":1411},[1099,1878,1880],{"class":1101,"line":1879},12,[1099,1881,1882],{},"enum ClimberState\n",[1099,1884,1886],{"class":1101,"line":1885},13,[1099,1887,1377],{},[1099,1889,1891],{"class":1101,"line":1890},14,[1099,1892,1654],{},[1099,1894,1896],{"class":1101,"line":1895},15,[1099,1897,1659],{},[1099,1899,1901],{"class":1101,"line":1900},16,[1099,1902,1664],{},[1099,1904,1906],{"class":1101,"line":1905},17,[1099,1907,1405],{},[1085,1909,1910,1911,1914,1915,1918],{},"The public class comes first in the file and the enum after it. That order works on every Java version: Java 25 would also accept the enum first, but on Java 17 running a single file with ",[1096,1912,1913],{},"java ClimberStateCheck.java"," needs the class with ",[1096,1916,1917],{},"main"," to be the first one in the file.",[1085,1920,1921,1922,1924,1925,1927],{},"Printing an enum value prints its name, so the output is ",[1096,1923,1674],{},", then ",[1096,1926,1713],{},".",[1080,1929,1931],{"id":1930},"recap","Recap",[1159,1933,1934,1937,1940,1943,1946],{},[1162,1935,1936],{},"Several independent booleans allow combinations that make no sense, and the compiler can't stop them.",[1162,1938,1939],{},"An enum lists every real state by name; a single field of that type can only ever hold one of them.",[1162,1941,1942],{},"Draw the diagram and transition table before the code: every arrow gets a guard, and every state needs a way out unless it's a deliberate final state.",[1162,1944,1945],{},"Always initialize the state field to the start state.",[1162,1947,1948,1949,1952],{},"A state change is just an assignment — deciding ",[1220,1950,1951],{},"when"," to make it is Lesson 25.5's job.",[1522,1954,1524],{},{"title":1094,"searchDepth":1108,"depth":1108,"links":1956},[1957,1958,1959,1960,1961,1962,1963,1964,1965],{"id":1550,"depth":1108,"text":1551},{"id":1557,"depth":1108,"text":1558},{"id":1579,"depth":1108,"text":1580},{"id":1634,"depth":1108,"text":1635},{"id":1678,"depth":1108,"text":1679},{"id":1755,"depth":1108,"text":1756},{"id":1780,"depth":1108,"text":1781},{"id":1813,"depth":1108,"text":1814},{"id":1930,"depth":1108,"text":1931},{"outlineRef":1537,"pairsWith":1967,"status":1968},"[`lessons\u002Fch25-command-based-programming\u002F25.4-state-machines-logic.md`](..\u002F..\u002Flessons\u002Fch25-command-based-programming\u002F25.4-state-machines-logic.md)","new — authored worked example (fully solved, walked step by step — not a problem to attempt); expanded to the full State Machine design pattern",{"title":715,"description":1094},"bGBqbYFu3XJJXe-l-UBpRcYVDJj4ccJRx8YB8kI1QZk",{"id":1972,"title":1028,"body":1973,"description":1094,"extension":1535,"meta":3114,"navigation":1411,"path":1027,"seo":3116,"stem":1029,"__hash__":3117},"exercises\u002Fshockwave-curriculum\u002Fexercises\u002Fch25-command-based-programming\u002F25.4-state-machines-logic.md",{"type":1073,"value":1974,"toc":3109},[1975,1978,1982,2016,2021,2038,2044,2060,2077,2081,2101,2113,2116,2188,2193,2199,2261,2324,2341,2345,2351,2356,2435,2464,2478,2484,2487,2493,2498,2634,2639,2644,2649,2654,2659,2664,2668,2674,2678,2684,2689,2693,2699,2703,2709,2714,2718,2724,2728,2734,2739,2743,2749,2753,2759,2764,3058,3107],[1076,1976,1028],{"id":1977},"state-machines-logic-exercises",[1080,1979,1981],{"id":1980},"multiple-choice","Multiple Choice",[1085,1983,1984,1987,1988,1171,1991,1994,1995,1998,1999,2002,2003,2006,2007,1171,2009,1994,2012,2015],{},[1150,1985,1986],{},"Question:"," A shooter mechanism tracks what it's doing with three fields: ",[1096,1989,1990],{},"boolean isIdle",[1096,1992,1993],{},"boolean isSpinningUp",", and ",[1096,1996,1997],{},"boolean isReady",". A teammate replaces them with a single field, ",[1096,2000,2001],{},"ShooterState currentState",", where ",[1096,2004,2005],{},"ShooterState"," is an enum with the constants ",[1096,2008,1170],{},[1096,2010,2011],{},"SPINNING_UP",[1096,2013,2014],{},"READY",". What problem does this change solve?",[1085,2017,2018],{},[1150,2019,2020],{},"Options:",[1159,2022,2023,2026,2032,2035],{},[1162,2024,2025],{},"A. The shooter can no longer be recorded as being in two states at once, like idle and ready at the same time.",[1162,2027,2028,2029,1927],{},"B. The shooter code runs faster, because an enum is checked more quickly than a ",[1096,2030,2031],{},"boolean",[1162,2033,2034],{},"C. The shooter can now be in two states at once when it needs to be, like spinning up and ready together.",[1162,2036,2037],{},"D. The state field no longer needs an initial value, because an enum field always starts at its first constant.",[1085,2039,2040,2043],{},[1150,2041,2042],{},"Answer:"," A",[1085,2045,2046,2049,2050,2052,2053,1171,2055,2057,2058,1927],{},[1150,2047,2048],{},"Why:"," With three independent booleans, nothing stops two of them from being ",[1096,2051,1129],{}," together — a contradiction that compiles just fine. A single enum-typed field holds exactly one value at a time, so the shooter's state is structurally guaranteed to be exactly one of ",[1096,2054,1170],{},[1096,2056,2011],{},", or ",[1096,2059,2014],{},[1159,2061,2062,2065,2068],{},[1162,2063,2064],{},"B is wrong — the point of the change is correctness and readability, not speed.",[1162,2066,2067],{},"C is wrong — it's the opposite: being in exactly one state at a time is the whole guarantee a state machine gives you.",[1162,2069,2070,2071,2073,2074,1927],{},"D is wrong — an enum field left uninitialized is ",[1096,2072,1464],{},", not its first constant; it still needs a real starting value like ",[1096,2075,2076],{},"ShooterState.IDLE",[1080,2078,2080],{"id":2079},"micro-parsons","Micro-Parsons",[1085,2082,2083,2086,2087,2090,2091,1134,2094,2097,2098,2100],{},[1150,2084,2085],{},"Problem:"," These lines, once correctly ordered, form a complete program that declares a ",[1096,2088,2089],{},"GearState"," enum with the constants ",[1096,2092,2093],{},"LOW",[1096,2095,2096],{},"HIGH",", then creates a single state variable for a two-speed gearbox that starts in ",[1096,2099,2093],{}," gear, and prints it. Declare the enum first in the file, above the class that uses it.",[1085,2102,2103,2106,2107,2109,2110,2112],{},[1220,2104,2105],{},"Note on file order:"," putting the enum before the class with ",[1096,2108,1917],{}," is fine on Java 25's single-file launcher (this course's target), but Java 17's single-file launcher requires the class that contains ",[1096,2111,1917],{}," to come first in the file — see the note in Lesson 25.4's worked example.",[1085,2114,2115],{},"Reorder the fragments below into a working program:",[1159,2117,2118,2124,2130,2136,2142,2148,2154,2160,2166,2172,2178,2183],{},[1162,2119,2120,2121],{},"a. ",[1096,2122,2123],{},"        GearState currentGear = GearState.LOW;",[1162,2125,2126,2127],{},"b. ",[1096,2128,2129],{},"public class GearboxStatus",[1162,2131,2132,2133],{},"c. ",[1096,2134,2135],{},"    }",[1162,2137,2138,2139],{},"d. ",[1096,2140,2141],{},"enum GearState",[1162,2143,2144,2145],{},"e. ",[1096,2146,2147],{},"    public static void main(String[] args)",[1162,2149,2150,2151],{},"f. ",[1096,2152,2153],{},"}",[1162,2155,2156,2157],{},"g. ",[1096,2158,2159],{},"    LOW, HIGH",[1162,2161,2162,2163],{},"h. ",[1096,2164,2165],{},"{",[1162,2167,2168,2169],{},"i. ",[1096,2170,2171],{},"        System.out.println(currentGear);",[1162,2173,2174,2175],{},"j. ",[1096,2176,2177],{},"    {",[1162,2179,2180,2181],{},"k. ",[1096,2182,2165],{},[1162,2184,2185,2186],{},"l. ",[1096,2187,2153],{},[1085,2189,2190,2192],{},[1150,2191,2042],{}," d, h, g, f, b, k, e, j, a, i, c, l",[1085,2194,2195,2198],{},[1150,2196,2197],{},"Interchangeable:"," (h, k) (f, l)",[1089,2200,2202],{"className":1091,"code":2201,"language":1093,"meta":1094,"style":1094},"enum GearState\n{\n    LOW, HIGH\n}\n\npublic class GearboxStatus\n{\n    public static void main(String[] args)\n    {\n        GearState currentGear = GearState.LOW;\n        System.out.println(currentGear);\n    }\n}\n",[1096,2203,2204,2209,2213,2218,2222,2226,2231,2235,2239,2243,2248,2253,2257],{"__ignoreMap":1094},[1099,2205,2206],{"class":1101,"line":1102},[1099,2207,2208],{},"enum GearState\n",[1099,2210,2211],{"class":1101,"line":1108},[1099,2212,1377],{},[1099,2214,2215],{"class":1101,"line":1114},[1099,2216,2217],{},"    LOW, HIGH\n",[1099,2219,2220],{"class":1101,"line":1120},[1099,2221,1405],{},[1099,2223,2224],{"class":1101,"line":1390},[1099,2225,1412],{"emptyLinePlaceholder":1411},[1099,2227,2228],{"class":1101,"line":1396},[1099,2229,2230],{},"public class GearboxStatus\n",[1099,2232,2233],{"class":1101,"line":1402},[1099,2234,1377],{},[1099,2236,2237],{"class":1101,"line":1408},[1099,2238,1836],{},[1099,2240,2241],{"class":1101,"line":1415},[1099,2242,1841],{},[1099,2244,2245],{"class":1101,"line":1869},[1099,2246,2247],{},"        GearState currentGear = GearState.LOW;\n",[1099,2249,2250],{"class":1101,"line":1874},[1099,2251,2252],{},"        System.out.println(currentGear);\n",[1099,2254,2255],{"class":1101,"line":1879},[1099,2256,1866],{},[1099,2258,2259],{"class":1101,"line":1885},[1099,2260,1405],{},[1085,2262,2263,2266,2267,2270,2271,2274,2275,2278,2279,2282,2283,1171,2286,2289,2290,2292,2293,1171,2296,2299,2300,2302,2303,2306,2307,2310,2311,2313,2314,2316,2317,2320,2321,1194],{},[1150,2264,2265],{},"Why this order:"," The enum's header (",[1096,2268,2269],{},"d","), brace (",[1096,2272,2273],{},"h","), constant list (",[1096,2276,2277],{},"g","), and closing brace (",[1096,2280,2281],{},"f",") come first, defining every state the gearbox can be in. Then the class (",[1096,2284,2285],{},"b",[1096,2287,2288],{},"k",") and ",[1096,2291,1917],{}," (",[1096,2294,2295],{},"e",[1096,2297,2298],{},"j","). Inside ",[1096,2301,1917],{},", the state variable must be declared and given its real starting value (",[1096,2304,2305],{},"a",") before it can be printed (",[1096,2308,2309],{},"i",") — the program prints ",[1096,2312,2093],{},". Then ",[1096,2315,1917],{},"'s brace closes (",[1096,2318,2319],{},"c","), then the class's (",[1096,2322,2323],{},"l",[1085,2325,2326,1134,2328,2330,2331,2333,2334,1134,2336,2292,2338,2340],{},[1096,2327,2273],{},[1096,2329,2288],{}," are the same text (",[1096,2332,2165],{},"), as are ",[1096,2335,2281],{},[1096,2337,2323],{},[1096,2339,2153],{},"), so either one of each pair works in either spot.",[1080,2342,2344],{"id":2343},"coding","Coding",[1085,2346,2347,2350],{},[1150,2348,2349],{},"Mode:"," full-program",[1085,2352,2353,2355],{},[1150,2354,2085],{}," A climber has four states, in this order, and a transition table:",[1247,2357,2358,2368],{},[1250,2359,2360],{},[1253,2361,2362,2364,2366],{},[1256,2363,1258],{},[1256,2365,1261],{},[1256,2367,1264],{},[1266,2369,2370,2386,2404,2420],{},[1253,2371,2372,2376,2380],{},[1271,2373,2374],{},[1096,2375,1674],{},[1271,2377,2378],{},[1096,2379,1713],{},[1271,2381,2382,2383],{},"the driver presses ",[1150,2384,2385],{},"deploy",[1253,2387,2388,2392,2397],{},[1271,2389,2390],{},[1096,2391,1713],{},[1271,2393,2394],{},[1096,2395,2396],{},"LOCKED",[1271,2398,2399,2400,2403],{},"the ",[1150,2401,2402],{},"top sensor"," trips",[1253,2405,2406,2410,2415],{},[1271,2407,2408],{},[1096,2409,2396],{},[1271,2411,2412],{},[1096,2413,2414],{},"RETRACTING",[1271,2416,2382,2417],{},[1150,2418,2419],{},"release",[1253,2421,2422,2426,2430],{},[1271,2423,2424],{},[1096,2425,2414],{},[1271,2427,2428],{},[1096,2429,1674],{},[1271,2431,2399,2432,2403],{},[1150,2433,2434],{},"bottom sensor",[1085,2436,2437,2438,2440,2441,2444,2445,1509,2448,2451,2452,2455,2456,2459,2460,2463],{},"The machine starts in ",[1096,2439,1674],{},". Write the ",[1096,2442,2443],{},"enum ClimberState"," (the four states, in that order) and\nthe class ",[1096,2446,2447],{},"ClimberMachine",[1096,2449,2450],{},"getState()"," returns the current state, and ",[1096,2453,2454],{},"update(deploy, topSensor, release, bottomSensor)"," makes ",[1150,2457,2458],{},"at most one"," transition per call. Inputs that aren't the guard for\nthe ",[1220,2461,2462],{},"current"," state are ignored.",[1085,2465,2466,2467,2469,2470,2473,2474,2477],{},"The fixed ",[1096,2468,1917],{}," reads a number of loops, then four ",[1096,2471,2472],{},"0","\u002F",[1096,2475,2476],{},"1"," inputs per loop, and prints the starting\nstate and the state after each update. For the input below:",[1089,2479,2482],{"className":2480,"code":2481,"language":1236,"meta":1094},[1234],"3\n0 0 0 0\n1 0 0 0\n0 1 0 0\n",[1096,2483,2481],{"__ignoreMap":1094},[1085,2485,2486],{},"the output is:",[1089,2488,2491],{"className":2489,"code":2490,"language":1236,"meta":1094},[1234],"start: STOWED\nSTOWED\nEXTENDING\nLOCKED\n",[1096,2492,2490],{"__ignoreMap":1094},[1085,2494,2495],{},[1150,2496,2497],{},"Starter:",[1089,2499,2501],{"className":1091,"code":2500,"language":1093,"meta":1094,"style":1094},"import java.util.*;\n\npublic class Main\n{\n    \u002F\u002F Don't change main\n    public static void main(String[] args)\n    {\n        Scanner in = new Scanner(System.in);\n        int loops = in.nextInt();\n        ClimberMachine climber = new ClimberMachine();\n        System.out.println(\"start: \" + climber.getState());\n        for (int i = 0; i \u003C loops; i++)\n        {\n            boolean deploy = in.nextInt() == 1;\n            boolean topSensor = in.nextInt() == 1;\n            boolean release = in.nextInt() == 1;\n            boolean bottomSensor = in.nextInt() == 1;\n            climber.update(deploy, topSensor, release, bottomSensor);\n            System.out.println(climber.getState());\n        }\n    }\n}\n\n\u002F\u002F TODO: enum ClimberState\n\n\u002F\u002F TODO: class ClimberMachine\n",[1096,2502,2503,2508,2512,2517,2521,2526,2530,2534,2539,2544,2549,2554,2559,2564,2569,2574,2579,2584,2590,2596,2602,2607,2612,2617,2623,2628],{"__ignoreMap":1094},[1099,2504,2505],{"class":1101,"line":1102},[1099,2506,2507],{},"import java.util.*;\n",[1099,2509,2510],{"class":1101,"line":1108},[1099,2511,1412],{"emptyLinePlaceholder":1411},[1099,2513,2514],{"class":1101,"line":1114},[1099,2515,2516],{},"public class Main\n",[1099,2518,2519],{"class":1101,"line":1120},[1099,2520,1377],{},[1099,2522,2523],{"class":1101,"line":1390},[1099,2524,2525],{},"    \u002F\u002F Don't change main\n",[1099,2527,2528],{"class":1101,"line":1396},[1099,2529,1836],{},[1099,2531,2532],{"class":1101,"line":1402},[1099,2533,1841],{},[1099,2535,2536],{"class":1101,"line":1408},[1099,2537,2538],{},"        Scanner in = new Scanner(System.in);\n",[1099,2540,2541],{"class":1101,"line":1415},[1099,2542,2543],{},"        int loops = in.nextInt();\n",[1099,2545,2546],{"class":1101,"line":1869},[1099,2547,2548],{},"        ClimberMachine climber = new ClimberMachine();\n",[1099,2550,2551],{"class":1101,"line":1874},[1099,2552,2553],{},"        System.out.println(\"start: \" + climber.getState());\n",[1099,2555,2556],{"class":1101,"line":1879},[1099,2557,2558],{},"        for (int i = 0; i \u003C loops; i++)\n",[1099,2560,2561],{"class":1101,"line":1885},[1099,2562,2563],{},"        {\n",[1099,2565,2566],{"class":1101,"line":1890},[1099,2567,2568],{},"            boolean deploy = in.nextInt() == 1;\n",[1099,2570,2571],{"class":1101,"line":1895},[1099,2572,2573],{},"            boolean topSensor = in.nextInt() == 1;\n",[1099,2575,2576],{"class":1101,"line":1900},[1099,2577,2578],{},"            boolean release = in.nextInt() == 1;\n",[1099,2580,2581],{"class":1101,"line":1905},[1099,2582,2583],{},"            boolean bottomSensor = in.nextInt() == 1;\n",[1099,2585,2587],{"class":1101,"line":2586},18,[1099,2588,2589],{},"            climber.update(deploy, topSensor, release, bottomSensor);\n",[1099,2591,2593],{"class":1101,"line":2592},19,[1099,2594,2595],{},"            System.out.println(climber.getState());\n",[1099,2597,2599],{"class":1101,"line":2598},20,[1099,2600,2601],{},"        }\n",[1099,2603,2605],{"class":1101,"line":2604},21,[1099,2606,1866],{},[1099,2608,2610],{"class":1101,"line":2609},22,[1099,2611,1405],{},[1099,2613,2615],{"class":1101,"line":2614},23,[1099,2616,1412],{"emptyLinePlaceholder":1411},[1099,2618,2620],{"class":1101,"line":2619},24,[1099,2621,2622],{},"\u002F\u002F TODO: enum ClimberState\n",[1099,2624,2626],{"class":1101,"line":2625},25,[1099,2627,1412],{"emptyLinePlaceholder":1411},[1099,2629,2631],{"class":1101,"line":2630},26,[1099,2632,2633],{},"\u002F\u002F TODO: class ClimberMachine\n",[1085,2635,2636],{},[1150,2637,2638],{},"Scenario 1 (visible):",[1085,2640,2641],{},[1150,2642,2643],{},"Input:",[1089,2645,2647],{"className":2646,"code":2481,"language":1236,"meta":1094},[1234],[1096,2648,2481],{"__ignoreMap":1094},[1085,2650,2651],{},[1150,2652,2653],{},"Expected output:",[1089,2655,2657],{"className":2656,"code":2490,"language":1236,"meta":1094},[1234],[1096,2658,2490],{"__ignoreMap":1094},[1085,2660,2661],{},[1150,2662,2663],{},"Scenario 2 (visible):",[1085,2665,2666],{},[1150,2667,2643],{},[1089,2669,2672],{"className":2670,"code":2671,"language":1236,"meta":1094},[1234],"2\n0 1 0 0\n0 0 0 1\n",[1096,2673,2671],{"__ignoreMap":1094},[1085,2675,2676],{},[1150,2677,2653],{},[1089,2679,2682],{"className":2680,"code":2681,"language":1236,"meta":1094},[1234],"start: STOWED\nSTOWED\nSTOWED\n",[1096,2683,2681],{"__ignoreMap":1094},[1085,2685,2686],{},[1150,2687,2688],{},"Scenario 3 (hidden):",[1085,2690,2691],{},[1150,2692,2643],{},[1089,2694,2697],{"className":2695,"code":2696,"language":1236,"meta":1094},[1234],"6\n1 0 0 0\n0 1 0 0\n0 0 1 0\n0 0 0 1\n0 0 0 0\n1 0 0 0\n",[1096,2698,2696],{"__ignoreMap":1094},[1085,2700,2701],{},[1150,2702,2653],{},[1089,2704,2707],{"className":2705,"code":2706,"language":1236,"meta":1094},[1234],"start: STOWED\nEXTENDING\nLOCKED\nRETRACTING\nSTOWED\nSTOWED\nEXTENDING\n",[1096,2708,2706],{"__ignoreMap":1094},[1085,2710,2711],{},[1150,2712,2713],{},"Scenario 4 (hidden):",[1085,2715,2716],{},[1150,2717,2643],{},[1089,2719,2722],{"className":2720,"code":2721,"language":1236,"meta":1094},[1234],"3\n1 1 0 0\n0 1 1 0\n1 1 1 1\n",[1096,2723,2721],{"__ignoreMap":1094},[1085,2725,2726],{},[1150,2727,2653],{},[1089,2729,2732],{"className":2730,"code":2731,"language":1236,"meta":1094},[1234],"start: STOWED\nEXTENDING\nLOCKED\nRETRACTING\n",[1096,2733,2731],{"__ignoreMap":1094},[1085,2735,2736],{},[1150,2737,2738],{},"Scenario 5 (hidden):",[1085,2740,2741],{},[1150,2742,2643],{},[1089,2744,2747],{"className":2745,"code":2746,"language":1236,"meta":1094},[1234],"4\n0 0 1 1\n1 0 1 1\n0 0 0 1\n0 1 0 0\n",[1096,2748,2746],{"__ignoreMap":1094},[1085,2750,2751],{},[1150,2752,2653],{},[1089,2754,2757],{"className":2755,"code":2756,"language":1236,"meta":1094},[1234],"start: STOWED\nSTOWED\nEXTENDING\nEXTENDING\nLOCKED\n",[1096,2758,2756],{"__ignoreMap":1094},[1085,2760,2761],{},[1150,2762,2763],{},"Solution:",[1089,2765,2767],{"className":1091,"code":2766,"language":1093,"meta":1094,"style":1094},"import java.util.*;\n\npublic class Main\n{\n    \u002F\u002F Don't change main\n    public static void main(String[] args)\n    {\n        Scanner in = new Scanner(System.in);\n        int loops = in.nextInt();\n        ClimberMachine climber = new ClimberMachine();\n        System.out.println(\"start: \" + climber.getState());\n        for (int i = 0; i \u003C loops; i++)\n        {\n            boolean deploy = in.nextInt() == 1;\n            boolean topSensor = in.nextInt() == 1;\n            boolean release = in.nextInt() == 1;\n            boolean bottomSensor = in.nextInt() == 1;\n            climber.update(deploy, topSensor, release, bottomSensor);\n            System.out.println(climber.getState());\n        }\n    }\n}\n\nenum ClimberState\n{\n    STOWED,\n    EXTENDING,\n    LOCKED,\n    RETRACTING\n}\n\nclass ClimberMachine\n{\n    private ClimberState state = ClimberState.STOWED;\n\n    public ClimberState getState()\n    {\n        return state;\n    }\n\n    public void update(boolean deploy, boolean topSensor, boolean release, boolean bottomSensor)\n    {\n        if (state == ClimberState.STOWED && deploy)\n        {\n            state = ClimberState.EXTENDING;\n        }\n        else if (state == ClimberState.EXTENDING && topSensor)\n        {\n            state = ClimberState.LOCKED;\n        }\n        else if (state == ClimberState.LOCKED && release)\n        {\n            state = ClimberState.RETRACTING;\n        }\n        else if (state == ClimberState.RETRACTING && bottomSensor)\n        {\n            state = ClimberState.STOWED;\n        }\n    }\n}\n",[1096,2768,2769,2773,2777,2781,2785,2789,2793,2797,2801,2805,2809,2813,2817,2821,2825,2829,2833,2837,2841,2845,2849,2853,2857,2861,2865,2869,2873,2878,2884,2890,2895,2900,2906,2911,2917,2922,2928,2933,2939,2944,2949,2955,2960,2966,2971,2977,2982,2988,2993,2999,3004,3010,3015,3021,3026,3032,3037,3043,3048,3053],{"__ignoreMap":1094},[1099,2770,2771],{"class":1101,"line":1102},[1099,2772,2507],{},[1099,2774,2775],{"class":1101,"line":1108},[1099,2776,1412],{"emptyLinePlaceholder":1411},[1099,2778,2779],{"class":1101,"line":1114},[1099,2780,2516],{},[1099,2782,2783],{"class":1101,"line":1120},[1099,2784,1377],{},[1099,2786,2787],{"class":1101,"line":1390},[1099,2788,2525],{},[1099,2790,2791],{"class":1101,"line":1396},[1099,2792,1836],{},[1099,2794,2795],{"class":1101,"line":1402},[1099,2796,1841],{},[1099,2798,2799],{"class":1101,"line":1408},[1099,2800,2538],{},[1099,2802,2803],{"class":1101,"line":1415},[1099,2804,2543],{},[1099,2806,2807],{"class":1101,"line":1869},[1099,2808,2548],{},[1099,2810,2811],{"class":1101,"line":1874},[1099,2812,2553],{},[1099,2814,2815],{"class":1101,"line":1879},[1099,2816,2558],{},[1099,2818,2819],{"class":1101,"line":1885},[1099,2820,2563],{},[1099,2822,2823],{"class":1101,"line":1890},[1099,2824,2568],{},[1099,2826,2827],{"class":1101,"line":1895},[1099,2828,2573],{},[1099,2830,2831],{"class":1101,"line":1900},[1099,2832,2578],{},[1099,2834,2835],{"class":1101,"line":1905},[1099,2836,2583],{},[1099,2838,2839],{"class":1101,"line":2586},[1099,2840,2589],{},[1099,2842,2843],{"class":1101,"line":2592},[1099,2844,2595],{},[1099,2846,2847],{"class":1101,"line":2598},[1099,2848,2601],{},[1099,2850,2851],{"class":1101,"line":2604},[1099,2852,1866],{},[1099,2854,2855],{"class":1101,"line":2609},[1099,2856,1405],{},[1099,2858,2859],{"class":1101,"line":2614},[1099,2860,1412],{"emptyLinePlaceholder":1411},[1099,2862,2863],{"class":1101,"line":2619},[1099,2864,1882],{},[1099,2866,2867],{"class":1101,"line":2625},[1099,2868,1377],{},[1099,2870,2871],{"class":1101,"line":2630},[1099,2872,1654],{},[1099,2874,2876],{"class":1101,"line":2875},27,[1099,2877,1659],{},[1099,2879,2881],{"class":1101,"line":2880},28,[1099,2882,2883],{},"    LOCKED,\n",[1099,2885,2887],{"class":1101,"line":2886},29,[1099,2888,2889],{},"    RETRACTING\n",[1099,2891,2893],{"class":1101,"line":2892},30,[1099,2894,1405],{},[1099,2896,2898],{"class":1101,"line":2897},31,[1099,2899,1412],{"emptyLinePlaceholder":1411},[1099,2901,2903],{"class":1101,"line":2902},32,[1099,2904,2905],{},"class ClimberMachine\n",[1099,2907,2909],{"class":1101,"line":2908},33,[1099,2910,1377],{},[1099,2912,2914],{"class":1101,"line":2913},34,[1099,2915,2916],{},"    private ClimberState state = ClimberState.STOWED;\n",[1099,2918,2920],{"class":1101,"line":2919},35,[1099,2921,1412],{"emptyLinePlaceholder":1411},[1099,2923,2925],{"class":1101,"line":2924},36,[1099,2926,2927],{},"    public ClimberState getState()\n",[1099,2929,2931],{"class":1101,"line":2930},37,[1099,2932,1841],{},[1099,2934,2936],{"class":1101,"line":2935},38,[1099,2937,2938],{},"        return state;\n",[1099,2940,2942],{"class":1101,"line":2941},39,[1099,2943,1866],{},[1099,2945,2947],{"class":1101,"line":2946},40,[1099,2948,1412],{"emptyLinePlaceholder":1411},[1099,2950,2952],{"class":1101,"line":2951},41,[1099,2953,2954],{},"    public void update(boolean deploy, boolean topSensor, boolean release, boolean bottomSensor)\n",[1099,2956,2958],{"class":1101,"line":2957},42,[1099,2959,1841],{},[1099,2961,2963],{"class":1101,"line":2962},43,[1099,2964,2965],{},"        if (state == ClimberState.STOWED && deploy)\n",[1099,2967,2969],{"class":1101,"line":2968},44,[1099,2970,2563],{},[1099,2972,2974],{"class":1101,"line":2973},45,[1099,2975,2976],{},"            state = ClimberState.EXTENDING;\n",[1099,2978,2980],{"class":1101,"line":2979},46,[1099,2981,2601],{},[1099,2983,2985],{"class":1101,"line":2984},47,[1099,2986,2987],{},"        else if (state == ClimberState.EXTENDING && topSensor)\n",[1099,2989,2991],{"class":1101,"line":2990},48,[1099,2992,2563],{},[1099,2994,2996],{"class":1101,"line":2995},49,[1099,2997,2998],{},"            state = ClimberState.LOCKED;\n",[1099,3000,3002],{"class":1101,"line":3001},50,[1099,3003,2601],{},[1099,3005,3007],{"class":1101,"line":3006},51,[1099,3008,3009],{},"        else if (state == ClimberState.LOCKED && release)\n",[1099,3011,3013],{"class":1101,"line":3012},52,[1099,3014,2563],{},[1099,3016,3018],{"class":1101,"line":3017},53,[1099,3019,3020],{},"            state = ClimberState.RETRACTING;\n",[1099,3022,3024],{"class":1101,"line":3023},54,[1099,3025,2601],{},[1099,3027,3029],{"class":1101,"line":3028},55,[1099,3030,3031],{},"        else if (state == ClimberState.RETRACTING && bottomSensor)\n",[1099,3033,3035],{"class":1101,"line":3034},56,[1099,3036,2563],{},[1099,3038,3040],{"class":1101,"line":3039},57,[1099,3041,3042],{},"            state = ClimberState.STOWED;\n",[1099,3044,3046],{"class":1101,"line":3045},58,[1099,3047,2601],{},[1099,3049,3051],{"class":1101,"line":3050},59,[1099,3052,1866],{},[1099,3054,3056],{"class":1101,"line":3055},60,[1099,3057,1405],{},[1085,3059,3060,3062,3063,3065,3066,3069,3070,3073,3074,3077,3078,3080,3081,3084,3085,3088,3089,3092,3093,3095,3096,3098,3099,3101,3102,3104,3105,1194],{},[1150,3061,2048],{}," The enum lists the four states in the order the table gives them, and the machine's one field\nstarts at ",[1096,3064,1674],{},", the start state, so it can only ever be one state at a time. Each row of the\ntable became one ",[1096,3067,3068],{},"if"," \u002F ",[1096,3071,3072],{},"else if",", checking ",[1150,3075,3076],{},"both"," the current state and that state's guard. The\n",[1096,3079,3072],{}," chain is what makes it ",[1150,3082,3083],{},"at most one transition per call",": scenario 4 sends ",[1096,3086,3087],{},"1 1 0 0","\n(deploy ",[1220,3090,3091],{},"and"," the top sensor), and the machine only moves ",[1096,3094,1674],{}," to ",[1096,3097,1713],{},", not on to\n",[1096,3100,2396],{},", because the top sensor is not ",[1096,3103,1674],{},"'s guard. Inputs for other states are simply\nignored (scenario 2's top sensor while ",[1096,3106,1674],{},[1522,3108,1524],{},{"title":1094,"searchDepth":1108,"depth":1108,"links":3110},[3111,3112,3113],{"id":1980,"depth":1108,"text":1981},{"id":2079,"depth":1108,"text":2080},{"id":2343,"depth":1108,"text":2344},{"outlineRef":1537,"pairsWith":1967,"status":3115},"new — authored exercises (Multiple Choice + Micro-Parsons + Coding); terminology updated for Commands v3 (mechanism, not subsystem)",{"title":1028,"description":1094},"iPkIFcAzcyeRt1H7J2COripq7QOA2iaVuaUfyTHWXAE",1792718166807]