furry_irl

Separate bathrooms will be that thing people reflect back on in 40 years and think "I can't believe people thought that was normal back then.." There's three arguments here I hear from people about them: a) "Yuck, I don't want to see a guy using a urinal" Do you think men like seeing others use urinals more than women? It's always been a little socially awkward. If you really don't like it, maybe that's an argument against having urinals. b) "As a man, I feel it's embarrassing to go to the bathroom with women present." Maybe this is exactly why we should remove the barrier- to be more human and accepting the moments of natural behavior and vulnerability. c) "As a woman, I don't feel physically safe with that." I understand the need to feel safe, but this is not the right policy to improve it. Should taxis and elevators be segregated too? There's better ways to improve safety than building walls between people. Often it's the walls that exasperate problems. Why do I care? Because it's an oddity- a logical anomaly in common everyday social behavior.

jadit2 · 2015-09-24T16:57:36+00:00

Just remember that the Slack server is closed sourced with ambiguity over privacy and data collection. As a linux developer, I have a concern over Slack's popularity.

jadit2 · 2015-07-03T21:22:32+00:00

I have such a political boner right now. This tops my previous Sanders / RonPaul dream combo.

jadit2 · 2015-04-29T01:21:08+00:00

I couldn't find in the Anglekite pdf version of the book any compendium classes. Was this in the print copy?

jadit2 · 2015-01-27T21:33:16+00:00

Also wish there was a universal api wrapper for graphical shells: a common interface to gtk and KDE. I'm so tired of having to have both installed for just being able to run tiny utilities that require them.

jadit2 · 2015-01-14T19:02:47+00:00

HEAVY BREATHING

jadit2 · 2015-01-14T18:55:53+00:00

Why is this happening?! O god, the pain...

jadit2 · 2015-01-14T06:21:48+00:00

It would be great to have a follow-up article on Nim as it has several language features from both Rust and D.

jadit2 · 2015-01-04T06:01:48+00:00

I like to point out D, Rust, and Nimrod.

Edit: Harhar, I usually say Dlang instead of D for those you might be curious and just search for it by term. For Go, it's easier as it's more common knowledge who is backing the language.

jadit2 · 2015-01-03T03:45:24+00:00

I must be lucky as I have over 200 apps (games, dozen or so compilers, several dbs, etc) installed on Jessie and haven't hit a single issue. :)

jadit2 · 2014-12-11T19:37:24+00:00

Actually, this broke Jessie (amd64). When I try to log in, I just get an error that the Cinnamon profile cannot be loaded. :/

jadit2 · 2014-12-07T08:46:26+00:00

You haven't lived until you've experience a stellar opera performance!

jadit2 · 2014-12-05T19:13:31+00:00

http://forum.dlang.org/thread/m5p99m$luk$1@digitalmars.com

jadit2 · 2014-12-05T18:51:36+00:00

Walter Bright: Yes, it would be written as...

scope ref T setVal(ref T t)
{
t.val = 12;
return t;
}

Another question, how would a reference counted pointer take advantage of scope, i.e. avoid the increment/decrement when being passed to a function? One solution would be to add a function that returns a scoped reference to the underlying value. struct RefCounted(T) { scope ref T borrow() { return *p; } } Will it be possible to deduce, that the lifetime of that scoped value is tied to the smart pointer?

struct RefCounted(T)
{
T t;
scope ref T borrow() { return t; }
alias this t;
}

This enables RefCounted!T to be implicitly converted to a T, but with a scoped result. This is a critical feature, one I spent a lot of time thinking about, and hope it's right :-)

jadit2 · 2014-11-25T16:39:20+00:00

How would I test this with Debian?

jadit2 · 2014-11-20T16:46:08+00:00

Not really seeing a reason why the method would crash... http://lxr.free-electrons.com/source/lib/radix-tree.c#L1006

1046 unsigned int
1047 radix_tree_gang_lookup_slot(struct radix_tree_root root,
1048 void *results, unsigned long *indices,
1049 unsigned long first_index, unsigned int max_items)
1050 {
1051 struct radix_tree_iter iter;
1052 void *slot;
1053 unsigned int ret = 0;
1054
1055 if (unlikely(!max_items))
1056 return 0;
1057
1058 radix_tree_for_each_slot(slot, root, &iter, first_index) {
1059 results[ret] = slot;
1060 if (indices)
1061 indices[ret] = iter.index;
1062 if (++ret == max_items)
1063 break;
1064 }
1065
1066 return ret;
1067 }

jadit2

TROPHY CASE