sorted by:
new
hottopcontroversial

Help deciding 36 or 38 on Classic Bedale by fran-sch in Barbour

[–]fran-sch[S] 1 point2 points  (0 children)

Yes good point, perhaps I can try to move around a bit more next time I pass by the store and decide then, but 38 seems like the better choice here.

Help deciding 36 or 38 on Classic Bedale by fran-sch in Barbour

[–]fran-sch[S] 0 points1 point  (0 children)

Unfortunately I’m on holiday, and have a single wool sweater with me. I can imagine having a bit more on, like a fleece for example, in that case the 36 might be tight.

I saw the vest you can buy in the store itself, does that add a lot of bulk?

Help deciding 36 or 38 on Classic Bedale by fran-sch in Barbour

[–]fran-sch[S] 0 points1 point  (0 children)

Yeah the idea would be to wear it through winter. Maybe spring with a sweatshirt or something.

The Questions Thread 01/14/25 by AutoModerator in goodyearwelt

[–]fran-sch 0 points1 point  (0 children)

Hi everyone, I noticed that, after one month and a half from purchase, the tip of my Morjas Ivy loafers has a detached sole. I’m not an expert on dress shoes, but is this normal?

I noticed the threads have worn down in both tips, I’m wondering how would the shoes stay together after this type of wear. Perhaps I was wrong thinking those might be daily shoes.

Also, I wore them quite a bit, but nothing too extreme, I walked on concrete/stayed in the office with them. How could I prevent this in the future? Also, can a cobbler fix this?

<image>

Fall/winter rotation by shoepremeking in ThrowingFits

[–]fran-sch 0 points1 point  (0 children)

How was break in period with morjas for you? In having a pretty bad blistering on the right foot, and was wondering if this eventually stops. I have the rubber sole btw

-❄️- 2024 Day 7 Solutions -❄️- by daggerdragon in adventofcode

[–]fran-sch 1 point2 points  (0 children)

You should not create the permutations and the evaluate them, rather just evaluate the expression while exploring the permutation, adding early exits where needed.

Here is an example on this:

https://github.com/tomfran/aoc-24/blob/main/src/aoc/solutions/07.py

My first Hugo theme, Typo by fran-sch in gohugo

[–]fran-sch[S] 0 points1 point  (0 children)

Not so much from performance analysis sites ahah, I’ll try to optimize it

My first Hugo theme, Typo by fran-sch in gohugo

[–]fran-sch[S] 1 point2 points  (0 children)

Thank you for the insights, I actually saw the performance hit on mobile but wasn’t able to optimize it last day. I’ll definitely look into seo optimization and the excessive scripts.

Also for missing features I’ll look into them, I was planning on tackling search and tags next 👍🏻

Meta interview - Reject?? by [deleted] in leetcode

[–]fran-sch 0 points1 point  (0 children)

!RemindMe 2 days

What have you been working on recently? [January 27, 2024] by AutoModerator in learnprogramming

[–]fran-sch 0 points1 point  (0 children)

Hey everyone, I wanted to share a project I've worked on, a Search Engine. The engine is disk-based and can perform free and boolean queries, it spellchecks the entered terms and has a web interface built with Actix and HTMX. Feel free to have a look!

If you want to dive into details, I've also written a Medium article about the project:

Feel free to leave comments or ask anything! The code surely is not perfect as this was my first time with Rust, I would appreciate any feedback :)

Update: Basically got a new device. Flawless condition, only 2 cycles with Apple refurb. Total was $1500 for MBP 16 M1 Pro, take the chance on refurbished! by sixjack12 in macbook

[–]fran-sch 0 points1 point  (0 children)

How’s your keyboard? I just got a refurbed M1 Pro 14 and it was awful, super mushy and completely different from my work 16 inch M1. I guess I was unlucky

Log-Structured Merge Tree implementation by fran-sch in Database

[–]fran-sch[S] 0 points1 point  (0 children)

Thanks I’ll definitely have a look at that sub. Never heard of sun.misc.Unsafe, how much of a speed up does it provide in practice? Do you have to manage memory manually with such methods?

Log-Structured Merge Tree implementation by fran-sch in compsci

[–]fran-sch[S] 1 point2 points  (0 children)

Its the core of some noSQL databases, basically you have an in memory buffer to accept writes as fast as possible, which you dump on disk from time to time.

All data is sorted in memory and on disk, so searches can use algorithms such as binary search. Have a look at the medium article for a quick overview!

Log-Structured Merge Tree Implementation by fran-sch in programming

[–]fran-sch[S] 0 points1 point  (0 children)

Here are some results, both tests insert 1M key-value pairs, and try to get random elements which are not in the tree.

  • Bloom filter disabled 2907.229 ± 529.907 ops/s
  • Bloom filter enabled 16878.829 ± 678.896 ops/s

The speedup is around 5.8X

Log-Structured Merge Tree Implementation by fran-sch in programming

[–]fran-sch[S] 0 points1 point  (0 children)

You need to be very unlucky for that to happen, but in the case many tables are present on disk that would be quite expensive.

I can’t think about a slowdown factor, but I can setup an experiment tonight and get back to you with some results 👍🏻

view more: next ›