| npx -p @angular/cli ng new hello-world-project | |
| then locally can run | |
| npx ng g c hello-world-component | |
Also, check out Advanced Angular Component Patterns on Egghead!
* Titles subject to change
| React | Angular |
|---|---|
| Introducing Advanced React Component Patterns | 00 Introducing Advanced Angular Component Patterns (egghead) |
| Build a Toggle Component (source) | 01 Build a Toggle Component (stackblitz) ([egghead](https: |
rebase vs merge).rebase vs merge)reset vs checkout vs revert)git rev-parse)pull vs fetch)stash vs branch)reset vs checkout vs revert)
| /* Pulled from https://github.com/joyent/node/blob/master/deps/uv/include/uv.h */ | |
| /* Expand this list if necessary. */ | |
| #define UV_ERRNO_MAP(XX) \ | |
| XX(E2BIG, "argument list too long") \ | |
| XX(EACCES, "permission denied") \ | |
| XX(EADDRINUSE, "address already in use") \ | |
| XX(EADDRNOTAVAIL, "address not available") \ | |
| XX(EAFNOSUPPORT, "address family not supported") \ | |
| XX(EAGAIN, "resource temporarily unavailable") \ | |
| XX(EAI_ADDRFAMILY, "address family not supported") \ |
Sometimes you may want to undo a whole commit with all changes. Instead of going through all the changes manually, you can simply tell git to revert a commit, which does not even have to be the last one. Reverting a commit means to create a new commit that undoes all changes that were made in the bad commit. Just like above, the bad commit remains there, but it no longer affects the the current master and any future commits on top of it.
git revert {commit_id}
Deleting the last commit is the easiest case. Let's say we have a remote origin with branch master that currently points to commit dd61ab32. We want to remove the top commit. Translated to git terminology, we want to force the master branch of the origin remote repository to the parent of dd61ab32:
| using namespace System.Management.Automation | |
| using namespace System.Management.Automation.Language | |
| if ($host.Name -eq 'ConsoleHost') | |
| { | |
| Import-Module PSReadLine | |
| } | |
| #Import-Module PSColors | |
| #Import-Module posh-git | |
| Import-Module -Name Terminal-Icons |
| def solution(matrix): | |
| M, N, diagonals = len(matrix), len(matrix[0]), [] | |
| # 1. Get all the diagonals | |
| for row in range(0, M): | |
| col, temp, i = 0, [], row | |
| j = col | |
| while i >= 0 and j < N: | |
| temp.append(matrix[i][j]) |
| function solution(matrix) { | |
| const hauntedRoom = {}; | |
| const numberOfFloors = matrix.length; | |
| const numberOfRooms = matrix[0].length; | |
| let total = 0; | |
| // 1. Loop through each row | |
| for (let floor = 0; floor < numberOfFloors; floor++) { | |
| // 2. For each element in the row | |
| for (let room = 0; room < numberOfRooms; room++) { |
| // Singly-linked lists are already defined with this interface: | |
| // function ListNode(x) { | |
| // this.value = x; | |
| // this.next = null; | |
| // } | |
| // | |
| function solution(l, k) { | |
| if (l === null) return l; // return if the linked list is empty | |
| let dummyNode = new ListNode(); // create a dummy node whose next points to the head of the given Linked List |
| // 217. Contains Duplicate | |
| // Easy | |
| // Given an integer array nums, return true if any value appears at least twice in the array, and return false if every element is distinct. | |
| const containsDuplicate = (nums) => { | |
| // create an empty dictionary | |
| // iterate through the array | |
| // for each integer in the array check if the integer position exists in the dictionary | |
| // if 'yes' return 'true' |