Actively process what you read by pausing to write one-sentence summaries and permanent notes. Use spaced repetition and self-testing to revisit and retrieve ideas over time. Turn reading into action by synthesizing, applying, and linking notes so knowledge sticks.
-
Three Simple Principles of Trade Policy #
, 7 highlightstendentiously
The first proposition is that a tax on imports is equivalent to a tax on exports. Any restraint on imports also acts, in effect, as a restraint on exports. The converse ofthis proposition is also true: when a government undertakes policies to expand the volume of exports, it cannot help but to expand the volume ofimports as well.
Ifone can augment the statement that protection will cost consumers more with the message that it will reduce employment in related industries, one has a politically more potent argument.
One aspect of the answer is that both policies drive domestic resource allocation in the same direction.
By viewing imports not as final consumer goods but as inputs to U.S. production, policy makers can more clearly recognize that the issue is not so much one of"sav- ing" jobs but of "trading off' jobs between sectors.
One of the main lessons of international finance is that trade imbalances reflect net capital flows between countries. ... The United States may have a relatively open mar- ket and foreign markets may be more closed, but these facts would not manifest themselves in the trade balance.
Exports - Imports = Savings - Investment.
-
Family Values #
, 5 highlightsWhen deciding whether to implement a tray or full screen flow, we decided to utilise trays for transient actions that don't need to be permanently on display within the app.
Trays can also function as the starting point for more elaborate flows that ultimately transition to a full screen format.
By encapsulating complex flows or information within compact, step-by-step trays, we distil overwhelming actions into manageable interactions.
In designing the dynamic tray system, our goal was not just to streamline the user interface but to acknowledge that users deserve an uncluttered and focused experience.
By presenting information and options as they become relevant, we respect the user's journey and cognitive load. We ensure that Family simplifies actions rather than complicates them.
Building a great product means respecting not just what someone does, but how they feel while doing it.
-
Treat your to-read pile like a river, not a bucket #
, 4 highlightsIn a world of effectively infinite information, the better you get at sifting the wheat from the chaff, the more you end up crushed beneath a never-ending avalanche of wheat.
The wider point here is that lots of the other ways in which we feel overwhelmed are problems of "too many needles" as well. They involve the attempt to divide our finite time and attention among too many things that all have a legitimate claim on them.
in the end, the only way to deal with a too-many-needles problem is to confront the fact that it's insoluble – that you definitely won't be fitting everything in.
To return to information overload: this means treating your "to read" pile like a river (a stream that flows past you, and from which you pluck a few choice items, here and there) instead of a bucket (which demands that you empty it). After all, you presumably don't feel overwhelmed by all the unread books in the British Library – and not because there aren't an overwhelming number of them, but because it never occurred to you that it might be your job to get through them all.
-
Graphs and arena allocation #
, 3 highlightsGraphs can be represented by adjacency lists or adjacency matrices.
Since Rust has no cycle collection of
Rcpointers, if there is a cycle in your graph, the ref counts will never fall to zero, and the graph will never be deallocated. You can solve this by usingWeakpointers in your graph or by manually breaking cycles when you know the graph should be destroyed.Since graphs can be cyclic, and ownership in Rust cannot be cyclic, we cannot use
Box<Node>as our pointer type (as we might do for tree-like data structures or linked lists)