recentpopularlog in


« earlier   
Restricting a (pseudo) element to its parent's border-box
This means we cannot add any elements just for visual purposes and we cannot create shapes out of multiple pieces, whether that's directly or via masks. We also want to avoid long, long lists of anything (think something like tens of background layers or box shadows or points inside a polygon() function) in our generated code because, while the results can be fun, it's not really practical to do something like that!
fridayfrontend  css  cssbasics  pseudo-elements  overflow  border-box 
8 days ago by spaceninja
data structures - Why are Red-Black trees so popular? - Computer Science Stack Exchange
- AVL trees have smaller average depth than red-black trees, and thus searching for a value in AVL tree is consistently faster.
- Red-black trees make less structural changes to balance themselves than AVL trees, which could make them potentially faster for insert/delete. I'm saying potentially, because this would depend on the cost of the structural change to the tree, as this will depend a lot on the runtime and implemntation (might also be completely different in a functional language when the tree is immutable?)

There are many benchmarks online that compare AVL and Red-black trees, but what struck me is that my professor basically said, that usually you'd do one of two things:
- Either you don't really care that much about performance, in which case the 10-20% difference of AVL vs Red-black in most cases won't matter at all.
- Or you really care about performance, in which you case you'd ditch both AVL and Red-black trees, and go with B-trees, which can be tweaked to work much better (or (a,b)-trees, I'm gonna put all of those in one basket.)


> For some kinds of binary search trees, including red-black trees but not AVL trees, the "fixes" to the tree can fairly easily be predicted on the way down and performed during a single top-down pass, making the second pass unnecessary. Such insertion algorithms are typically implemented with a loop rather than recursion, and often run slightly faster in practice than their two-pass counterparts.

So a RedBlack tree insert can be implemented without recursion, on some CPUs recursion is very expensive if you overrun the function call cache (e.g SPARC due to is use of Register window)


There are some cases where you can't use B-trees at all.

One prominent case is std::map from C++ STL. The standard requires that insert does not invalidate existing iterators


I also believe that "single pass tail recursive" implementation is not the reason for red black tree popularity as a mutable data structure.

First of all, stack depth is irrelevant here, because (given log𝑛 height) you would run out of the main memory before you run out of stack space. Jemalloc is happy with preallocating worst case depth on the stack.
nibble  q-n-a  overflow  cs  algorithms  tcs  data-structures  functional  orders  trees  cost-benefit  tradeoffs  roots  explanans  impetus  performance  applicability-prereqs  programming  pls  c(pp)  ubiquity 
27 days ago by nhaliday
Use CSS Overflow "Auto" - Not Overflow "Scroll" - When Clipping Most Fixed-Size Containers
Ben Nadel demonstrates the difference in behaviors for CSS "overflow: auto" and "overflow: scroll". Unfortunately, on modern platforms, it's harder to foster a strong sense of this difference. Thankfully, on Apple computers, you can enable more consistent rendering of scrollbars.
css  overflow  weekly.rc 
28 days ago by studiomohawk
Wrapping long words with CSS or HTML – Chris Cid ∣ CJCid
subtitle: How to manage long words when they do not fit to the screen or within a narrow container.
Author describes options for word breaks and overflow, in latin and non-latin alphabets
webdesign  web  design  word  break  wrap  overflow  html  css  text  typography  scroll  reference 
4 weeks ago by piperh
What's the expected level of paper for top conferences in Computer Science - Academia Stack Exchange
Top. The top level.

My experience on program committees for STOC, FOCS, ITCS, SODA, SOCG, etc., is that there are FAR more submissions of publishable quality than can be accepted into the conference. By "publishable quality" I mean a well-written presentation of a novel, interesting, and non-trivial result within the scope of the conference.


There are several questions that come up over and over in the FOCS/STOC review cycle:

- How surprising / novel / elegant / interesting is the result?
- How surprising / novel / elegant / interesting / general are the techniques?
- How technically difficult is the result? Ironically, FOCS and STOC committees have a reputation for ignoring the distinction between trivial (easy to derive from scratch) and nondeterministically trivial (easy to understand after the fact).
- What is the expected impact of this result? Is this paper going to change the way people do theoretical computer science over the next five years?
- Is the result of general interest to the theoretical computer science community? Or is it only of interest to a narrow subcommunity? In particular, if the topic is outside the STOC/FOCS mainstream—say, for example, computational topology—does the paper do a good job of explaining and motivating the results to a typical STOC/FOCS audience?
nibble  q-n-a  overflow  academia  tcs  cs  meta:research  publishing  scholar  lens  properties  cost-benefit  analysis  impetus  increase-decrease  soft-question  motivation  proofs  search  complexity  analogy  problem-solving  elegance  synthesis  hi-order-bits  novelty  discovery 
6 weeks ago by nhaliday
Wrapping long words with CSS or HTML
How to manage long words when they do not fit to the screen or within a narrow container.
fridayfrontend  css  html  cssbasics  overflow  wbr  hyphens  word-break  word-wrap  overflow-wrap  line-break  white-space-collapse 
6 weeks ago by spaceninja
classification - ImageNet: what is top-1 and top-5 error rate? - Cross Validated
Now, in the case of top-1 score, you check if the top class (the one having the highest probability) is the same as the target label.

In the case of top-5 score, you check if the target label is one of your top 5 predictions (the 5 ones with the highest probabilities).
nibble  q-n-a  overflow  machine-learning  deep-learning  metrics  comparison  ranking  top-n  classification  computer-vision  benchmarks  dataset  accuracy  error  jargon 
6 weeks ago by nhaliday
Truncating Multi-line Text with CSS
Firefox 68 will support -webkit-line-clamp (prefixed!), which allows one to trunacate multi-line text using CSS. It’s already been available in Webkit for quite some time.
fridayfrontend  cssbasics  css  line-clamp  clamp  overflow  ellipsis  truncate 
8 weeks ago by spaceninja
Rob Dodson on Twitter: "Shitposting aside... Here's the deal with position: sticky. If you have overflow: hidden on _any_ ancestor element then the whole thing breaks."
“Here’s the deal with position: sticky.

“If you have overflow: hidden on _any_ ancestor element then the whole thing breaks.”

(@popcornpool then added—)
“I know 🤦‍♂️ the spec doesn’t specify the intended behavior. there’s been an issue to open about it for a while:”
css  overflow  hidden  position  sticky  rob_dodson  twitter  2019  bugs 
april 2019 by handcoding
Stack Overflow Developer Survey 2019
Get insights on the world’s developers from the largest and most comprehensive survey ever. Demographics. Technologies. Salaries. Career satisfaction.
stack  overflow  survey  developer  internet 
april 2019 by jennettefulda

Copy this bookmark:

to read