palotasb
Joined 17 years ago
Joined 17 years ago
> Our dependency resolution algorithm thus is like this:
> 1. Get the top-level dependency versions
> 2. Look up versions of libraries they depend on
> 3. Look up versions of libraries they depend on
...would fail in languages like Python where dependencies are shared, and the steps 2, 3, etc. would result in conflicting versions.
In these languages, there is good reason to define dependencies in a relaxed way (with constraints that exclude known-bad versions; but without pins to any specific known-to-work version and without constraining only to existing known-good versions) at first. This way dependency resolution always involves some sort of constraint solving (with indeterminate results due to the constraints being open-ended), but then for the sake of reproducibility the result of the constraint solving process may be used as a lockfile. In the Python world this is only done in the final application (the final environment running the code, this may be the test suite in for a pure library) and the pins in the lock aren't published for anyone to reuse.
To reiterate, the originally proposed algorithm doesn't work for languages with shared dependencies. Using version constraints and then lockfiles as a two-layer solution is a common and reasonable way of resolving the dependency topic in these languages.
https://docs.python.org/3/library/operator.html#mapping-oper...
Is it there yet?
> Notice: sr.ht is currently in alpha, and the quality of the service may reflect that. As such, payment is currently optional for most features, and only encouraged for users who want to support the ongoing development of the site. For a summary of the guarantees and limitations that the alpha entails, see this reference.
+----------------------------+
| +-----------------------+ |
| | +------------------+ | |
| | | +-------------+ | | |
| | | | +--------+ | | | |
| | | | | +--+ | | | | |
| | | | | ^ | | | | | |
int * * ¦ ¦ ¦ VAR[1][2][3] | | |
^ | | | | | | | | | | |
| | | | | +-----+ | | | | |
| | | | +----------+ | | | |
| | | +---------------+ | | |
| | ---------------------+ | |
| +-------------------------+ |
+-------------------------------+
The type of VAR is a [1-element] array of [2-element] array of [3-element] array of pointer to pointer to ints. I drew a spiral that passes through each specifier in the correct order. To make the spiral correct it has to skip the pointer specifiers in the first three loops. This is marked by ¦.The Right-Left Rule is quoted less frequently on HN but it's a correct algorithm for deciphering C types: http://cseweb.ucsd.edu/~ricko/rt_lt.rule.html
The spiral rule can be modified to process all array specifiers before all pointer specifiers, but then you'd have to specify that the order to do so is right and then left. At that point it's just the Right-Left Rule.
An entrance or exit construction is a place on a road where you aren't just turning onto the road but exiting the road entirely. The most common example from any country would be a private driveway. Pedestrians, cyclists and cars going along the sidewalk, bike path or road have priority against anyone turning into the driveway or turning onto the road from the driveway.
The Netherlands generalizes this concept to some low-priority side streets. If there is a continuous sidewalk (i.e., the cars go up a bump to the level of the sidewalk as opposed to the pedestrians stepping down from the sidewalk to the level of the street). This is not the case in this specific intersection.
This specific turn is onto a street that the article describes as "traffic volume here is low, since only residents will use this street." They probably expect the 1-car buffer to be enough for this intersection. You can see in the video that the 1-car buffer is empty most of the time.
For intersections where they expect more turning traffic (where the one car buffer wouldn't be enough), they add turning lanes that can accomodate more than one car. You can see an example of this a few hundred meters northeast when Graafseweg intersects the Van Grobbendocklaan: https://maps.app.goo.gl/ZmURqawr3oeBX5Sq9
> use a key/password
The previous poster intentionally mentioned password recovery flow. If you can gain access without your password, than law enforcement can too. If you could only gain access with your password, you could consider your data safe.
json is defined as one element
element is defines as ws (whitespace), value, ws
value is defined as one of: object, array, string, number, "true", "false", "null"
Wrapping in {} to make an object or in [] to make a list (which is also not an object) is not necessary to make a valid JSON document. This is also discussed in the Stack Overflow question linked.
Maybe there is more common ground between you and Strong Towns than you'd think? They don't just advocate for "bike bros." Here everyone bikes from kids in elementary school to their grandparents. The key is having separate car infrastructure (roads, highways) and biking/pedestrian infrastructure (streets, bike lanes, pedestrian-only areas).
The net effect is that many people here choose non-car transport (public transport, biking, walking), which reduces traffic. This also makes getting around by car more efficient, for destinations where you need to use a car, because there is less traffic.
If you want to live in a single-family home in the suburbs and own a car, you can do that here too. It's fine because there are roads to get around the country. Not stroads though, so no need to worry about pedestrians or cyclists when you're on a road, so they allow moving faster.
If you want to live in an apartment in the city without owning a car, you can do that here too. It's fine because there is public transport, proper bike lanes and streets to get around the city. Not straods though, so no need to worry about cars.
I'd say it's both nicely looking and quite efficient. Not sure by what metric would an American city be more efficient, but generally I wouldn't want to trade places.
True in 1 dimension, but not in higher dimensions, because, as you say:
> how would you define sign(x) in a higher dimension?
abs(x) is generally defined as distance of x from zero.
The fact that sqrt(x^2) or x*sign(x) happen to give the same result in 1 dimension doesn't necessarily imply that they can be applied in higher dimensions as-is to result in abs(x) with the same meaning. Although sqrt(x^2) is close, but the way to generalize it is sqrt(sum(x[i]^2)).
https://github.com/palotasb