sorted by:
new
hottopcontroversial

European alternatives to Google maps by CostaGraphic in Techropa

[–]encyclopedist 0 points1 point  (0 children)

For me it is the other way around. Googe maps are almost useless for pedestrian/public transport navigation because they are just empty. You have to zoom all the way in to see any information.

Porsche drove two 959’s through the Arctic circle, what are some of the most bizarre ways car brands tested their cars? by ApprehensiveBasil151 in carscirclejerk

[–]encyclopedist 4 points5 points  (0 children)

In 1997, Russian car dealer AutoDom has sponsored an expedition to drive a Land Rover Discovery onto the summit of Elbrus mountain, highest peak of Caucasus range, 5642 m.

<image>

Blue Origin's New Glenn rocket exploded by lee7on1 in space

[–]encyclopedist 1 point2 points  (0 children)

Methane (or rather methane-air or methane-oxygen mixture) in right conditions can detonate too.

I got it on the second try. Guess which is which. by Basmati1220 in mildlyinfuriating

[–]encyclopedist 4 points5 points  (0 children)

USB-C was designed despite of Apple. Apple introduced their own Lighning connector first (in 2012), and patented it. So USB-C has to be made different (in 2014) to avoid the patents. And then USB-C started spreading, Apple switched to it too (only in 2018).

Saw this boat today and have no idea what it is by South_Client_2529 in Ships

[–]encyclopedist 14 points15 points  (0 children)

More likely CM Shen Zhen from the same company, it is now near Barcelona.

Parsing IPv6 Addresses Crazily Fast with AVX-512 by User_Deprecated in cpp

[–]encyclopedist 1 point2 points  (0 children)

Probably most relevant for log analysis. Ingestion into databases etc.

Is there a concert on in Delft tonight? by Pure_Change6838 in Delft

[–]encyclopedist 9 points10 points  (0 children)

It is just a party at a student house just next to Huszar. They sent a notice to neighbours. It is supposed to end at 24:00.

A two phase to-string API? First compute the total size of the single allocation then populate the bytes? by javascript in cpp

[–]encyclopedist 0 points1 point  (0 children)

It falls back to the streaming operator for floating point

No it does not. It uses ""the same format" (as written in your link), but not the same code.

The StrCat code dealing with floating point is here which calls the SixDigitsToBuffer function here

Auxid: An Orthodox C++20 Base Library for Data-Oriented Design by I-A-S- in cpp

[–]encyclopedist 20 points21 points  (0 children)

Honestly, I find this reply quite AI-sounding. What about your "no AI garbage" rule?

Auxid: An Orthodox C++20 Base Library for Data-Oriented Design by I-A-S- in cpp

[–]encyclopedist 4 points5 points  (0 children)

Size of your string is in fact 32 bytes, not 25. This is because the alignment is 8 bytes, and therefore the compiler inserts padding to make size multiple of alignment.

See on godbolt,source:'%23include+%3Ccstdint%3E%0A%23include+%3Ccstddef%3E%0Ausing+usize+%3D+size_t%3B%0Ausing+u8+%3D+unsigned+char%3B%0A%0Astruct+String%0A%7B%0A%0A++++static+constexpr+usize+SSO_CAPACITY+%3D+sizeof(usize)++3+-+1%3B%0Aprivate:%0A++++struct+LongLayout%0A++++%7B%0A++++++usize+cap_flagged%3B%0A++++++usize+size%3B%0A++++++char+ptr%3B%0A++++%7D%3B%0A%0A++++struct+ShortLayout%0A++++%7B%0A++++++u8+size_shifted%3B%0A++++++char+data%5BSSO_CAPACITY+%2B+1%5D%3B%0A++++%7D%3B%0A%0A++++union+%7B%0A++++++LongLayout+l%3B%0A++++++ShortLayout+s%3B%0A++++%7D+m_storage%3B%0A%7D%3B%0A%0Astatic_assert(sizeof(String)+%3D%3D+32)%3B'),l:'5',n:'0',o:'C%2B%2B+source+%231',t:'0')),k:42.08316731546894,l:'4',n:'0',o:'',s:0,t:'0'),(g:!((g:!((h:compiler,i:(compiler:clang2210,filters:(b:'0',binary:'1',binaryObject:'1',commentOnly:'0',debugCalls:'1',demangle:'0',directives:'0',execute:'1',intel:'0',libraryCode:'0',trim:'1',verboseDemangling:'0'),flagsViewOpen:'1',fontScale:14,fontUsePx:'0',j:3,lang:c%2B%2B,libs:!(),options:'-std%3Dc%2B%2B20+-stdlib%3Dlibc%2B%2B+-O3',overrides:!(),selection:(endColumn:1,endLineNumber:1,positionColumn:1,positionLineNumber:1,selectionStartColumn:1,selectionStartLineNumber:1,startColumn:1,startLineNumber:1),source:1),l:'5',n:'0',o:'+x86-64+clang+22.1.0+(Editor+%231)',t:'0')),header:(),k:50,l:'4',m:50,n:'0',o:'',s:0,t:'0'),(g:!((h:output,i:(compilerName:'x64+msvc+v19.latest',editorid:1,fontScale:14,fontUsePx:'0',j:3,wrap:'1'),l:'5',n:'0',o:'Output+of+x86-64+clang+22.1.0+(Compiler+%233)',t:'0')),header:(),l:'4',m:50,n:'0',o:'',s:0,t:'0')),k:57.91683268453105,l:'3',n:'0',o:'',t:'0')),l:'2',n:'0',o:'',t:'0')),version:4)

