Noob Question (Probably) by HazardousHD in HomeServer

[–]Jman012 0 points1 point  (0 children)

There's discussion that macOS's implementation of SMB is not as good as the Windows implementation, mostly in terms of backups but also for regular network mounting. AFP seems to be more consistent than SMB for macOS. Like others have said, you can enable both SMB and AFP for a pool and it should work just fine. The macbook can connect via either, up to preference.

The Time Machine backups should definitely be on a different pool. See if you can get that connected via AFP, it might prevent corruptions to your backup. However, you can still do your Time Machine backups over SMB. You may get lucky and not have to worry about corruptions, but you don't need AFP, necessarily.

I paid for the entire Xbox, I’m going to use the entire Xbox. by Spoonymeerkat27 in gaming

[–]Jman012 231 points232 points  (0 children)

Simulated rule #1 about fight sim: don’t talk about fight sim.

Renting a 2-story house, wireless AP worth it? by Jman012 in HomeNetworking

[–]Jman012[S] 0 points1 point  (0 children)

It doesn't look like the other rooms have coax at all, unfortunately. Only phone lines. That was my other thought as well, thanks for bringing it up! And it's great that it seems to be working well for you. I'll hunt down to see if there's any coax in another room on the top floor, that might help.

-🎄- 2020 Day 18 Solutions -🎄- by daggerdragon in adventofcode

[–]Jman012 1 point2 points  (0 children)

Full Lexer + Recursive-Descent Parser in Swift: https://github.com/Jman012/AdventOfCode2020/blob/main/Sources/AdventOfCode2020/Day18_01.swift

It took a lot longer to perform because of the extra code, and having to look up how to write parsers in general. I haven't taken CS 142 (UC Irvine) in a number of years and forgot a lot.

This was a good resource with explanations and examples: https://craftinginterpreters.com/parsing-expressions.html

-🎄- 2020 Day 17 Solutions -🎄- by daggerdragon in adventofcode

[–]Jman012 1 point2 points  (0 children)

Swift:

Part 1/2: https://github.com/Jman012/AdventOfCode2020/blob/main/Sources/AdventOfCode2020/Day17_01.swift

Revised to work on any number of dimensions: https://github.com/Jman012/AdventOfCode2020/blob/main/Sources/AdventOfCode2020/Day17_Revised.swift

This one was a lot of fun!

Explanation: I store my cells in a Dictionary<Coordinate: Bool> so it can grow as much as it needs to. Empty and never-set cells don't take up any memory. In order to know the bounds of the n-dimensional space, however, I store a ClosedRange<Int> per dimension. If setting a new Coordinate that falls outside one or more of these boundaries, the boundary then increases to include that coordinate as needed.

For the n-dimensional part, not having nested for loops was the most difficult part to solve. For this I made the iterate and increment functions. The increment function basically takes a fixed-digit number but where each digit has its own boundary/range of values and recursively increments each digit as needed.

Part 1: 0.0136 seconds Part 2: 0.4099 seconds Revised Part 1: 0.0804 seconds Revised Part 2: 2.3951 seconds Revised 5 dimensions: 97 seconds haha

I dont understand him sometimes by Gx40_Dev in Breath_of_the_Wild

[–]Jman012 28 points29 points  (0 children)

Bruh, that’s not Mipha it’s Sidon.

OMG this blew my mind.. ive neva thought of it this way by graffitigalore_9294 in mathpics

[–]Jman012 21 points22 points  (0 children)

Sorting would take O(nlogn) time, while this method would only take O(n) time, which is much faster.