Loading page...
Q&A
Q&ASet members must be hashable, and a mutable list does not have a stable hash.
Sets and dictionary keys rely on a stable hash and equality relationship while a value is stored. A list is mutable, so changing it could invalidate the collection’s lookup structure; Python therefore makes lists unhashable. Use a tuple if its members are also hashable and the value should be immutable.
python
8 minChoose Python collection types by invariants and access patterns, then use map, comprehensions, and reductions without obscuring intent.
Q&A
Q&ABase the choice on ordering, mutation, duplicates, and membership operations.
A list is ordered, mutable, and permits duplicates. A tuple is an immutable sequence suited to fixed records, though named structures can improve readability. A set stores unique hashable values and is useful for membership; do not use it when output order or duplicates are part of the contract.
Q&A
Q&AInspect local socket state and bind address before changing firewall policy.
On Linux, `ss -lntup` lists listening sockets; `netstat` may be available via net-tools on older systems. Confirm the process, address, and network namespace. A service bound only to 127.0.0.1 is not externally reachable; also check container port mapping and host policy.
http
5 minKeep list traversal stable, validate cached representations, and bound retry work when networks fail at ambiguous points.
unix
11 minDiagnose connection failures by separating DNS, routing, transport, listening sockets, and application protocol behavior.
Q&A
Q&AHashMap stores entries in buckets, resolves collisions with linked lists or trees, and resizes when load crosses a threshold.
HashMap uses an array of buckets and computes an index from the hash of the key. Each bucket may hold one or more entries. When collisions happen, Java stores entries in a linked list and later in a tree when the bucket grows large enough. The table resizes when the load factor is exceeded so the map keeps operations efficient. The key idea is balancing fast lookup with controlled memory use.
Q&A
Q&APromise.all aggregates promises already supplied to it. Eagerly mapping a large list can start all work at once, so downstream capacity needs a separate concurrency bound.
Promise.all aggregates promises already supplied to it. Eagerly mapping a large list can start all work at once, so downstream capacity needs a separate concurrency bound.