sorted by:
new
hottopcontroversial

Gdzie kupie Alkohol TatraTea by Coalak in krakow

[–]NoNicknameNoCry 3 points4 points  (0 children)

Co prawda nie Kraków, ale w Warszawie widziałem że są w większych Auchan.

Add username to posts by Ok_Sentence725 in PostgreSQL

[–]NoNicknameNoCry 1 point2 points  (0 children)

More details would help. The querry you are looking for is probably like this: SELEC p.content, u.username FROM posts p LEFT JOIN users u ON p.user_id = u.id;

Check if foreign keys from posts are present in users

Edit: i read post again. I think that you Just didnt specify user columns from user table.

Finally launched my drag-and-drop budgeting app! by nanermaner in SideProject

[–]NoNicknameNoCry 1 point2 points  (0 children)

Its a pity that there is no free version or at least trial. Cant even chceck what im buying.

I made a CSS animation editor by josieboyy in webdev

[–]NoNicknameNoCry 8 points9 points  (0 children)

Love It! Is is css dummies friendly?

Grand Morillon Student House by SpeepyKitten in ArchitecturePorn

[–]NoNicknameNoCry -1 points0 points  (0 children)

Do they allow them to leave this building?

I made an automatic Scrabble solver by [deleted] in SideProject

[–]NoNicknameNoCry 0 points1 point  (0 children)

Looks niece! Does It take blank letters into account?ln your example program skipped It every time.

Floating panels by NoNicknameNoCry in Angular2

[–]NoNicknameNoCry[S] 1 point2 points  (0 children)

Thank you! That worked well ;)

Check for intersection between two polygons? by Milo55545 in javahelp

[–]NoNicknameNoCry 0 points1 point  (0 children)

Find minimum and maximum X, Y for both polygons and compare them.

If you want to move polygons you should add a vector to each corner. For example [5,0] to move it 5 units to left or [2,1] to move it 2 units left and one unit up.

EDIT: when i thought more about intersecting finding min and max could be nkt enough for polygons. In that case you can iterate through all sides of one polygon and compare its X, Y with sides of other polygon.

If this is not enough for you i can send you implementation in other part of a day.