Join devRant
Do all the things like
++ or -- rants, post your own rants, comment on others' rants and build your customized dev avatar
Sign Up
Pipeless API
From the creators of devRant, Pipeless lets you power real-time personalized recommendations and activity feeds using a simple API
Learn More
-
Unbelievable...
My company bought me a new laptop. It has 2 512 GB SSDs.
Our IT set it up with windows 10.
ON BOTH SSD.
OM fucking G. How dump you have to be to install windows 10 two times in the same machine? What kind of mental illness is this?41 -
"Aah, time to make a new Android app"
*starts Android Studio*
AS: "Yo yo yo, before you proceed, update all these 512 things in your SDK"
*creates a new Activity*
AS: "Nuh uh, this shit won't work without this, install it"
*runs app on emulator*
AS: "Hoooold your horses, you need to install this, and this, and update this and this.. oh and also that"
*emulator finally runs, app crashes*
AS: "Ohh, ha ha, oopsies, your Gradle config is also screwed up, change every dependency to the newest version and then update them all"
*config finally done, runs again*
AS: "Umm, I am too lazy to sync it myself, so you must press the nice big button on top to sync it"
"Fuck this"
*closes Android Studio*
AS: "WAAAIT WAIT, before you go, a new Android update just showed up, you must upd..."
*alt+f4*5 -
So here's the new hotness... HP Envy X360.
I7
32 GB RAM
512 Gb SSD
1 TB HDD
Blows my old MacBook Pro away.
63 -
API Guy.
He has a serious regex problem.
Regexes are never easy to read, but the ones he uses just take the cake. They're either blatantly wrong, or totally over-engineered garbage that somehow still lacks basic functionality. I think "garbage" here is a little too nice, since you can tell what garbage actually is/was without studying it for five minutes.
In lieu of an actual rant (mostly because I'm overworked), I'll just leave a few samples here. I recommend readying some bleach before you continue reading.
Not a valid url name regex:
VALID_URL_NAME_REGEX = /\A[\w\-]+\Z/
Semi-decent email regex: (by far the best of the four)
VALID_EMAIL_REGEX = /\A[\w+\-.]+@[a-z\d\-.]+\.[a-z]+\z/i
Over-engineered mess that only works for (most) US numbers:
VALID_PHONE_REGEX = /1?\s*\W?\s*([2-9][0-8][0-9])\s*\W?\s*([2-9][0-9]{2})\s*\W?\s*([0-9]{4})(\se?x?t?(\d*))?/
and for the grand finale:
ZIP_CODE_REGEX = /(^\d{5}(-\d{4})?$)|(^[ABCEGHJKLMNPRSTVXY]{1}\d{1}[A-Z]{1} *\d{1}[A-Z]{1}\d{1}$)|GIR[ ]?0AA|((AB|AL|B|BA|BB|BD|BH|BL|BN|BR|BS|BT|CA|CB|CF|CH|CM|CO|CR|CT|CV|CW|DA|DD|DE|DG|DH|DL|DN|DT|DY|E|EC|EH|EN|EX|FK|FY|G|GL|GY|GU|HA|HD|HG|HP|HR|HS|HU|HX|IG|IM|IP|IV|JE|KA|KT|KW|KY|L|LA|LD|LE|LL|LN|LS|LU|M|ME|MK|ML|N|NE|NG|NN|NP|NR|NW|OL|OX|PA|PE|PH|PL|PO|PR|RG|RH|RM|S|SA|SE|SG|SK|SL|SM|SN|SO|SP|SR|SS|ST|SW|SY|TA|TD|TF|TN|TQ|TR|TS|TW|UB|W|WA|WC|WD|WF|WN|WR|WS|WV|YO|ZE)(\d[\dA-Z]?[ ]?\d[ABD-HJLN-UW-Z]{2}))|BFPO[ ]?\d{1,4}/
^ which, by the way, doesn't match e.g. Australian zip codes. That cost us quite a few sales. And yes, that is 512 characters long.47 -
!rant
Just pushed commit #512 today.
Was a huge refactoring effort which went sooooo smoothly <3
Pull from parent branch without merge conflicts <33
No issues with deployment <333
AND i'm now on vacation 🏳️🌈❤️🏳️🌈❤️🏳️🌈
Things are perfect6 -
I'm editing the sidebar on one of our websites, and shuffling some entries. It involves moving some entries in/out of a dropdown and contextual sidebars, in/out of submenus, etc. It sounds a little tedious but overall pretty trivial, right?
This is day three.
I learned React+Redux from scratch (and rebuilt the latter for fun) in twice that long.
In my defense, I've been working on other tasks (see: Alerts), but mostly because I'd rather gouge my freaking eyes out than continue on this one.
Everything that could be wrong about this is. Everything that could be over-engineered is. Everything that could be written worse... can't, actually; it's awful.
Major grievances:
1) The sidebars (yes, there are several) are spread across a ridiculous number of folders. I stopped counting at 20.
2) Instead of icon fonts, this uses multiple images for entry states.
3) The image filenames don't match the menu entry names. at all. ("sb_gifts.png" -> orders); active filenames are e.g. "sb_giftsactive.png"
4) The actions don't match the menu entry names.
5) Menu state is handled within the root application controller, and doesn't use bools, but strings. (and these state flags never seem to get reset anywhere...)
6) These strings are used to construct the image filenames within the sidebar views/partials.
7) Sometimes access restrictions (employee, manager, etc.) are around the individual menu entries, sometimes they're around a partial include, meaning it's extremely difficult to determine which menu entries/sections/subsections are permission-locked without digging through everything.
8) Within different conditionals there are duplicate blocks markup, with duplicate includes, that end up render different partials/markup due to different state.
9) There are parent tags outside of includes, such as `<ul>#{render 'horrific-eye-stabbing'}</ul>`
10) The markup differs per location: sometimes it's a huge blob of non-semantic filthiness, sometimes it's a simple div+span. Example filth: section->p->a->(img,span) ... per menu entry.
11) In some places, the markup is broken, e.g. `<li><u>...</li></u>`
12) In other places, markup is used for layout adjustments, such as an single nested within several divs adorned with lots of styles/classes.
13) Per-device layouts are handled, not within separate views, but by conditionally enabling/disabling swaths of markup, e.g. (if is_cordova_session?).
14) `is_cordova_session` in particular is stored within a cookie that does not expire, and within your user session. disabling it is annoying and very non-obvious. It can get set whether or not you're using cordova.
15) There are virtually no stylesheets; almost everything is inline (but of course not actually everything), which makes for fun layout debugging.
16) Some of the markup (with inline styling, no less) is generated within a goddamn controller.
17) The markup does use css classes, but it's predominately not for actual styling: they're used to pick out elements within unit tests. An example class name: "hide-for-medium-down"; and no, I can't figure out what it means, even when looking at the tests that use it. There are no styles attached to that particular class.
18) The tests have not been updated for three years, and that last update was an rspec version bump.
19) Mixed tabs and spaces, with mixed indentation level (given spaces, it's sometimes 2, 4, 4, 5, or 6, and sometimes one of those levels consistently, plus an extra space thereafter.)
20) Intentional assignment within conditionals (`if var=possibly_nil_return_value()`)
21) hardcoded (and occasionally incorrect) values/urls.
... and last but not least:
22) Adding a new "menu sections unit" (I still haven't determined what the crap that means) requires changing two constants and writing a goddamn database migration.
I'm not even including minor annoyances like non-enclosed ternaries, poor naming conventions, commented out code, highly inefficient code, a 512-character regex (at least it's even, right?), etc.
just.
what the _fuck_
Who knew a sidebar could be so utterly convoluted?6 -
The newest IPhone (Which specwise is good) is more expensive than the newest graphics cards that are coming out... h.o.l.y. s.h.i.t
and you know what? THE BEST MODEL IS 400 BUCKS MORE EXPENSIVE THAN A FUCKING 2080TI!
And you know what?
WHATS UP WITH STORAGE!
you go from 64Gb to 256 and 512 GIGABYTES OF DATA!!
Its like, Midrange storage to a Ton of Storage to HOLY SHIT WHO NEEDS THIS MUCH?!
and you know WHY they are doing this?
Because most of the people will buy the 256 or 512 model GUARANTEED! People behave like this! you dont believe me?
What if you gave a Big Popcorn box for 15 Bucks and the smallest one for 5 bucks, which one would you buy? The smaller one. (Most of the time) and why? because you only have 2 choices! If I gave you 3 choices: 5 for small, 10 for medium and 15 for large?
You wont buy the smallest one, because it doesnt make sense! THATS WHY AND NOW FUCK OFF AND YOU TOO APPLE GO SUCK COCKS OF YOUR FUCKING FANBOYS WHICH WILL PAY MORE!4 -
I wish I could type into my brain:"dd if=/dev/zero of=/dev/sda bs=512 count=1337"
To delete everything of my ex gf memories...
She just wrote a message, again...22 -
So spent almost all my time on break just hoping to catch the elusive 512++, never came so I went to bed and slept... Woke up and by the skin of my teeth!!!!
9 -
My first contact with an actual computer was the Sinclair ZX80, a monster with 512 bytes of ram (as in 1/2 kbyte)
It had no storage so you had to enter every program every time and it was programmed in basic using key combinations, you could not just write the commands since it did not have memory enough to keep the full text in memory.
So you pressed the cmd key along with one of the letter keys and possibly shift to enter a command, like cmd+p for print and it stored s byte code.8 -
Two big moments today:
1. Holy hell, how did I ever get on without a proper debugger? Was debugging some old code by eye (following along and keeping track mentally, of what the variables should be and what each step did). That didn't work because the code isn't intuitive. Tried the print() method, old reliable as it were. Kinda worked but didn't give me enough fine-grain control.
Bit the bullet and installed Wing IDE for python. And bam, it hit me. How did I ever live without step-through, and breakpoints before now?
2. Remember that non-sieve prime generator I wrote a while back? (well maybe some of you do). The one that generated quasi lucas carmichael (QLC) numbers? Well thats what I managed to debug. I figured out why it wasn't working. Last time I released it, I included two core methods, genprimes() and nextPrime(). The first generates a list of primes accurately, up to some n, and only needs a small handful of QLC numbers filtered out after the fact (because the set of primes generated and the set of QLC numbers overlap. Well I think they call it an embedding, as in QLC is included in the series generated by genprimes, but not the converse, but I digress).
nextPrime() was supposed to take any arbitrary n above zero, and accurately return the nearest prime number above the argument. But for some reason when it started, it would return 2,3,5,6...but genprimes() would work fine for some reason.
So genprimes loops over an index, i, and tests it for primality. It begins by entering the loop, and doing "result = gffi(i)".
This calls into something a function that runs four tests on the argument passed to it. I won't go into detail here about what those are because I don't even remember how I came up with them (I'll make a separate post when the code is fully fixed).
If the number fails any of these tests then gffi would just return the value of i that was passed to it, unaltered. Otherwise, if it did pass all of them, it would return i+1.
And once back in genPrimes() we would check if the variable 'result' was greater than the loop index. And if it was, then it was either prime (comparatively plentiful) or a QLC number (comparatively rare)--these two types and no others.
nextPrime() was only taking n, and didn't have this index to compare to, so the prior steps in genprimes were acting as a filter that nextPrime() didn't have, while internally gffi() was returning not only primes, and QLCs, but also plenty of composite numbers.
Now *why* that last step in genPrimes() was filtering out all the composites, idk.
But now that I understand whats going on I can fix it and hypothetically it should be possible to enter a positive n of any size, and without additional primality checks (such as is done with sieves, where you have to check off multiples of n), get the nearest prime numbers. Of course I'm not familiar enough with prime number generation to know if thats an achievement or worthwhile mentioning, so if anyone *is* familiar, and how something like that holds up compared to other linear generators (O(n)?), I'd be interested to hear about it.
I also am working on filtering out the intersection of the sets (QLC numbers), which I'm pretty sure I figured out how to incorporate into the prime generator itself.
I also think it may be possible to generator primes even faster, using the carmichael numbers or related set--or even derive a function that maps one set of upper-and-lower bounds around a semiprime, and map those same bounds to carmichael numbers that act as the upper and lower bound numbers on the factors of a semiprime.
Meanwhile I'm also looking into testing the prime generator on a larger set of numbers (to make sure it doesn't fail at large values of n) and so I'm looking for more computing power if anyone has it on hand, or is willing to test it at sufficiently large bit lengths (512, 1024, etc).
Lastly, the earlier work I posted (linked below), I realized could be applied with ECM to greatly reduce the smallest factor of a large number.
If ECM, being one of the best methods available, only handles 50-60 digit numbers, & your factors are 70+ digits, then being able to transform your semiprime product into another product tree thats non-semiprime, with factors that ARE in range of ECM, and which *does* contain either of the original factors, means products that *were not* formally factorable by ECM, *could* be now.
That wouldn't have been possible though withput enormous help from many others such as hitko who took the time to explain the solution was a form of modular exponentiation, Fast-Nop who contributed on other threads, Voxera who did as well, and support from Scor in particular, and many others.
Thank you all. And more to come.
Links mentioned (because DR wouldn't accept them as they were):
https://pastebin.com/MWechZj912 -
What the actual fuck. I just found out that on one of the SSD's I bought, the optimal partition start / finish sizes which apparently on that unit only occur every 65 THOUSAND 4kB sectors (which translates to about a quarter GB) means that I have to throw away half a GB worth of space on that disk in order to align it. Very optimized indeed, dear SSD manufacturer! Huge alignment numbers for just that much extra wastage in the name of optimization. Something like 4x sector size on 512 byte sectors or 1x sector size on 4k sectors.. ain't nobody gonna need that. Let's make it a quarter GB.
And that's what they call engineering?10 -
About age 7 playing with lego an together with a friend was planing to build a robot. 3 years later I got to play with a computer for the first time, A brand new zinclair zx80 with 512 bytes ram (thats 1/2kbyte), and we got it to print 0 instead of syntax error :D
-
Feels good to brought dead laptop to life.
Got dead laptop(person who gave it to me for free, said it doesn't turn on, and he got new one and this one is just for recycling), which got some liquid. Changed palmrest, keyboard, changed cable which is connecting to io board with power button, changed thermal paste and it working like a charm. Maybe in the future I will change screen. Screen has some pink spots, but it's only visible on dar theme. Added 16 GB ram, 512 gb ssd. Now I am using it as work computer. Dell Latitude E7450
7 -
Just reached my 512th ++.
Thank you everyone who did it, and special thanks and congratz to @devTea for being the 512th.
🏳️🌈❤️
3 -
A story about RAM and being... well... not so clever...
I've built a mid-range gaming PC for a friend, based on skylake, with 8GB DDR4 RAM. So I filled up only 2 slots to leave 2 more for upgrade. So he decided to do so.
Later he calls me and says "Hey, can you visit me? My PC won't boot".
So I came and he told me what happened: he found a random RAM stick and decited to put it in. He somehow(wait for it) managed to do it and PC refused to boot. He removed this stick, but PC won't boot anyway.
Soo, when I came, he showed me a stick he found: a random ddr2-533mhz 512 mb stick. Ofc, MB was shocked to see "grandfather" and refused to boot. I looked at the post code, which said ram error, cleared the cmos and it booted just fine.
Check compatability, young builders, and use Google if you're unsure :)9 -
OpenSSH 8.2 is out. This release removes support for the ssh-rsa key algorithm. The better alternatives include:
1. RSA SHA-2 signature algorithms rsa-sha2-256/512. These algorithms have the advantage of using the same key type as "ssh-rsa" but use the safe SHA-2 hash algorithms (now used by default if the client and server support them).
2. The ssh-ed25519 signature algorithm.
3. ECDSA algorithms: ecdsa-sha2-nistp256/384/521.
In this release, support for FIDO/U2F hardware tokens. Also noteworthy, a future release of OpenSSH will enable UpdateHostKeys by default to allow the client to automatically migrate to better algorithms.19 -
Why do you need 100, 500, 1000, 2000 points to unlock some avatar features? Wouldn't 128, 512, 1024 and 2048 be more appropriate for a software community?4
-
Fuck Windows 10. Period.
An amateur shit-show of junk. If you have an i3 processor it will find a way to choke it to 80% with the bloody audiodg.exe.
I have an i7 and takes 25% CPU from Windows Graph Audio Isolation to play a YouTube video and 12-13 % when idle.
Junk spaghetti with some half-useless UI over the same settings that were available in much older Windows versions.
I hate having a decent 16 GB ram, 512 SSD and Radeon and so on laptop, for it to be disabled and abused by Windows and Chrome.15 -
Ahahaha.
I'm creating a "bring with you" Linux install. So I got a 512 GB USB key. (You know, to even have some persistance).
Linux flashing tool : are you sure ?
Fun :)
14 -
My 27" 8-core imac, i7, 3.8ghz, AMD radeon pro 5500, 40 GB RAM 512 GB storage,
keeps screaming in agony.
But never stuttered.
Never lagged.
Never glitched
Never failed
Never ran out of memory
I can just hear how hard the the ventilation was going. It was getting loud.
I touched its ass from behind. It was heated up and there was lots of dust from the holes
This has been going on for several days but i ignored it knowing what kind of a beast machine i have (big mistake)
Intellj popped up notification to disable hints in order to improve cpu usage performance.
Immediately it struck me. Hold on lemme check the activity monitor stats and find out why my imac has been screaming for days
Turns out intellj is using over 1090% of my fucking CPU?????
THAT SHIT U SEE ON THE IMAGE WENT ABOVE 1100% OF CPU USAGE AND IT WAS ONLY 1 PROCESS CAUSING IT - INTELLIJ
WHAT???
12 -
When the company my mother worked for was arranging computer courses and could not leave the computers in the borrowed classrooms.
They brought them home and I got to play with them :)
Sinclair ZX80 with 512 bytes of RAM (no hard drive, diskette or CD).
This was 38 years ago ;)6 -
I started out on a Sinclair ZX 80. It has just 512 bytes of ram and you had to use a function button together with a key for each command since it did not have enough memory to keep the source in memory ;)
I attended few basic courses and then went on to hold them.
After a year there was suggestions of starting pascal courses so during the summer I read up in turbo pascal 5.5 but since the summer home did not have electricity I had to do it all theoretically for the first month before getting to try it out.
I got to try visual basic when doing school practice with Microsoft but the name was not set by then as it was a few months before the release.
Thats also where the more professional programming got going even though I did one pascal program that was used professionally before that. -
First thought about programming was in forth class in school, I was 10, and together with a friend we where planing on building a robot.
When we had a basic Idea on how the mechanics would work (theoretically but maybe not really practically sound) we started to consider how to control it. We had heard about computers but had never seen one but we figured out you could not just say, “go shopping” but rather had to break the problem down and doing that we came to the conclusion we would have to start with getting it to take a step.
We never got further as my family moved and I switched schools.
Later the same year I got to play with an actual computer, the Sinclair ZX80, 80 for the year.
A monster with 512 bytes of internal memory ... yes bytes, not kbyte.
And then things got going, after a few curses in Basic I finally got my own Spectra video 128, 14 years old and 2 years later I was teaching basic in ravening classes and I have been working with computers and programming ever since.1 -
When we subtract some number m from another number n, we are essentially creating a relationship between n and m such that whatever the difference is, can be treated as a 'local identity' (relative value of '1') for n, and the base then becomes '(base n/(n-m))%1' (the floating point component).
for example, take any number, say 512
697/(697-512)
3.7675675675675677
here, 697 is a partial multiple of our new value of '1' whose actual value is the difference (697-512) 185 in base 10. proper multiples on this example number line, based on natural numbers, would be
185*1,
185*2
185*3, etc
The translation factor between these number lines becomes
0.7675675675675677
multiplying any base 10 number by this, puts it on the 1:185 integer line.
Once on a number line other than 1:10, you must multiply by the multiplicative identity of the new number line (185 in the case of 1:185), to get integers on the 1:10 integer line back out.
185*0.7675675675675677 for example gives us
185*0.7675675675675677
142.000000000000
This value, pulled from our example, would be 'zero' on the line.
185 becomes the 'multiplicative' identity of the 1:185 line. And 142 becomes the additive identity.
Incidentally the proof of this is trivial to see just by example. if 185 is the multiplicative identity of 697-512, and and 142 is the additive identity of number line 1:185
then any number '1', or k=some integer, (185*(k+0.7675675675675677))%185
should equal 142.
because on the 1:10 number line, any number n%1 == 0
We can start to think of the difference of any two integers n, as the multiplicative identity of a new number line, and the floating point component of quotient of any number n to the difference of any number n-m, as the additive identity.
let n =697
let m = 185
n-m == '1' (for the 1:185 line)
(n-m) * ((n/(n-m))%1) == '0'
As we can see just like on the integer number line, n%1 == 0
or in the case of 1:185, it equals 142, our additive identity.
And now, the purpose of this long convoluted post: all so I could bait people into reading a rant on division by zero.30 -
My uncle has definitely been my biggest influence. My parents never understood computers and refused to buy one. Eventually my uncle gave me an old Win95 box with an 8GB HDD, and 512 MB of RAM(most other people in the world were running XP at this point). The thing was completely useless as a computer to do work on when I received it.
The internet wasn't really a thing yet back then, but I managed to figure out how to clean up the OS, as well as taking it a part and figuring out the parts.
He was the one who taught me that with computers, all things are possible.
From there he was always buying me books about programming, and pointing me in the right direction. He was never one to give me the answer, but always told me where to look or what to ask.
Now I'm the main web developer at my company and I love what I do. -
what if i tell you i have a 1mbps internet speed, and i'm not using it alone, and in two weeks i'll only have a 512 kbps internet speed which will be divided by two in the best case?23
-
Wanted to create a windows 11 install USB
Dumb tool reformated a 512 GB key to have ... 32GB partion. Apparently it is a maximum supported for Win 11 install
Idiotic10 -
I am trying to "invent" secure client-side authentication where all data are stored in browser encrypted and only accessible with the correct password. My question is, what is your opinion about my idea. If you think it is not secure or there is possible backdoor, let me know.
// INPUT:
- test string (hidden, random, random length)
- password
- password again
// THEN:
- hash test string with sha-512
- encrypt test string with password
- save hash of test string
// AUTH:
- decrypt test string
- hash decrypted string with sha-512
- compare hashes
- create password hash sha-512 (and delete password from memory, so you cannot get it somehow - possible hole here because hash is reversible with brute force)
// DATA PROCESSING
- encrypt/decrypt with password hash as secret (AES-256)
Thanks!
EDIT: Maybe some salt for test string would be nice8 -
Probably around 7 years old when planing on building a robot and discussing how we should get it to move. And also playing with lego.
Then at 10 years my mom lended home a couple if Sinclair ZX80 with 512 bytes of memory and I was hooked :D (they where brand new at that time)5 -
!rant
hey dev's,
I need help for choosing laptop.
I will need it for deep learning.
DELL G7 7588
config:
pro : i9-8950HK
gpu : GTX 1060
ram : 16 gb ddr4
ssd : 512
hdd : 1TB
your reviews please42 -
When you keep telling your boss that you remade one of their sites so that it has BCrypt(currently use SHA-512),CSRF checks, stricter Auth/Cookie encryption and that we should swap it and all he says we will get to it.
wot n tarnation-_-1 -
So, I gave my missus an old 512 MB Ram AMD 64 Bit Computer with Old School Windows XP, tried installing Atom and this happened.
Time to install Linux. :D
3 -
When spring arrives the mistyping bugs increases by 512% i sneeze every line of code, it's a torture.2
-
Saw the ++ number on this rant and it made me feel all warm and fuzzy on the inside.
You win 20 poster points if you can guess why this number is special.
I'll give you a hint: "512" and "5-pin" (or 3-pin if it's cheep)
6 -
Googled for about 2 hours now and can't get this shit working. Trying to launch the Android Wear Emulator through Android Studio using KitKat 4.4 API. I created a new device within the device manager using 512 MB RAM and 128 MB VM. Square Display.
I am running on osx 10.11 El Capitan on Software Acceleration (because hardware doesnt even boot to the android logo). I get the following error when running using ./emulator:
Error while connecting to socket '127.0.0.1:1970': 61 -> Connection refused
emulator: ASC 127.0.0.1:1970: Retrying connection. Connector FD = 25
What does it mean? I couldnt find an asnwer on the net.2 -
Fuck you Linux! I thought user password validation would be a piece of cake, like bash one liner. How wrong could I be!
Yeah, it's already ugly to grep hash and salt from /etc/shadow, but I could accept that. But then give me a friggin' tool to generate the hash. And of course the distro I chose has the wrong makepswd, OpenSSL is too old to have the new SHA-512 built in, as it should be a minimal installation I don't want to use perl or python...
And the stupid crypto function that would do me the job is even included in glibc. So it's only one line of C-code to give me all I want, but there is no package that would provide me this dull binary? Instead I will have to compile it myself and then again remove the compiler to keep image small?5 -
Ran a windows registry error fixer 5 times, each time it says there are only 512 errors. I don't know if it is failing to delete them, or hitting some type of self imposed RAM limit...
Also half of the comments on Cnet say they think it's pretty good, and half say it's spam ware, but I haven't seen any ads. (average 4.5/5)
Anyone know if "Windows Registry Repair" actually works?2 -
Do you use i3 (dynamic tiling windows manager) on your *nix system?
What are your favourite tips/hacks for optimisation?8 -
this is torch. is this the proper way ?
self.linear_relu_stack = nn.Sequential(
nn.Linear(9, 512),
nn.ReLU(),
nn.Linear(512, 512),
nn.ReLU(),
nn.Linear(512,100),
nn.ReLU(),
nn.Linear(100,5),
nn.Sigmoid()
)
The sigmoid part ?
It returns garbage numbers on the first run of course.6 -
Hello Devs, Please Suggest Me A Good Laptop.
Specs I Probably Need:
256 or 512 SSD
i7 6th gen
8 or 16 GB DDR4 RAM
Dedicated Graphics or Touch Screen(Ultrabook or something)
Really Confused between Yoga 910 and Lenovo Y700. Or what will be the best device(Portable and Powerful) for us?6 -
This question might make you lose a brain cell because of stupidity in the question. Read with caution
Is there a way to compile a game for Windows from Linux in Unreal engine? I did google some posts but the answer was either use a Virtual machine which will not be done or use the the theoretical method of using mingw but the forum posts state that it will be tricky business or use a windows machine. I have dual booted windows with linux on my machine.
However since the machine has a 512 gb ssd most of the storage space is devoted to unreal engine which takes 47 gigs in itself and have a lot of programs installed I have a usable 20 gigs left out of 145 gig partition. Windows has around 318 gigs of storage to it but I have 100 gigs free at most. So after installing the windows sdk, visual studio with extensions, unreal engine and some other stuff I don't have much space left for myself. I need that much space since I install a lot of games to my ssd. So now I cant load my bigger projects for playing on my windows. I could use my hdd which is mostly used for backups and 100+ gig stuff. Though the hdd's are of course far slower than ssd's which shouldn't be a problem however last time I used visual studio it ate more than 2 gigs of ram for a solution meaning that the compiler has very low memory for itself to actually compile so for any large files the hdd has more of a bottleneck.
Oh and I can't upgrade my ssd's or ram because I don't have enough money.
Thanks for the answers in advance4
Top Tags
Weekly Rant
View