๋ฐ˜์‘ํ˜•
[Querydsl] ์„œ๋ธŒ ์ฟผ๋ฆฌ(Subquery), Case(when, then), ์ƒ์ˆ˜(Constant), concat

๋ชจ๋“  ์†Œ์Šค ์ฝ”๋“œ๋Š” ์—ฌ๊ธฐ ์žˆ์Šต๋‹ˆ๋‹ค. ์ด์ „ ํฌ์ŠคํŒ…์— ์ด์–ด์„œ Querydsl์˜ ๊ธฐ๋ณธ ๋ฌธ๋ฒ•์„ ์†Œ๊ฐœํ•ฉ๋‹ˆ๋‹ค. ์„œ๋ธŒ ์ฟผ๋ฆฌ(Sub Query) SQL์„ ์ง์ ‘ ์‚ฌ์šฉํ•˜๊ฑฐ๋‚˜ MyBatis ๋“ฑ์„ ์‚ฌ์šฉํ•˜๋Š” ๋ ˆ๊ฑฐ์‹œ์—์„œ ๋งŽ์ด ๋ณผ ์ˆ˜ ์žˆ๋Š” ์„œ๋ธŒ ์ฟผ๋ฆฌ๋Š” ์‹ค์ œ๋กœ join์„ ์‚ฌ์šฉํ•˜๊ฑฐ๋‚˜ ์ฟผ๋ฆฌ๋ฅผ ๋‚˜๋ˆ ์„œ ์ฒ˜๋ฆฌํ•˜๋Š” ๊ฒƒ์ด ์„ฑ๋Šฅ์ƒ ์œ ๋ฆฌํ•  ๋•Œ๊ฐ€ ์žˆ์Šต๋‹ˆ๋‹ค. ํ•˜์ง€๋งŒ ๋ถˆ๊ฐ€ํ”ผํ•˜๊ฒŒ ์‚ฌ์šฉํ•ด์•ผ ํ•  ์ƒํ™ฉ๋“ค์„ ์œ„ํ•ด Querydsl์—์„œ์˜ ์„œ๋ธŒ ์ฟผ๋ฆฌ ์‚ฌ์šฉ ๋ฐฉ๋ฒ•์„ ํ™•์ธํ•ด ๋ณด๊ฒ ์Šต๋‹ˆ๋‹ค. ์„œ๋ธŒ ์ฟผ๋ฆฌ ์‚ฌ์šฉ์„ ์œ„ํ•ด์„  JPAExpressions๋ฅผ ์‚ฌ์šฉํ•ฉ๋‹ˆ๋‹ค. ๋จผ์ € ์„ ์ˆ˜๋“ค ์ค‘ ๋‚˜์ด๊ฐ€ ๊ฐ€์žฅ ๋งŽ์€ ์„ ์ˆ˜๋ฅผ ์„œ๋ธŒ ์ฟผ๋ฆฌ๋ฅผ ์ด์šฉํ•ด ์กฐํšŒํ•ด๋ณด๊ฒ ์Šต๋‹ˆ๋‹ค. package io.lcalmsky.querydsl.domain; import com.querydsl.jpa.JPAExpressions; impor..
Querydsl 2021. 7. 21. 12:39
[LeetCode] 116. Populating Next Right Pointers in Each Node (Java)

์†Œ์Šค ์ฝ”๋“œ๋Š” ์—ฌ๊ธฐ ์žˆ์Šต๋‹ˆ๋‹ค. ๋ฌธ์ œ๋Š” ์—ฌ๊ธฐ ์žˆ์Šต๋‹ˆ๋‹ค. Problem You are given a perfect binary tree where all leaves are on the same level, and every parent has two children. The binary tree has the following definition: struct Node { int val; Node *left; Node *right; Node *next; } Populate each next pointer to point to its next right node. If there is no next right node, the next pointer should be set to NULL. Initially,..
Algorithm 2021. 7. 21. 01:51
๋ฐ˜์‘ํ˜•
1
๊ณต์ง€์‚ฌํ•ญ
์ตœ๊ทผ์— ์˜ฌ๋ผ์˜จ ๊ธ€
์ตœ๊ทผ์— ๋‹ฌ๋ฆฐ ๋Œ“๊ธ€
Total
128,435
Today
13
Yesterday
526
๋งํฌ
TAG more
«   2021/07   »
์ผ ์›” ํ™” ์ˆ˜ ๋ชฉ ๊ธˆ ํ† 
        1 2 3
4 5 6 7 8 9 10
11 12 13 14 15 16 17
18 19 20 21 22 23 24
25 26 27 28 29 30 31
๊ธ€ ๋ณด๊ด€ํ•จ