Why are bitwise operators slower than multiplication/division/modulo?

*, %, and / all have fast paths for single-"limb" integers. <<, >>, and & don't. They're going through the general-purpose arbitrary-precision code path.

Tags:

Python

Optimization

Bitwise Operators

Micro Optimization

Related

Why are two different keys overriding each other in an object? How does Kotlin dispatch the invoke operator? Why the constant() solution is more efficient than the easier one in "FP in Scala" 5.8? Table with sticky header and resizable columns without using JQuery How to redirect to a different route in Blazor Server-side Reading data from CSV into dataframe with multiple delimiters efficiently How to add pagination on vue-tables-2 using Laravel rest api? GKE Cluster can't pull (ErrImagePull) from GCR Registry in same project (GitLab Kubernetes Integration): Why? Pip install - do downloaded whl files persist & take disk space? rbenv — 'find_spec_for_exe': can't find gem bundler (>= 0.a) with executable bundle (Gem::GemNotFoundException) DevTools failed to parse SourceMap error after login will redirect to that js file How to list directory size of all child directories?

Recent Posts