#dev-general
1 messages ยท Page 444 of 1
if you get a stream of similarities and pipe them into a treeset just to immediately take the top out, that's not a good use
you should look into sorting algorithms for that
that just sorts numbers?
yep
do you remember the o(n) plan I had though?
not at all
the number we're sorting by is a double (0., no +1 value)
we can convert that safely to a long without losing data
the idea from there was to then find a 64 bit array implementation and use the natural ordering of the array to sort the numbers, and their corresponding byte array
i.e. the double we convert to a long is used as an index in the array
and at that index in the array, is the byte array
problem was with this idea though is memory usage
True
so wait hold on, we're sorting doubles attached to byte arrays?
ye
the double represents the similarity between the inputted byte array, and the stored byte array
that's a big array
what's the range of numbers that those longs could end up being
i think just quicksorting would be a lot faster than iterating through like 6 million array slots every single time
oh so all the way to the max value
the doubles or the byte arrays?
double = similarity between input byte array & stored byte array
Quicksort does that as well tho technically
basically we're got a big list of byte arrays and an input
end goal is to sort the list against the input
via the double, which is generated by comparing the input and each individual byte array
If an o(n) is possible that should be considerably faster
i mean no it doesn't, it just iterates through the list
i see
it is possible
is the goal to sort the entire list of byte arrays every time
I just need to figure out a way to implement it that doesn't require a max size 64 bit array
we're talking like all the way to Long.MAX_VALUE here
as in, do you need to return the entire collection of byte arrays every time
or just the top x
yes
i mean honestly, it doesn't sound like you need a whole lot of precision here
It does
Im confused about what you mean rn star
I want to return the entire collection every time
hmm
Quick sort visits all elements as well
no like, quicksort iterates through the list which would be like a few thousand each time or something. in his idea we'd convert the doubles to long and you'd have to iterate to like the 6 billionth slot to find the first one
ideally you'd have some magical way to prepare the collection in advance, before you actually get to sorting it
i mean that's the problem ivan, we need to generate a new list of similarity score per query
like leave less work for the sort to perform
fyi, not that I think it's relevant, but these byte arrays are ascii strings
hmm
no
it should vary hugely
they're ascii strings
okay so nothing within like, 0.001 of eachother?
Btw piggy docdex is backed by mongo right?
yes yugi
okay so who needs all this precision
exactly ivan
ah ๐ฅฒ
just convert to int and truncate all but like 4 decimal places
then do your array thing
that's still a huge array
no it's not?
it's not?
yeah but the first entry will be like 300 or something
it doesn't matter the size of the array
you just go till you find the first item
it's 10000 elements if it's truncated to 4 decimals
Is there no way to define the query to mongo itself with the sorting in place?
well no because he has to calculate the similarity in the program yugi
mongo just returns a list of the possible strings it could be
If he can get the score in the query itself he could get mongo to do it I assume
Wouldnt that be faster?
i mean probably not
i like star's idea of truncating the doubles
i'm not following yugi
mongo probably has to quicksort too
it has the added advantage of being able to change how well sorted each portion of the results is
You use lev distance for the Algorithm right?
no
so for the bottom 50(?) percentiles maybe you don't demand 100% accuracy with the sorting
Oh you changed it?
I use a modified jaro winkler implementation
Hmm
okay maybe I don't understand what's happening here, but in my understanding whenever someone types a query, it generates a long map of closeness scores to the original paired with the result
yes
piggy how important is it for the result to be perfectly in order
those closeness scores look like 0.1, 0.22, 0.2345, 0.44, 0.567, 0.7889, 0.999
without any chance of one result being slightly off
ivan it's probably not that important
then truncating the doubles sounds like a really good solution
I should've mentioned earlier that these "optimizations" are purely my curiosity
there's not actually any performance issues in docdex
because that's what truncating the doubles would do
it performs extremely well for what it does
imagine if it performed better!
yes?
truncating digits, or returning a top k, while in practice, probably wouldn't effect the end results at all
it changes the certainty of getting the expected result from 100%, to 99%
so it's worth considering ๐
i don't think it does
it will change the certainty of the result
if you assured me that they were always a little bit apart, dropping the part that's irrelevant wouldn't change anything
well you can't be certain that it's irrelevant
i mean what's the minimum distance?
whatever the smallest decimal that double holds is?
yes
very smol
what's the difference between like potato and potatk
yes
that's gonna take a minute to figure out
piggy why exactly do you need the entire collection to be returned
this is all in the name of getting the target of the search right
why care about the bottom 50% of all possible words it could have been
star what online calculator?
oh damn ivan has a good point, you can get a sorting algorithm that only returns the top like 5 resulsts
yeah that'd make it real fast
cause it just has to traverse the list and pick the best ones then sort like, 5 things
Piggy maybe building a bst out of it could be faster
ye
I've considered doing that before, but my main issue is duplicate names
there are names that refer to the exact same thing, and this is unavoidable
why is that an issue here
BST's have to be unique
nah I think you should listen to Ivan
that only sorting the top like 5 is a lot faster
bst?
binary search tree
binary sexy tree
what yugi suggested
it won't be a top 5, more like a top 100
that'
to factor in duplicate names
that's still small in the scheme of things right
i mean that's what google does for pete sake
yeah
it only shows you the first page of resulsts
so you'd maintain a sorted structure of the top 100 results
Each node in the bst could be a linked list
Like how we prevent hash collisions
Hmm
well there's no reason to use a BST
the only problem we're solving here is how to get the smallest (or biggest) of a list of doubles
he already has a fuzzy algorithm
The bst is not for a fuzzy search
I think it is definitely not worth the overhead to create a full BST for every single search query
this is why sorting algorithms exist
what are you even talking about then lol
it takes a lot of time to create a full BST
by sorting? lmao
No star
Keeping track of leaf nodrs
Altho the issue would be when a collision hits now that I think of it
Hmm
I think a sorting algorithm that stops early is faster than inserting every item into the BST then getting the sorted list from that
yes
You dont need a sorted list after that byw
Thats all you technically need
sorting algorithm that stops after a constant # of iterations is o(n), inserting everything into a tree is nlogn
well you need the top 100 entries from that BST
so you need to insert every element into the BST
then get the top 100 entries from it
can someone link meh funnys and piggys website..?
you guys know what's probably much more relevant to real world performance
caching
piggy do you cache results
thanks
it's really not feasible to cache here due to the nature of the data and the amount of results
you'd need a hell of a lot of disk space to cache the results of every query
well you don't need to cache every query
but what you can do is keep track of which ones are the most popular
is there clips website too..?
I really don't think DocDex has a most popular list
I think DocDex is quite random
there's just too much variation
just whatever someone happens to be talking about
it's not like google where they can easily predict like 90% of stuff
even if docdex was in thousands of servers, I highly doubt there'd be queries that get executed more often than others
well docdex has a bunch of stuff that's not standard libs right?
yes
i imagine those are searched less often on average
than standard libs
though i guess best way to find out is by actually tracking searches
which i want to see the results for
it's not feasible to store the entirety of the standard libs
๐
well you don't need to store it
but imagine this
actually nvm
i just imagined it
and it didnt work out
i was thinking you can maintain a second, smaller array of just standard library stuff and match across that
but that doesn't really make sense i don't think
it really doesn't
how about concurrency
it's already multithreaded
lol
this is ran on a dedi
yeah dude Ivan the only thing that we can improve upon is the sorting algorithm lmao
well the algorithm that is run to get the double from the char array can probably be ran on a gpu right
if it's an intel dedi it's gotta have some semblance of an integrated card on it
ยฏ_(ใ)_/ยฏ
idk either
ah I see you can use a heap to do a one pass top-k results search of something
makes sense, you can fill it up and remove the root every time you insert
Does it really need to go faster than it already goes?
so you put like, the first 100 elements into the heap, then each one after you add it, heapify, then remove the highest (or smallest) item from the top of the heap
no waffle
a foolish question
here's how I'm starting the issue I'm writing
it's not does it, it's can it
There's not actually anything wrong with the performance of sorting at the moment, but science isn't about why, it's about WHY NOT, and for science I say we research the fuck out of this and find the best way to sort.
piggy is the code you use for all this OS
yes
nice
Here's my project for the day (not designed for mobile yet)
I noticed when I work on plugins my clients are all using different forks of Spigot and whatnot so I had to keep going out to all the websites to make sure I was on the latest. I designed a gateway so you can get all the latest versions from 1 page.
Easy access to latest versions of projects I care about.
i don't do closed source unless it's a commission
star you're a portal fan
did you even notice the reference smh
you were meant to get all excited
oh yes I see it now, apologies I am extremely tired
nice glare
also that is one slick website glare
OMFG DOCDEX IS OS!!
the cave johnson quote yeah
Eh
ok
Here are the ideas that came up in the discord convo today:
- Only sort for top k results
- Truncate doubles to lower number decimals for use in an O(n) array-abusing sort
what else did we talk about?
gpu acceleration
lemons
that's all i remember
also glare's website
okie
*that I got my engineers to invent
actually i'll just put what i was about to say in that
Piggy
hi
what if we truncate then only sort for the top k elements
Does the score have to be a double? Would floats work?
if we truncate then it's an o(n) sort
yugi floats would have the same effect as truncating
so to answer that I don't know
because I don't know if truncating would work either
I'll have to test it in the future
so star there's no benefit doing both
a top k sort is O(n + k) iirc
whereas the truncate is just o(n)
Test
like it is so smart to just like, multiply by a thousand or something then add to array, then traverse the array until you find a not null thing
counting sorts rely on this array technique
Piggy
hi
Radix sort
oh that is literally what we're doing
still requires a 64 bit array without truncating though
yeah star
they're very similar
although both counting & radix sort do extra steps that I wasn't planning on doing
wow i am but a virgin to the world of sorting algorithms lmao
mr freshman lmao
i just took a DS&A class and we learned 4 sorting algorithms, barely lmao
You can use counting in radix without having a huge array
but yeah you just multiply by 100 (or maybe 100 if you wanna get frisky) and truncate any decimal place, then add to array and iterate until you get 100 results
what's the iteration at the end for
that sounds like an extra useless step
yugi i'll look into radix sort
that's how you get the values?
Alrighty
just return the array star
it'd just be an array with like a million empty slots
you need to traverse that array until you find non-null slots
you'd need to traverse the entire array, as the indices aren't guaranteed to be in consistent increments
unless the 100 is the top k bit
if you want the smallest number, you go like 1->50 (that's 1), then 50->200(that's 2), etc.
just go backwards from the top if you want the biggest number
so yeah that'd be O(n + kish)
and that's where big o annoys me
because if instead of just getting the first k non null elements, and we went through the entire array
the complexity would just be O(n)
deceives you
yeah that's why big oh is only one part of the picture
you also gotta look at what its doing and stuff
Big oh only represents variation with input size
Small update, I just added in flex grid crap so it should look decent on mobile now.
dang Glare wish you were in my web dev final project group
those guys could not figure out flex grids
Thats awesome glare
You probably don't want me in your web dev stuff. I used to do web and now I can't do it to save my life.
Wait, are you part of the purpur team as well?
Ahh
flex is ez
damn imagine being cool enough to have clients
I used to have Waterfall and Bungee but neither of them have actual icons that I could manage as SVGs.
meanwhile my mind is blown by radix sort lmao
lol
When I tried to convert Waterfall's logo to SVG, it did not turn out pretty.
bootstrap is modularised and you can use its grid system without using the entirety of bootstrap
I suck at designing stuff
Yeah that's what I went in and added real quick. I was already using Bootstrap but I just added in rows / cols
would highly recommend
yeah i used bootstrap grid for my personal portfolio I had to make
I use bootstrap on every site I make
https://piggypiglet.me is made with bootstrap
so is helpch.at
mine or helpchat?
Elm-Bootstrap ๐คค
yeah I don't use scss or any of that fancy shit
Meaning you don't use any SSG.
just raw css/js/html
Yup
best way to do it
If I had the patience for it, I would.
ssg?
But I work with GraphQL and some other data too which is kind annoying as raw.
Static Site Generators
Gatsby, Nuxt, Etc.
wait piggy, why are you calculating the entire sorted result array all at once again?
That gateway page uses Gatsby (react).
oh I see
ivan that terminology isn't quite correct
Come on Piggy smh
Solid on best practices though
ivan there's a stream of byte arrays and an input byte array
end result is a sorted stream of byte arrays against the input
Apparently it doesn't like your image sizes and extra css
right
bruh
๐ฌ
those images are optimized fine
so piggy when would you use the second best result from that query
every time that method is run ivan
๐
that method is only run if there isn't an exact match
You ever going to add more content to the barn?
d;spigot playah
public interface Player
extends HumanEntity, PluginMessageRecipient, Conversable, OfflinePlayer```
Player has 18 super interfaces, 89 methods, and 4 extensions.
Represents a player, connected or not
This could go very well, or insanely stupid
waffle I wrote a new guide recently
Ooo?
right but i mean if there is no exact match, don't you just want the next best
why get the entire sorted list
public interface Player
extends HumanEntity, PluginMessageRecipient, Conversable, OfflinePlayer```
Player has 18 super interfaces, 89 methods, and 4 extensions.
Represents a player, connected or not
8
discord can display a max of 10
is it possible to get to the 11th
there's a hard cap of 10 in the api
Cant you have 20 reactions on a message?
so if you're only getting the 10 best, why find the entire sorted list
only 10 number emojis
Ah, right
you don't need to ig
๐
i was under the impression you didn't already truncate results
Time to create emojis up to 18
I don't
but now that i know, you definitely want to do top k
well you just said you have a limit of 10
yee
the truncate happens when they're returned in the api
because I don't want hundreds of mongo calls
the only thing stored in docdex's memory is names
those names are used to query mongo to get the objects
๐ฅญDB
that's one red looking mango
wait
so lets take your sorted, finished array of size 100k
would it matter at all if it was size 50 instead of size 100k
as far as mongo calls or whatever go
actually maybe that was a bad example
yeah I don't understand what you're asking
anyways you're only calling the sort function one time either way
but by truncating it you're making it o(n) instead of nlogn
and you're not losing anything since you truncate it later on anyways
technically it's still possible to get o(n) rn
the truncate just makes it more resource friendly ram wise
arrays are essential for an o(n)
the truncate is part of the array idea
they're not separate
the truncate is merely a solution to the memory issue with arrays
wait i think you're misunderstanding me
@frail glade this is what I usually use for site performance
when i said truncate i meant in the context of truncating the result array
i'll have a look at that web.dev thing
as in, i return the top 50 results instead of all 100k
oh
i didn't mean truncate as for the indexes
Ivan, to get the top 50 results you still need to sort to a point
web dev uses lighthouse internally
you do but you can consider it constant time instead of logn time (times n)
then why r the results different
:x2: You have to be in a voice channel to use this command.
ยฏ_(ใ)_/ยฏ
Music used /
What?
Ok wait
Let me see if I can understand what you mean
So given an array of 100k elements of random values, how do you select the top 50 values
okay so
first let's make it simpler and say top 1 value
I literally get different results to you in web.dev
now what if we want the top 2
Top 1 is possible with O(n) but not the same with top k
https://i.imgur.com/RxCE52w.png that's what I got for my page ๐
no
check your ping to the ip waffle
it is possible if the k is small
You now have another list to sort
maybe you've just got a bad route
Hmm
you do but the k is small and not determined by n
Pretty sure web.dev uses their own routes.
so it's still n time
if the list you were managing was a ratio of n, like say you requested half the total list
then you could say insertion into your result array is log(n/2)
or whatever
but k is a small constant like 50, independent of the number of elements in the actual array
Ok so like a replacing insertion sort on a size k array while iterating iver the main array?
I gotta go
sure
really any insertion works here
That could work
because as long as the max size of the accumulator is small it's o(1)
even if insertion was technically o(n^3) it'd really be o(1) lol
i mean would the heap sort idea be too bad?
iterate through the array and keep the best items and drop the newest one
star this is your heap sort all over again lol
but the heap sort is not the important bit
the important bit is that you're only holding on to a small amount of results
that's the saving grace
yeah that's the whole heap sort idea
ye
you only keep the 50 best resulsts or whatever
exactly
exactly
e x a c t l y
wow we're geniuses
where's that github issues lmao
my master thesis is complete
very masterful
sure it is?
I have not
I don't
start spamming
just woke up and preparing for another day of mental torture trying to fix my dual boot
Tis 11am
me an u both johnny
better than taking a calc test
although i'm not going through dual boot torture
more so partition torture
still linux tho
so it counts
what's wrong with your partitiosn?
I have to merge a second disk to the root partition
sounds like a RAID 0 problem
- it isn't
- "just" is one hour ago and it's a Sunday
it's remote
you know what you may be able to do
you can still live boot a usb remote
shrink your current partition that you're using as much as you can
and use the empty space on the drive to make a new partition
that's the approach I'm taking
then raid 0 that with the other drive
it's so fucking hard though
well I wasn't gonna do raid 0 I was gonna use lvm
lvm?
logical volume manager
tbh lvm is probably a better idea as far as data recovery
since i doubt it stripes the partitions
unlike raid 0 ๐ฅฒ
I managed to shrink the partition to 50gb and boot from it
but the problem is fdisk doesn't know that the partition is smaller
like df -h shows 50gb
but fdisk doesn't
and it's confusing the fuck out of me
oh LVM and RAID 0 are the same
no they're not
they have completely different purposes
though LVM seems better apparently
you can achieve the same thing with both but lvm is very different to raid 0
both ways to combine drives
that's not lvm's focus
can lvm use all the space on two partitions of different sizes
it's just possible to do with lvm
lvm is like an abstract partition manager
that's how I think of it
see that's when you just use Btrfs
binary tree fs
i personally like to pronounce btrfs as butter-fs
Lol
the difficulty comes with changing the root partition while it's live
it's by far the hardest thing I've ever had to do
literally every guide doesn't work
just boot from a logical usb drive piggy
well I managed to do it eventually
oh actually
like the partition size is 50gb now
the problem is fdisk doesn't recognise it for some reason
tried chrooting
yes from a usb drive ivan
tried pivoting root
the very obvious answer here is usb boot, then you can modify your drives however you want
how do you usb boot on a remote server?
I don't know what you mean
We can just ask the provider to plug in an USB
as in, you have an entire cmoputer just for you?
yes
yeah just ask them to plugin your usb
actually there might be something about that
They will not*
also why would you want a dedi vs a VPS
what if you make a small partition and burn an iso onto it or somethin
sounds a lot less flexible
wdym
you can dynamically resize a VPS
you're stuck with whatever dedi you get
hardly ivan
hypervisors are so good nowadays
with a vps though you're sharing resources
you can do GPU passthrough and everything
who cares?
you still get your allotted portion
i mean I guess if you get a poor host
i mean that too but i'm talking purely based on the software used
you know how you can limit the resources that docker containers use
you wouldn't use a docker container
you'd use a hypervisor
which is very good at its job
well same principles
nope
as far as sharing resources go?
no, hypervisors have total control
docker can only work within the operating system
a hypervisor can literally only show you 4GB of ram, a limited number of CPU cores, a specific graphics card etc
it's not possible for you to use more than that
in fact, you often specifically use a hypervisor on your own dedicated machines to ensure that your programs don't resource creep on eachother
imagine this on the hardware level
you have two programs, one using a single core on the cpu
no matter who has control over them or what's going on, they're both left up to the will of the cpu itself as to what happens with the l1, l2, l3 cache
so you'll end up with a bunch of stuff overwriting caches and losing you out performance
without you being able to tell why
that's why server-grade cpus have multiple caches
you can't guarantee that each vm will get their own cache
i mean you can if you limit the vms
you can perfectly split a system if you have the right stuff for it
but I mean, I guess its all about what you value more
flexibility or a lil bit of performance
figured out the fdisk issue
you also have to keep in mind that multithreading will always be a thing
the script I used only resizes the filesystem
the partition doesn't actually change
so back to square 1
as in, 2 vcores for every physical core
okay?
so if one vps gets one vcpu and the other gets the other
nobody does that
unless you're getting a bottom-tier vps, you get at least 2 vcpus
yeah and you're not guaranteed that they're on the same core
yeah doesn't matter, it knows which vcpus belong to which core
so you just assign in pairs
though I guess my experience is more from a company hosting its own servers than a hosting company
so maybe vps's are worse than I thought lol
discord broken
@quiet depot what sorting method is used atm?
default java sort the entire list
So timsort
Not sure what's gonna beat timsort
not sorting the whole list?
Maybe
just keeping track of the top k results in a heap as you traverse it is quite efficient
Yeah
okay glad we caught you up lmao
@old wyvern does this look right to you?
Yea, looks about right
Hes following that guide from the manjaro forums i followed as well I think
@lunar cypress unless you can think of a benefit off the bat for separating them, then I don't think it's worth it
from years of using linux on the server & desktop, I've never seen the point or needed to separate them
mhhm
maybe I should try the "install alongside windows option" again
my current problem is that windows simply isn't recognised anymore
Did you have you use rescue earlier or were the partitions not actually deleted btw?
Idk which partition I deleted. But I deleted one on my hdd
however I can still mount the other one and that's where all the data is
ah ok
man
I don't want to reinstall and end up with nothing working at all
right now at least I can get into manjaro
But I'm really stumped as to why I can't get into Windows anymore
Manually adding the menu entry to the grub config might work
yea thats a different boot partition
Gimme a minute
Ill need to look this up
oh john, this might be the same issue as what you found earlier on forums
Thanks again for the response. sudo parted -l Model: ATA Samsung SSD 840 (scsi) Disk /dev/sda: 120GB Sector size (logical/physical): 512B/512B Partition Table: msdos Disk Flags: Number Start End Size Type File system Flags 1 1049kB 368MB 367MB primary ntfs boot 2 368MB 119GB 119GB primary ntfs 3 ...
no, this is not the same
ah alrighty
I have gpt everywhere
Oh btw you also disabled fast boot from windows power settings right?
fast startup you mean? yeah
god maybe i did install windows in legacy mode?
Idk how to find out
that's an Arch recommendation
not necessary though
I don't do it because I think it's a bit stupid personally, but to each their own
it's pointless having two separate partitions because they're both on the same drive
imo
The windows boot partition is the one called "Microsoft reserved partition"
I believe
no
well, depends
for EFI systems, a boot partition is unnecessary, and so it's on the same partition as the main drive
UEFI requires it to be in the efi partition afaik
or at least, it is for me
A Microsoft Reserved Partition (MSR) is a partition of a data storage device, which is created to reserve a portion of disk space for possible subsequent use by a Windows operating system installed on a separate partition. No meaningful data is stored within the MSR; though from the MSR, chunks may be taken for the creation of new partitions, wh...
Well there was no efi partition prior to my manjaro installation... i think
๐ฌ
If there was, I actually deleted it
Did anyone tried to run a fabric server with Cardboard for Bukkit support?
Ok the question is how tf do I get out of this then
If I reinstall windows, will it be smart enough to put itself in the efi partition?
Yea probably
startup repair from your windows installation usb* should probably fix it
Well the guide there wants me to format the efi partition
In this?
Yes
I think it might be safer with startup repair
Whats that
Was that what you did originally?
The windows startup repair tool, it should show up in the options if you try to boot from the windows installtion drive you made earlier
And btw the dual boot guide used a new partition as well?
Yes
As efi partition
That was an extra boot partition to isolate manjaro in
You should already have had one for windows
Ah
Yes
And that didn't setup grub properly? Weird
And I accidentally installed that in legacy mode. And then for some ungodly reason I thought doing it manually might work
Senpai ;c
bonjour
Start up repair doesn't do anything @old wyvern
Maybe I can create a second efi partition
For windows again
find the volume letter which belongs to the installed Windows OS
Do they mean C?
Yes
Got re labelled to D for me lol but alright
Anybody?
failure when attempting to copy boot files
๐ฅฒ
๐ฅฒ
Did anyone tried to run a fabric server with Cardboard for Bukkit support?
how do I un-link my github..?
From discord?
User Settings -> Connections -> Press the "X" on top right of the github card there
I don't know about him, but maybe from the Discord bot here
I changed my username and now I can't get the reward for starring the Github repo 
Ah, I have no idea. @pallid gale ?
na..barry
also funnycube barry bad coz it dosent let me turn off e cloud updates
I hate people on spigot to be honest, Instead of asking for help in a support discord, they put a 1 star rating straight away ๐
๐ฅฒ
And now I have a 1 star on my plugin fucking great, that's gonna put people off ๐
take tips from frosty, frozenjoin only 5 star reviews!!!
lol
Legit, instead of joining the discord to get help he just puts a bad review straight away ๐
Hire a hitman
u can get the review taken off individually by a staff member if its not an actual review
he put "Plugin is badly coded, Doesn't even function correctly. Still has the same problems as the free version." there was no messaging me asking for support to fix anything first just straight up bad review.
Oh looking at his review history he 1 star reviews everyone.
well then code properly in the first place and u wont have this situation :kekw:
bm coded it in the first place
classic
ofc it was trash if BM made it ๐คก

