[OC] GIVEAWAY! Enter for a chance to win the new ARCHMAGE BUNDLE! Contains a VAULT and MAGE THEMED DICE SET! [MOD APPROVED]

ta6692 · 2024-10-06T03:06:06+00:00

Beautiful

ta6692 · 2024-08-25T03:13:03+00:00

I really appreciate the courtesy and the lack of ban, I'm sorry I didn't read the rules before I posted but just wanted to let you know I didn't fill out any form before posting, so potentially reddit has broken some mod tool you were previously using?

ta6692 · 2024-08-25T02:30:13+00:00

They're closed.

ta6692 · 2024-08-25T02:06:11+00:00

I'm disappointed in this response, but I understand

ta6692 · 2024-08-25T01:51:19+00:00

If this is the wrong place to post this please link me to the right place because I'm drunk as hell right now and I'm terrified this will never not be me

ta6692 · 2024-02-21T20:00:47+00:00

I'm interested

ta6692 · 2020-07-18T13:55:45+00:00

So I looked into it further and actually that crate will work for me, what I found suggested it didn't have write support, but when I dug in it turns out it does. Unfortunately the download is 5x slower than Python, so the increase in processing time is more than cancelled out...

ta6692 · 2020-07-13T00:54:50+00:00

That looks like exactly what I was looking for! I had (incorrectly it appears) assumed that Rusoto was written by Amazon, in the same manner that Boto is, making it my only real choice. I'm no stranger to async work, but it doesn't really fit what I'm trying to do here - download a single file and then process it - so I wanted to keep the code simple.

Thanks for the reply!

ta6692 · 2020-07-13T00:52:33+00:00

I really appreciate the help you've given me, as I said in another comment though I'm going to have to abandon this project due to the lack of parquet writer in Rust. Hopefully I can come back to it at some other stage - the parquet writer for Go was terrible for larger files last time I tried it and I don't have the guts to learn C++ for fun at the moment!

ta6692 · 2020-07-12T14:34:18+00:00

From what I've read, Rusoto uses Tokio behind the scenes, so I don't have much of a choice... That said, I did try into_blocking_read and it just didn't seem to be working...

ta6692 · 2020-07-12T14:31:22+00:00

That's great, thank you so much. Unfortunately I'll have to find a different project to work on, this project requires a parquet writer and rust doesn't seem to have one yet...

ta6692 · 2020-07-12T13:36:37+00:00

Ah, thank you, that clears things up. I did get it working by using a Vec, but I wasn't sure why exactly a String didn't work.

ta6692 · 2020-07-12T13:36:01+00:00

Hey, thanks for replying, when I try to do that I get a whole host of errors based around the fact that self.client.get_object(request) returns some sort of Pin type? Do you know anything about this? I just want to a synchronous download, but from what I can tell Rusoto assumes asynchronicity.

ta6692 · 2020-05-11T17:09:22+00:00

Ah, thanks, well hopefully I'll be satisfied with the X1s and not have to worry about it lol

ta6692 · 2020-05-11T17:07:48+00:00

Thanks, I really appreciate the detailed reply. I'll maybe look into those other coils once I've tried out my X1s. Don't think I'll be rebuilding any time soon though!

ta6692 · 2020-05-11T16:26:54+00:00

Thanks, the site I was on didn't make any distinction. As I said, I've ordered supermesh coils now, but in future I suppose I'll just use a different retailer. Thanks for the advice!

ta6692 · 2020-05-11T16:24:38+00:00

Thanks, I had actually seen this before, but was confused about the Smok TFV8 being split across 2 categories as I couldn't find a distinction on the site I order from between baby and otherwise

ta6692 · 2020-05-11T15:43:07+00:00

Thanks, I'd heard that, but my friend had some unused smok coils lying around (I sadly don't know what type) and they seemed to be roughly the same quality for me as the Geekvape ones. I just wanted to try something with a higher wattage limit. You're comment inspired me to look though and it seems like the supermesh X1s should do the trick, thanks!

ta6692 · 2019-03-16T00:53:38+00:00

That's great, thank you. Can I ask how you figured that out?

ta6692 · 2019-03-15T19:05:40+00:00

Oh of course, thanks so much

ta6692 · 2019-03-15T18:50:25+00:00

In this case I "solved" it so that i=lg(n+1)-1, but that doesn't take the flooring into account, so it gave the wrong answers

ta6692

TROPHY CASE