๐ค
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| gcc -pipe -std=c++11 -lstdc++ -pthread -lev -lcrypto ./*.hpp ./*.cpp \ | |
| ./connection/*.hpp ./connection/*.cpp \ | |
| ./interface/*.hpp ./interface/*.cpp \ | |
| ./program/*.hpp ./program/*.cpp \ | |
| ./socks5/*.hpp ./socks5/*.cpp \ | |
| ./utility/*.hpp ./utility/*.cpp |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| GET / HTTP/1.1 | |
| Host: masterchan.me | |
| Connection: close | |
| User-Agent: Paw/3.1.4 (Macintosh; OS X/10.13.3) GCDHTTPRequest | |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| class RoomModel { // In your model .java file | |
| private static final int WIDTH = 4; | |
| private static final int HEIGHT = 5; | |
| private int steps; //USE CONSTRUCTOR TO INITIALIZE. | |
| private Position = new Position(); | |
| static class Position { | |
| // Not necessary to have nested class | |
| // but it is a good approach |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| Point[] S1 = { new Point("p1", 1, 8), new Point("p2", 2, 7), new Point("p3", 3, 6), new Point("p4", 4, 5), new Point("p5", 5, 4), new Point("p6", 6, 3), new Point("p7", 7, 2), new Point("p8", 8, 1) }; | |
| Point[] S2 = { new Point("p1", -8, 3), new Point("p2", -7, 1), new Point("p3", -1, 6), new Point("p4", 2, 4), new Point("p5", 4, 8), new Point("p6", 5, 9), new Point("p7", 7, 1), new Point("p8", 9, 7) }; |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| <?php | |
| $wgSMTP = ( (rand(1,2) == 1) ? | |
| array( | |
| 'host' => "outlook.corporatedomain1111.com", | |
| 'IDHost' => "corporatationname.com", | |
| 'port' => 25, | |
| 'auth' => false, | |
| 'username' => "[email protected]", |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| "details.scrollview.channel" = "่ฎข้ ๆธ ้"; // ?????? | |
| "details.scrollview.errorreport" = "้่ฏฏๅ้ฆ"; // ?????? | |
| "p.t1" = "ๆพ้ๆ็คบ"; // ?????? | |
| "p.n1" = "%@ ๆพ้ไบใ %@ ใ็็ฌฌ%@้"; /*new episode*/ | |
| "push.want" = "ๆณ็"; // ?????? | |
| "push.watched" ๏ผ "ๅทฒ็"; // ?????? |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| package quiz4; | |
| import java.util.Random; | |
| import java.util.Scanner; | |
| /** | |
| * BinarySortedTree for EECS2030 | |
| * | |
| * @author chen256 | |
| * |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| package quiz4; | |
| import java.io.PrintStream; | |
| import java.util.Scanner; | |
| import quiz4.BinarySortedTree.Node; | |
| /** | |
| * This class encapsulates a binary search tree. |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| /////////////////////////////////// | |
| // Mux | |
| /////////////////////////////////// | |
| //Mux 1-bit | |
| module yMux1(z, a, b, c); | |
| output z; | |
| input a, b, c; | |
| wire notC, upper, lower; | |
| not my_not(notC, c); | |
| and upperAnd(upper, a, notC); |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| import java.util.Collections; | |
| import java.util.List; | |
| import java.util.ArrayList; | |
| import java.util.Map; | |
| import java.util.HashMap; | |
| import java.util.Set; | |
| import java.util.HashSet; | |
| import java.util.Random; | |
| // Michael Chen |