Obviously you may do something like so to get the number 120.
char x = 'x';
int number = (int)x;
I would offer that this is also legit for getting \r
char enter = (char)13;
Obviously you may do something like so to get the number 120.
char x = 'x';
int number = (int)x;
I would offer that this is also legit for getting \r
char enter = (char)13;
The file may just be in some dumb locked state when you get the ENOENT error. Try stopping and restarting the server. I fixed this problem for myself with as much today.
One of the things the let scoping around if/then statement affords is that you may use a let variable with the same name in different cases of a case/switch statement if you just nest that variable's instantiation each time inside of a truthy/false check in an if statement.
My match variable here ended up being a single object and not an array of objects.
let match = _.find(this.attorneyFilterList, function(item) {
return item.label == potentialState.openingTier;
});
Addendum 12/10/2019: In the video clip here I meant Knockout when I said Bootstrap. Ha! I was distracted.
Addendum 1/30/2020: My reference to Bootstrap here is not ridiculous after all. I looked into it and Bootstrap, which has a good deal of JavaScript to it, basically is a Mickey Mouse GitHub project.
Six Sigma is a spec for improving a process. Define, Measure, Analyze, Improve, and Control are the five steps in the six, which doesn't make sense. Also, it might be Define, Measure, Analyze, Design, and Verify too. I'm just glancing at the Wikipedia write up and I don't really care. TOGAF is The Open Group Architecture Framework and there is a certification you can get along these lines. I guess there are a handful of different certifications in different technical oddities.
The difference between this and Big O is that Big O has to do with exponential complexity, the same list to loop through potentially having to be looped against for every step in an outer loop, etc. The "find the longest palindrome" example would apply to Big O. In little o the inner loop is just a different thing altogether with its size not bound to the size of the first loop to being with. An example might be one in which we have two lists of words and we want to make a third list that only has words in both the lists, perhaps to give bonus offers to customers (usernames for the words) enrolled in two separate loyalty programs or some such hogwash. Also, you can see the right way and the wrong way to this, right? The wrong way makes for easy to read code but is expensive. You could just have a loop across the first list with a loop inside for the second list creating an a times b level of expensive/complexity. The better thing to do is to sort both lists alphabetically and then increment a position in the second list appropriately as you walk the first list and therein just walk the second list once. Also, Big O measures the most expensive possible circumstance while big Ω the least and big ϴ both, and I thought I'd mention it with everything else here. The upper bounds and the lower bounds are the proper terms for what I am dubbing "most" and "least" respectively.