Explain whole code: rustycheckers/src/game.rsimpl GameEngine {pub fn new() -> GameEngine {let mut engine = GameEngine {board: [[None; 8]; 8],current_turn: PieceColor::Black,move_count: 0,};engine.initialize_pieces();engine}pub fn initialize_pieces (&mut self) {[1, 3, 5, 7, 0, 2, 4, 6, 1, 3, 5, 7].iter().zip([0, 0, 0, 0, 1, 1, 1, 1, 2, 2, 2, 2].iter()).map (|(a, b)| (*a as usize, *b as usize)).for_each(|(x, y)| {self.board[x][y] = Some( GamePiece:: new (PieceColor::White));});[0, 2, 4, 6, 1, 3, 5, 7, 0, 2, 4, 6].iter().zip([5, 5, 5, 5, 6, 6, 6, 6, 7, 7, 7, 7].iter()).map(|(a, b)| (*a as usize, *b as usize)).for_each(| (x, y)| {self.board[x][y] = Some(GamePiece::new (PieceColor::Black));});}

Here, not only do you have a traditional two-dimensional array, but the type of the piece is…

Answered: Explain whole code:

Database System Concepts

7th Edition

ISBN:9780078022159

Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Chapter1: Introduction

Section: Chapter Questions

Problem 1PE

See similar textbooks

Similar questions

PLEASE HELP ME! ? Maximize and use alternative method to this code! package com.btech.pf101; import java.io.bufferedreader; import java.io.inputstreamreader; import java.util.calendar; import java.util.date; public class pawnshopcode { private static final bufferedreader br = new bufferedreader(new inputstreamreader(system.in)); private static string name; private static int age; private static string address; private static string contactno; private static int itemtype; private static string itemtypename; private static final int itemtype_gagdet = 1; private static final int itemtype_jewelry = 2; private static final int itemtype_musicinstrument = 3; private static final int itemtype_homeequipment = 4; private static final int itemtype_landtitle = 5; private static string itemdescription; private static int periodtype; private static string periodtypename; private static final int periodtype_days = 1; private…
function myChoice(items) {if (!this.value && !this.items) {this.items = items[0];} else if (!this.value || (params.length > 0 && params[0] == "rechoose")) {let index = Math.floor(Math.random() * (this.items.length - 0)) + 0;this.value = this.items[index];return this.value;}return this.value;} var a = myChoice([1, "a", 3, false]);console.log(myChoice(3, 12));console.log(myChoice(51, -2));console.log(myChoice("happy", false));console.log(myChoice([1, 2, 3]));console.log(myChoice("rechoose"));console.log(myChoice(a, a)); these are directions and examples myChoice( items ) This function accepts a list of items as input and creates a function that returns a randomly-chosen item. After choosing a random item, that same item will be always be returned, regardless of the functions input, with one exception. If the first input is the string 'rechoose', then a new random item will be chosen and therafter returned. this is KEYYYY!! Examples var a = myChoice( [1, "a", 3, false]…
В.width; } { t = B.type; w = { T.type = C.type; T.width = C.width; } T → B C В > int { B.type = integer; B.width 4; } В — foat { B.type = float; B.width = 8; } { C.type = t; C.width = w; } C - [ num] C1 = array(num. value, C1.type); { C.type C.width = num. value x C1. width; }
treenode adt: class TreeNode(object):def __init__(self, data, left=None, right=None):"""Create a new TreeNode for the given data.Pre-conditions:data: Any data value to be stored in the KVTreeNodeleft: Another TreeNode (or None, by default)right: Another TreeNode (or None, by default)"""self.data = dataself.left = leftself.right = right
class Node { int key; Node l, r; public Node(int item) { key = item; l = r = null; }} class Main{ Node root; Main() { root = null; } void Postorder(Node node) { if (node == null) return; Postorder(node.l); Postorder(node.r); System.out.print(node.key + " "); } void Inorder(Node node) { if (node == null) return; Inorder(node.l); System.out.print(node.key + " "); Inorder(node.r); } void Preorder(Node node) { if (node == null) return; System.out.print(node.key + " "); Preorder(node.l); Preorder(node.r); } void Postorder() { Postorder(root); } void Inorder() { Inorder(root); } void Preorder() { Preorder(root); } public static void main(String[] args) { Main tree = new Main(); tree.root = new Node(27); tree.root.l =…
Implement all the classes using Java programming language from the given UML Class diagram. Note: This problem requires you to submit just two classes: Customer.java, Account.java. Do NOT include "public static void main()" method inside all of these classes. Graders will be testing your classes, using the unit-testing framework JUnit 4. Customer - ID:int -name:String -gender:char 'm' or 'f' +Customer(ID:int,name:String, discount:int) +getID():int +getName ():String +getGender ():char +toString():String "name (ID)" The Customer class models, customer design as shown in the class diagram. Write the codes for the Customer class and a test driver to test all the public methods. Account
Implement all the classes using Java programming language from the given UML Class diagram. Note: This problem requires you to submit just two classes: Customer.java, Invoice.java. Do NOT include "public static void main()" method inside all of these classes. Graders will be testing your classes, using the unit-testing framework JUnit 4. Customer - ID:int -name:String -discount:int Discount rate in percent +Customer(ID:int,name:String, discount:int) +getID():int +getName ():String +getDiscount():int +setDiscount(discount:int):void +toString():String "name (ID)" The Customer class models, a customer design as shown in the class diagram. Write the codes for the Customer class and a test driver to test all the public methods. Invoice - ID:int
class Order { private int orderNum; private double orderAmount; private double orderDiscount; public Order(int orderNumber, double orderAmt, double orderDisc) { orderNum = orderNumber; orderAmount = orderAmt; orderDiscount = orderDisc; } public double getOrderAmount() { return orderAmount; } public double getOrderDisc() { return orderDiscount; } } public class Main { public static void main(String[] args) { int ordNum = 1234; double ordAmount = 580.00; double discountPer = .1; Order order; double finalAmount = order.getOrderAmount() - order.getOrderAmount() * order.getOrderDisc(); System.out.println("Final order amount = " + finalAmount); } }
$marks = array( "Sara" => array( "Programming" => 95, "DataBase" => 85, "Web" => 74, ), "Diana" => array( "Programming" => 78, "DataBase" => 98, "Web" => 66, ), "Amy" => array( "Programming" => 88, "DataBase" => 76, "Web" => 99, ), ); 1 : sort the array by the name of student from A-Z; 2 : search if Ram is exist :if exiset print the value; else : student does not exist 3 : calculate the avg of each student and print it as :the avg for Sara is : 84.66
#include <iostream>using namespace std; class TurtleNode { public: TurtleNode(int babiesInit = 0, TurtleNode* nextLoc = nullptr); void InsertAfter(TurtleNode* nodeLoc); TurtleNode* GetNext(); void PrintNodeData(); private: int babiesVal; TurtleNode* nextNodePtr;}; TurtleNode::TurtleNode(int babiesInit, TurtleNode* nextLoc) { this->babiesVal = babiesInit; this->nextNodePtr = nextLoc;} void TurtleNode::InsertAfter(TurtleNode* nodeLoc) { TurtleNode* tmpNext = nullptr; tmpNext = this->nextNodePtr; this->nextNodePtr = nodeLoc; nodeLoc->nextNodePtr = tmpNext;} TurtleNode* TurtleNode::GetNext() { return this->nextNodePtr;} void TurtleNode::PrintNodeData() { cout << this->babiesVal << endl;} int main() { TurtleNode* headObj = nullptr; TurtleNode* firstTurtle = nullptr; TurtleNode* secondTurtle = nullptr; TurtleNode* currTurtle = nullptr; int babies1; int babies2; cin >> babies1; cin…
Problem 2: Route Planning You are on the development team for a Route Planning application. The team has already developed a class named NavigatorApp for storing and displaying the graph representing the road network. This class has a void displayShortestPath() function which takes the source and destination vertices of the trip and displays the shortest route between them. Using the strategy pattern, draw a class diagram of the system which will allow for the NavigatorApp to display the shortest driving, walking, or cycling route when the displayShortestPath() function is called. You can assume that another developer is in charge of making sure the appropriate strategy is correctly set and for calling the displayShortestPath() function Starter code /* Modify NavigatorApp (if necessary) */ class NavigatorApp { private: Graph map; public: void displayMap(Window * window); void displayShortestPath(Vertex source, Vertex destination, Window * window); /* write pseudo code for this function…
int class Inventory { std::vector<Item*> m_Items; static unsigned int m_ItemsMade; void CreateItem() { std::string name = "Item " + std::to_string(m_ItemsMade); m_Items.push_back(new Item(name.c_str(), 100 * m_ItemsMade)); ++m_ItemsMade; } public: Inventory() { CreateItem(); CreateItem(); CreateItem(); } void Print() const { size_t* nSize = new size_t(m_Items.size()); std::cout << "_____INVENTORY_____\n"; for (unsigned int i = 0; i < *nSize; ++i) { m_Items[i]->Print(); } } }; GetValidatedInt(const char* strMessage, int nMinimumRange = 0, int nMaximumRange = 0); This function should first display the provided message to the screen then use cin to get an int from the user. Error check and validate to ensure a legal integer was entered. If not, clear the cin buffer using clear() and ignore() and try again (Note: the buffer still needs to be cleared even if this step was successful). If a legal integer was entered, check its value to see if it is within the…

SEE MORE QUESTIONS

Recommended textbooks for you

Database System Concepts

Computer Science

ISBN:

9780078022159

Author:

Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:

McGraw-Hill Education

Starting Out with Python (4th Edition)

Computer Science

ISBN:

9780134444321

Author:

Tony Gaddis

Publisher:

PEARSON

Digital Fundamentals (11th Edition)

Computer Science

ISBN:

9780132737968

Author:

Thomas L. Floyd

Publisher:

PEARSON

Database System Concepts

Computer Science

ISBN:

9780078022159

Author:

Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:

McGraw-Hill Education

Starting Out with Python (4th Edition)

Computer Science

ISBN:

9780134444321

Author:

Tony Gaddis

Publisher:

PEARSON

Digital Fundamentals (11th Edition)

Computer Science

ISBN:

9780132737968

Author:

Thomas L. Floyd

Publisher:

PEARSON

C How to Program (8th Edition)

Computer Science

ISBN:

9780133976892

Author:

Paul J. Deitel, Harvey Deitel

Publisher:

PEARSON

Database Systems: Design, Implementation, & Manag…

Computer Science

ISBN:

9781337627900

Author:

Carlos Coronel, Steven Morris

Publisher:

Cengage Learning

Programmable Logic Controllers

Computer Science

ISBN:

9780073373843

Author:

Frank D. Petruzella

Publisher:

McGraw-Hill Education

SEE MORE TEXTBOOKS