Join 📚 Kevin's Highlights
A batch of the best highlights from what Kevin's read, .
**Get Current**
• **Review “Next Actions” lists** — Take inventory of the tasks and reminders you have coming up.
• **Review previous calendar data** — Flip through the last 2-3 weeks of calendar items to look for any outstanding items of things that may require follow-up.
• **Review upcoming calendar** — Zoom in on the future by looking ahead at your calendar items. Ensure that anything you need to prepare for is captured on your task list.
• **Review “Waiting For” list** — Reflect on outstanding items you need from others and make a note of what requires follow-up or impacts your own work.
• **Review “Projects” (and “Larger Outcome”) Lists** — Look through any and all project lists to assess their progress and make additional action items to drive initiatives forward.
• **Review any relevant checklists** — Assess any other lists that are relevant to work and life that may need your attention.
The Weekly Review
Todoist
Load a selected template from a suggester
Show a suggester with different template options.
Load in the selected template from the suggester.
Check out that switch statement!
<%*
const choice = await tp.system.suggester(["Simple Note", "Book", "Music", "MOC"], ["Simple Note", "Book", "Music", "MOC"]);
let output = ""
switch(choice) {
case "Book":
output = await tp.file.include("[[-Book]]")
break;
case "Music":
output = await tp.file.include("[[-Music]]")
break
case "MOC":
output = await tp.file.include("[[-MOC]]")
break;
default:
new Notice("No Matching Template")
}
tR += output
%>
Templater Snippets
shbgm.ca
In [theoretical computer science](https://en.wikipedia.org/wiki/Theoretical_computer_science),
the **CAP theorem**, also named **Brewer's theorem** after computer scientist [Eric Brewer](https://en.wikipedia.org/wiki/Eric_Brewer_(scientist)),
states that any [distributed data store](https://en.wikipedia.org/wiki/Distributed_data_store)
can provide only [two of the following three](https://en.wikipedia.org/wiki/Trilemma) guarantees:
[Consistency](https://en.wikipedia.org/wiki/Consistency_model)
Every read receives the most recent write or an error.
[Availability](https://en.wikipedia.org/wiki/Availability)
Every request receives a (non-error) response, without the guarantee that it contains the most recent write.
[Partition tolerance](https://en.wikipedia.org/wiki/Network_partitioning)
The system continues to operate despite an arbitrary number of messages being dropped (or delayed) by the network between nodes.
CAP theorem
wikipedia.org
...catch up on these, and many more highlights
Readwise