Attention: the list was moved to
https://github.com/dypsilon/frontend-dev-bookmarks
This page is not maintained anymore, please update your bookmarks.
Attention: the list was moved to
https://github.com/dypsilon/frontend-dev-bookmarks
This page is not maintained anymore, please update your bookmarks.
| =Navigating= | |
| visit('/projects') | |
| visit(post_comments_path(post)) | |
| =Clicking links and buttons= | |
| click_link('id-of-link') | |
| click_link('Link Text') | |
| click_button('Save') | |
| click('Link Text') # Click either a link or a button | |
| click('Button Value') |
| <!-- Respect Rollcall --> | |
| <li><a href="http://www.alistapart.com/articles/">A List Apart — for website builders</a></li> | |
| <li><a href="http://abstrusegoose.com/">Abstruse Goose — my favorite comic</a></li> | |
| <li><a href="http://al3x.net/">Alex Payne — technology rambling</a></li> | |
| <li><a href="http://dashes.com/anil/">Anil Dash — on culture, apple & design</a></li> | |
| <li><a href="http://weblogs.mozillazine.org/asa/">Asa Dotzler — on mozilla & software</a></li> | |
| <li><a href="http://www.azarask.in/blog/">Aza Raskin – on design & firefox</a></li> | |
| <li><a href="http://christophzillgens.com/en/">Christoph Zillgens — interface design</a></li> | |
| <li><a href="http://cssremix.com/">CSS Remix — gorgeous designs</a></li> | |
| <li><a href="http://css-tricks.com/">CSS Tricks</a></li> |
| #include <iostream> | |
| using namespace std; | |
| int main() { | |
| int a(1); | |
| for(int i = 1; i < 101; i++) | |
| { | |
| a = i; | |
| if(a % 3 == 0 && a % 5 == 0) |
| #Fizbuzz project | |
| =begin | |
| Write a program that prints out the numbers 1 to 100 (inclusive). | |
| If the number is divisible by 3, print Fizz instead of the number. If | |
| it's divisible by 5, print Buzz. If it's divisible by both 3 and 5, | |
| print FizzBuzz. | |
| =end | |
| def fizzbuzz | |
| (1..100).each do |x| | |
| if x % 3 == 0 && x % 5 == 0 |
| =begin | |
| This is a number analogy to a famous card trick. | |
| Ask the user to enter a three-digit number. Think | |
| of the number as ABC (where A, B, C are the three | |
| digits of the number). Now, find the remainders of | |
| the numbers formed by ABC, BCA, and CAB when divided | |
| by 11. We will call these remainders X, Y, Z. Add | |
| them up as X+Y, Y+Z, Z+X. If any of the sums are odd, | |
| increase or decrease it by 11 (whichever operation | |
| results in a positive number less than 20; note if |
| movies = { Pocahontus: 4, | |
| The_Lion_King: 3, | |
| Grinch: 2, | |
| Jumper: 1 | |
| } | |
| puts "What would you like to do?" | |
| choice = gets.chomp | |
| case choice |
| #include <iostream> | |
| using namespace std; | |
| int firstNumber(int x) // from left to right. Finds the number in the hundreds place. | |
| { | |
| int p, q; | |
| p = x % 100; | |
| q = ((x - p) / 100); | |
| return q; | |