๐
I want to smash something
Understandable
me too
Not even my fucking live windows usb stick works anymore
๐
Huh
time to switch to linux!!!
Please smash my head in
Idk what to do anymore
Linux time
Yeah... great
Maybe just delete everything and start from scratch if you can
also, this is why you don't mess with GParted without first understanding the consequences your actions may have if you fuck up, and without at least somewhat knowing what you're doing
Thank you bardy please lecture me on more things
not insulting your intelligence, just saying that maybe messing with partitions wasn't the best idea
๐
I guess all I can say about this though is https://tenor.com/view/slow-clapping-men-clapping-slowly-clapping-slowly-slow-clap-men-gif-18948220
Yeah thanks for telling me mate, wouldn't have that figured out myself
lol
So
"I messed up"
"Maybe don't mess up"
Groundbreaking
What are we looking at
not what I said
just said you maybe should've read the big board at the beginning of the tunnel that said "warning! danger ahead!"
Yeah I don't have the patience for this nonsense now
Well idk, feels like starting from scratch might be a good idea. Any recommendations how to save my current C: drive?
Woops
Wrong msg
also, there's a tool in Arch that can convert MBR partition tables to GPT ones without data loss
I did it with my drive
His is already gpt
Just use windows ๐คก
I don't have any mbr partition tables
ah right
starting from scratch usually works well. If you've got anything important you could just boot into Linux usb and move it onto another drive
so what's your issue? Windows isn't being picked up?
is it picked up in the UEFI boot menu?
Nope
os prober isnt finding windows boot manager
He doesnt have the efi boot partition for windows
if it's not in the UEFI boot menu then it's likely corrupted
just the boot manager that is
Windows has tools to repair the boot manager iirc, you'd just need some way to get into command prompt
which is much easier said than done, trust me I've tried it before
Yeah I'm too far in, I'll copy my previous user files to my hard drive and start from scratch
Starting from scratch is definitely the easiest way of fixing stuff when you mess things up
reinstall windows first
What would you recommend for cleaning up all the partitions? Do I just delete them all?
format and delete
Probably don't even need to format
delete them, move them around, etc.
But yea just delete the partitions and let the reinstall overwrite stuff
GParted will auto-format when it's deleting partitions
Ah ok
just give Windows something to work with and it should be happy
Just need to be careful to not install windows in legacy mode this time
Did someone say legacy ๐ ๐ซ
you don't get control over that unfortunately
but if you give it a GPT drive, it'll pick GPT
The thing is, it keeps enabling csm in bios
silence
it was 2003llh
by Khalid and Marshmello
anyone know of any plugins that uh allow you to type like [&aB&bu&ci&dl&ed&fe&1r] on a single line of a sign
?
i would assume that the character limit that players can type on a sign is a client limitation
or do you mean chat color
theres some plugin out there where you can right click the sign
and then type like /line1 (color coded crap here)
i used to see it all over lol
well i just googled for it and the first result is https://www.spigotmc.org/resources/colored-signs.31676/
ye i was tryna find it myself looking up anything i could and all the plugins i can find do is just allow u to have hex or whatnot
Whats yarn?
alternative to npm afaik
how u type in a code window?
```
code here
```
2222
ok thx
stop launching your children across the room goddammit
๐ฑ
fixed it ๐
can you now launch your children
i dont want to think about what launching children with bash is
Obscure british sports
how do i get tiers?
obscure? that's like the #1 british sport
#chat-reaction for cool kids ๐
u can get ultimate for free if ur a student
I wouldn't buy ultimate
really?how
If I weren't a student I would at least make my company pay for it
Ultimate is only good if you're making projects which use a DB constantly