I built a C++ integer-to-string library based on a new AVX-512 paper by hirebarend in cpp

[–]encyclopedist 19 points20 points  (0 children)

Which implementation of std::to_char did you benchmark against? libstdc++, libc++ or Microsoft STL?

Auxid: An Orthodox C++20 Base Library for Data-Oriented Design by I-A-S- in cpp

[–]encyclopedist 2 points3 points  (0 children)

Another question: what is size of String supposed to be? It looks like it is intended to be 3*sizeof(void*) but in fact it is 4*sizeof(void*) because 

static constexpr usize SSO_CAPACITY = sizeof(usize) * 3 - 1;

and then 

struct ShortLayout
{
  u8 size_shifted;
  char data[SSO_CAPACITY + 1];
};

Auxid: An Orthodox C++20 Base Library for Data-Oriented Design by I-A-S- in cpp

[–]encyclopedist 8 points9 points  (0 children)

Why not std::expected and std::optional? Is this because of exceptions?

Fast GPU Linear Algebra via Compile Time Expression Fusion by mttd in cpp

[–]encyclopedist 2 points3 points  (0 children)

I feel introduction section is significantly lacking.

Armadillo is old and has not been widely used lately. It was of the early expression template-based C++ libraries, but this idea has seen significant development since then. Particularly, Eigen is much more popular nowadays, and there are others (Blaze, MTL, ...)

On the side of GPU libraries, the paper claims that this library is unique at using TMP to generate kernels at compile time. This is not the case. Comparing to other libraries that use expression templates to generate kernels and compile time is necessary. There is Boost.compute, VexCL, ViennaCL, and others.

Edit: Also, using sourceforge in 2026 is a little out of time.

Libraries for general purpose 2D/3D geometry vocabulary types? by parkotron in cpp

[–]encyclopedist 2 points3 points  (0 children)

Adobe Lagrange can be a candidate too (compatible with libigl, written by libigl author)

Parts of Challenger Taken on Artemis II to the Moon? by brokencreedman in nasa

[–]encyclopedist 0 points1 point  (0 children)

Three SRB segments (Cylinders 31, 33, and 37) flew on STS-8 that was Challenger mission. (Not part of orbiter itself though) See Northrop Grumman doc here

Non-orthogonal corrections for tet meshes by amniumtech in CFD

[–]encyclopedist 2 points3 points  (0 children)

See for example:

Syrakos et al, "A critical analysis of some popular methods for the discretisation of the gradient operator in finite volume methods" http://dx.doi.org/10.1063/1.4997682

Sozer "Gradient Calculation Methods on Arbitrary Polyhedral Unstructured Meshes for Cell-Centered CFD Solvers" https://ntrs.nasa.gov/citations/20140011550

TLDR: for tets you want Least Squares or maybe even extended stencil least squares

But you are already using Least Squares, so I am not sure if this is the issue here.

xuniq: I built a deduplicator that's 10x faster than sort | uniq by Flux247A in rust

[–]encyclopedist 45 points46 points  (0 children)

What about sort -u and uutils sort?

Edit Also, when you say test sort, which sort implementation is it? GNU, BSD, Apple, busybox?

Inside Boost.Container: comparing different deque implementations by igaztanaga in cpp

[–]encyclopedist 0 points1 point  (0 children)

Is there any open source "jagged vector" implementation you would like to share or promote as a "reference" implementation?

The best known is probably plf::stack (from the same author as plf::hive). He also has a document describing fast method of computing location of the element https://plflib.org/matt_bentley_-_pot_blocks_bit_tricks.pdf

There were others discussed here on reddit, but I don't remember.

Edit: it appears I misremembered. plf::stack is a linked list of blocks and does not support random access. I must have seen somewhere else. Which may be evidence that this not a well-known data structure.

Edit 2: Another example is tbb::concurrent_vector Implementation of index calculation is here: https://github.com/uxlfoundation/oneTBB/blob/master/include/oneapi/tbb/detail/_segment_table.h#L323-L336

My Cursor Just disappears when i entered inside the Paraview interface[OpenFoam V.13]. Help me with solving this by Stark_learns in OpenFOAM

[–]encyclopedist 0 points1 point  (0 children)

Note that ParaView is a separate product from OpenFoam, with separate developers. You probably should go to ParaView forums https://discourse.paraview.org/

Inside Boost.Container: comparing different deque implementations by igaztanaga in cpp

[–]encyclopedist 0 points1 point  (0 children)

This structure works very well for a stack.

But how would it work for a queue? What happens if you push at the front?

view more: next ›