Consider this line of code: //Source: https://reactjs.org/docs/hooks-state.html const [count, setCount] = useState(0);How the heck does this work? I threw together a quick test which is shown below.
A collection of articles that serve as a reference or building blocks of either software development, engineering or open source such as Git or Linux references.
I often need to add where clauses to SQL statements. Most folks probably do. It allows me to view recent log entries or recently created records. Rather than hard coding dates, I've been
I wanted to share an old graduate school project I have in my GitHub account. I return to this project as a reference. Not to remind myself of the core pattern but to
I think this illustrates the concept of Big-O complexity pretty good. O(1): random access to an element in a collection, dependent on indexing O(n): list iterations O(n^2): nested loops