Welcome to part two of ECMAScript 6: Why Should I use it? If you missed part one, you can find it here. This time, we’ll be looking at the following features that ECMAScript 6 brings to the developer:
Tag: Functional Programming
Build a Wikipedia Viewer | The React Way
Today, we are going to build a Wikipedia viewer using React and Webpack in tandem. If you are not familiar with React at all, I recommend that you go through the introductory material first, it’ll save you a headache!
Additionally, we are going to be using ES6 class syntax for creating components, as this is the way React is heading towards. The previous tutorial in this series goes into more detail, so go ahead and take a look if you’d like. Let’s get our hands dirty then…
Weather App | The React Way
January 16th, 2018 Update
As certain sections of this guide are now obsolete, here’s an updated solution proposed by avid reader Goungaf Saâd.
You can take a look at this version in this GitHub repo. Note that he is using create-react-app on this project, so the overall set-up might be slightly different.
This time around, we are going to build our lovely local weather app using React, Webpack and Babel. These 3 tools in conjunction give as enormous power and awesome syntactic sugar for our code.
We’ll make use of ECMAScript 6 classes, promises and arrow functions among others, but first, we need to get a proper environment set up. Navigate to your project folder and run the following command:
Note: If you don’t have Node and NPM installed, take a quick look at this post, that will get you going.
You’ll be asked for a few things, such as app name, author, description etc. Feel free to take your time and fill them in properly, or anxiously press enter to skip everything. Once done, you’ll have a package.json file in your project directory.
FCC Bonfire Series 148: Caesars Cipher
FreeCodeCamp has recently added a few more challenges to the site. One of them is Caesars Cipher. This bonfire will have us write a function that mimics the ages old encryption method allegedly used by Romans back in the day.
It’s one of the simplest and oldest encryption methods, and works by replacing each character in a word or sentence with another one down the alphabet (based on a shift amount). For this exercise, we are told to use a shift of 13. Let me show you an example using the word dog and a shift of three.
- d -> e, f, g
- o -> p, q, r
- g -> h, i, j
FCC Bonfire Series 146: No repeats please
No repeats please. This is a tough one, really. We are going to bruteforce this challenge instead of using clever mathematics this time around. Simply because it will let us do a few more things. […]