• Log InLog In
  • Register
Liquid`
Team Liquid Liquipedia
EDT 21:06
CEST 03:06
KST 10:06
  • Home
  • Forum
  • Calendar
  • Streams
  • Liquipedia
  • Features
  • Store
  • EPT
  • TL+
  • StarCraft 2
  • Brood War
  • Smash
  • Heroes
  • Counter-Strike
  • Overwatch
  • Liquibet
  • Fantasy StarCraft
  • TLPD
  • StarCraft 2
  • Brood War
  • Blogs
Forum Sidebar
Events/Features
News
Featured News
[ASL19] Finals Recap: Standing Tall9HomeStory Cup 27 - Info & Preview18Classic wins Code S Season 2 (2025)16Code S RO4 & Finals Preview: herO, Rogue, Classic, GuMiho0TL Team Map Contest #5: Presented by Monster Energy6
Community News
[BSL20] Non-Korean Championship 4x BSL + 4x China1Flash Announces Hiatus From ASL63Weekly Cups (June 23-29): Reynor in world title form?13FEL Cracov 2025 (July 27) - $8000 live event22Esports World Cup 2025 - Final Player Roster16
StarCraft 2
General
Program: SC2 / XSplit / OBS Scene Switcher The SCII GOAT: A statistical Evaluation Statistics for vetoed/disliked maps Weekly Cups (June 23-29): Reynor in world title form? PiG Sty Festival #5: Playoffs Preview + Groups Recap
Tourneys
RSL: Revival, a new crowdfunded tournament series FEL Cracov 2025 (July 27) - $8000 live event Sparkling Tuna Cup - Weekly Open Tournament WardiTV Mondays Korean Starcraft League Week 77
Strategy
How did i lose this ZvP, whats the proper response Simple Questions Simple Answers
Custom Maps
[UMS] Zillion Zerglings
External Content
Mutation # 481 Fear and Lava Mutation # 480 Moths to the Flame Mutation # 479 Worn Out Welcome Mutation # 478 Instant Karma
Brood War
General
Player “Jedi” cheat on CSL SC uni coach streams logging into betting site Flash Announces Hiatus From ASL BW General Discussion Practice Partners (Official)
Tourneys
[BSL20] Non-Korean Championship 4x BSL + 4x China CSL Xiamen International Invitational The Casual Games of the Week Thread [BSL20] Grand Finals - Sunday 20:00 CET
Strategy
Simple Questions, Simple Answers I am doing this better than progamers do.
Other Games
General Games
Path of Exile Stormgate/Frost Giant Megathread Nintendo Switch Thread What do you want from future RTS games? Beyond All Reason
Dota 2
Official 'what is Dota anymore' discussion
League of Legends
Heroes of the Storm
Simple Questions, Simple Answers Heroes of the Storm 2.0
Hearthstone
Heroes of StarCraft mini-set
TL Mafia
TL Mafia Community Thread Vanilla Mini Mafia
Community
General
US Politics Mega-thread Russo-Ukrainian War Thread Summer Games Done Quick 2025! Trading/Investing Thread Things Aren’t Peaceful in Palestine
Fan Clubs
SKT1 Classic Fan Club! Maru Fan Club
Media & Entertainment
Anime Discussion Thread [Manga] One Piece [\m/] Heavy Metal Thread
Sports
Formula 1 Discussion 2024 - 2025 Football Thread NBA General Discussion TeamLiquid Health and Fitness Initiative For 2023 NHL Playoffs 2024
World Cup 2022
Tech Support
Computer Build, Upgrade & Buying Resource Thread
TL Community
Blogs
Culture Clash in Video Games…
TrAiDoS
from making sc maps to makin…
Husyelt
Blog #2
tankgirl
StarCraft improvement
iopq
Trip to the Zoo
micronesia
Customize Sidebar...

Website Feedback

Closed Threads



Active: 621 users

The Big Programming Thread - Page 878

Forum Index > General Forum
Post a Reply
Prev 1 876 877 878 879 880 1031 Next
Thread Rules
1. This is not a "do my homework for me" thread. If you have specific questions, ask, but don't post an assignment or homework problem and expect an exact solution.
2. No recruiting for your cockamamie projects (you won't replace facebook with 3 dudes you found on the internet and $20)
3. If you can't articulate why a language is bad, don't start slinging shit about it. Just remember that nothing is worse than making CSS IE6 compatible.
4. Use [code] tags to format code blocks.
supereddie
Profile Joined March 2011
Netherlands151 Posts
April 27 2017 20:33 GMT
#17541
On April 28 2017 02:20 enigmaticcam wrote:
If anyone here is familiar with Microsoft SQL Server, I have an optimization question too:

Why does this script only take 1 second to run...
*snip*
...and yet this script takes about 10 minutes.
*snip*
The table size is about 22 million rows. So I know the issue is that one is doing a distinct on the entire table, and one is doing a distinct only on the temp table. But I would think the second one would first filter for the smaller subset before performing the distinct, but clearly it's not. Is there a reason for that?

1. Set an index on BrandlabelCode include BrandLabelName. Also properly index VistaarExtractStagingArchive
2. distinct is slow. try to avoid it.
3. perhaps create a 'brands'-table, so you don't have to distinct on masterproduct
4. analyzing the query plan will show you the exact problems
5. you can also use the 'with'-statement that may speed up execution, for example:
with temp as(
select
PSID
, Product
, [Geography]
, EffectiveMonth
from vistaar.VistaarExtractStagingArchive
where JobRequestId = @jobRequestId
), brands as(
select distinct BrandLabelName, BrandLabelCode
from Vistaar.MasterProduct
)
select distinct
PSID
, Product as BL
, b.BrandLabelName as BLName
, [Geography] as Market
, EffectiveMonth
from temp a
left join brands b on b.BrandLabelCode = a.Product
"Do not try to make difficult things possible, but make simple things simple." - David Platt on Software Design
supereddie
Profile Joined March 2011
Netherlands151 Posts
April 27 2017 20:42 GMT
#17542
On April 27 2017 16:31 Manit0u wrote:
Back to SQL again... With the problem I posted some time back.

We have: A has many B, C has many B.

Now, we do filtering on C matching A where C has no B or CB are a subset of AB.

The thing is, it's pretty slow as soon as you hit about a million records in the db (1.5s query), which is no good for us.

Any ideas how can you optimize it in postgres?

Right now we have join tables that are being aggregated into views (stale data is unacceptable since it's used for live time pooling and assigning C to A with race conditions and all that jazz).

Edit: I'm seriously considering dropping the join tables and simply dumping all the related ids into an uuid[] column in respective tables.

It would help if you post a sample query. I'm sure postgres has an query or execution plan analyzer.
Some databases can't utilize indexes properly if your conditions are in a different order than columns in your index.Also if you have a 'in()' condition, usually you should not reference tables outside the subselect.
"Do not try to make difficult things possible, but make simple things simple." - David Platt on Software Design
enigmaticcam
Profile Blog Joined October 2010
United States280 Posts
April 27 2017 22:53 GMT
#17543
On April 28 2017 05:33 supereddie wrote:1. Set an index on BrandlabelCode include BrandLabelName. Also properly index VistaarExtractStagingArchive
2. distinct is slow. try to avoid it.
3. perhaps create a 'brands'-table, so you don't have to distinct on masterproduct
4. analyzing the query plan will show you the exact problems
5. you can also use the 'with'-statement that may speed up execution, for example:
with temp as(
select
PSID
, Product
, [Geography]
, EffectiveMonth
from vistaar.VistaarExtractStagingArchive
where JobRequestId = @jobRequestId
), brands as(
select distinct BrandLabelName, BrandLabelCode
from Vistaar.MasterProduct
)
select distinct
PSID
, Product as BL
, b.BrandLabelName as BLName
, [Geography] as Market
, EffectiveMonth
from temp a
left join brands b on b.BrandLabelCode = a.Product

Thanks for the help! These I would definitely implement if I hadn't already got a query that gives me a return in 1 second I was asking mostly because I found it odd that the sub-query approach took so long, because I use sub-queries a lot and usually they work just fine in doing filtering like this. I'm thinking it was the distinct; somehow that made it decide to do a full table scan before filtering.
berated-
Profile Blog Joined February 2007
United States1134 Posts
April 28 2017 02:18 GMT
#17544
On April 28 2017 07:53 enigmaticcam wrote:
Show nested quote +
On April 28 2017 05:33 supereddie wrote:1. Set an index on BrandlabelCode include BrandLabelName. Also properly index VistaarExtractStagingArchive
2. distinct is slow. try to avoid it.
3. perhaps create a 'brands'-table, so you don't have to distinct on masterproduct
4. analyzing the query plan will show you the exact problems
5. you can also use the 'with'-statement that may speed up execution, for example:
with temp as(
select
PSID
, Product
, [Geography]
, EffectiveMonth
from vistaar.VistaarExtractStagingArchive
where JobRequestId = @jobRequestId
), brands as(
select distinct BrandLabelName, BrandLabelCode
from Vistaar.MasterProduct
)
select distinct
PSID
, Product as BL
, b.BrandLabelName as BLName
, [Geography] as Market
, EffectiveMonth
from temp a
left join brands b on b.BrandLabelCode = a.Product

Thanks for the help! These I would definitely implement if I hadn't already got a query that gives me a return in 1 second I was asking mostly because I found it odd that the sub-query approach took so long, because I use sub-queries a lot and usually they work just fine in doing filtering like this. I'm thinking it was the distinct; somehow that made it decide to do a full table scan before filtering.


His point #4 about query plans is the most important. If you can learn to read them it will take all of the guess work out of trying to figure out what happened.
supereddie
Profile Joined March 2011
Netherlands151 Posts
Last Edited: 2017-04-28 07:27:50
April 28 2017 07:26 GMT
#17545
On April 28 2017 07:53 enigmaticcam wrote:
Show nested quote +
On April 28 2017 05:33 supereddie wrote:1. Set an index on BrandlabelCode include BrandLabelName. Also properly index VistaarExtractStagingArchive
2. distinct is slow. try to avoid it.
3. perhaps create a 'brands'-table, so you don't have to distinct on masterproduct
4. analyzing the query plan will show you the exact problems
5. you can also use the 'with'-statement that may speed up execution, for example:
with temp as(
select
PSID
, Product
, [Geography]
, EffectiveMonth
from vistaar.VistaarExtractStagingArchive
where JobRequestId = @jobRequestId
), brands as(
select distinct BrandLabelName, BrandLabelCode
from Vistaar.MasterProduct
)
select distinct
PSID
, Product as BL
, b.BrandLabelName as BLName
, [Geography] as Market
, EffectiveMonth
from temp a
left join brands b on b.BrandLabelCode = a.Product

Thanks for the help! These I would definitely implement if I hadn't already got a query that gives me a return in 1 second I was asking mostly because I found it odd that the sub-query approach took so long, because I use sub-queries a lot and usually they work just fine in doing filtering like this. I'm thinking it was the distinct; somehow that made it decide to do a full table scan before filtering.

If you don't have an index on the columns you use in the statement, then it must do a full table scan to determine all the different values. However, don't blindly create indexes - maybe there are already indexes on the table but the query optimizer finds them not usable (because of the fields used or something).
When having performance issues in any RDBMS always try to check the execution plan. It will tell you exactly how the query is executed.
"Do not try to make difficult things possible, but make simple things simple." - David Platt on Software Design
solidbebe
Profile Blog Joined November 2010
Netherlands4921 Posts
April 28 2017 13:20 GMT
#17546
Thank you for the suggestions guys!
That's the 2nd time in a week I've seen someone sig a quote from this GD and I have never witnessed a sig quote happen in my TL history ever before. -Najda
enigmaticcam
Profile Blog Joined October 2010
United States280 Posts
April 28 2017 16:21 GMT
#17547
On April 28 2017 16:26 supereddie wrote:If you don't have an index on the columns you use in the statement, then it must do a full table scan to determine all the different values. However, don't blindly create indexes - maybe there are already indexes on the table but the query optimizer finds them not usable (because of the fields used or something).
When having performance issues in any RDBMS always try to check the execution plan. It will tell you exactly how the query is executed.

I forgot to mention that there is an index on the JobRequestId. My bad, that probably would've made it more clear as to why I was a bit confused as to how long that report was taking.

I know the execution plan is a big help in times like this, it's just that I've honestly never spent the time to learn how to read it. Guess I should probably do that :D
Deleted User 3420
Profile Blog Joined May 2003
24492 Posts
Last Edited: 2017-04-29 23:56:09
April 29 2017 14:54 GMT
#17548
anyone around for a little bit that I could message a few questions about dup2 and pipes to?

edit: eh ill just post it


I am making a shell I have a parent process that does this every time a command is executed that is supposed to pipe to another command:


if (dup2(STDOUT_FILENO, pipe_fd[1]) < 0) {
err(EX_OSERR, "dup2 error");
}
[code]

This sets my pipe's write side to stdout

the child process does this:

[code]

if (dup2(pipe_fd[0], STDIN_FILENO) < 0) {
err(EX_OSERR, "dup2 error");
}

if (dup2(pipe_fd[1], STDOUT_FILENO) < 0) {
err(EX_OSERR, "dup2 error");
}


if a child process is part of the piping, it takes stdin from other commands (from the pipe) and sends stdout into the write end

now of course there is a lot more to my code than this, I have to check certain situations, but this is the gist

here is what is going on that I don't understand

If I run a command series that has 1 pipe, this works fine (which I think it shouldn't....)

echo hello | grep e

it works great. my code sees a pipe conjunction, opens a pipe, process the first command
forks, child redirects to and from pipe and the first command goes into the pipe

second command processes, parent sets write end of pipe to stdout
child (which actually executes the command) sets the read end and write end to both point to pipe

child does read from pipe, but apparently writes to stdout. why does it write to stdout? shouldn't it write to the pipe? the child code comes after the parent code, the child should be redirecting the write into the pipe, no? what is going on


and if I do a command like

ls | more | grep e

it doesn't work. it processes the first 2 commands correctly, and then the "more" writes to stdout and grep e reads an empty buffer.

There is something about dup2 and pipes that I am missing. For some reason if I do


if (dup2(pipe_fd[1], STDOUT_FILENO) < 0) {
err(EX_OSERR, "dup2 error");
}



if (dup2(STDOUT_FILENO, pipe_fd[1]) < 0) {
err(EX_OSERR, "dup2 error");
}


I can never point stdout back to my pipe. it's like that side of my pipe is gone. how am I using this incorrectly


edit: I get the impression no one here is into this stuff, lol
don't blame ya
Deleted User 3420
Profile Blog Joined May 2003
24492 Posts
Last Edited: 2017-04-30 11:44:39
April 30 2017 00:04 GMT
#17549
ok here is a question you guys will probably like more (though I suspect it's super easy)

the question is


x=0
For i=1 to n
For j=i to i+1
x=x+i+j; (This is just one step)


Find a function f(n) such that the runtime is Θ(f(n)).

Big theta means both Big O and Big omega?

So the function that it wants is f(n) = n ?
is this right?
seems a little easy so I am probably screwing it up
Manit0u
Profile Blog Joined August 2004
Poland17243 Posts
April 30 2017 07:01 GMT
#17550
Won't that be n^2 + 1?
Time is precious. Waste it wisely.
supereddie
Profile Joined March 2011
Netherlands151 Posts
April 30 2017 07:55 GMT
#17551
On April 30 2017 09:04 travis wrote:
ok here is a question you guys will probably like more (though I suspect it's super easy)

the question is


x=0
For i=1 to n
For j=i to i+1
x=x+i+j; (This is just one step)


Find a function f(n) such that the runtime is Θ(f(n)).

Big theta means both Big O and Big?

So the function that it wants is f(n) = n ?
is this right?
seems a little easy so I am probably screwing it up

I'm not that good in math, but I just put n=1 ... n=4 into a spreadsheet and fiddled with it to see a pattern.
I noticed that this is the same:

x=0
xi=0
xj=0
For i=1 to n
For j=i to i+1
xi++;
xj++;
endfor
endfor
x = xi + xj;

Since all that happens for j is '1+2+3+4', times n, and for i is '1+2+3' times n+1, all I need is a formula for 1+2+3+4. Looking up 1+2+3+4 lead me to Wikipedia and the formula x = n*(n+1)/2.
Since you have two 1+2+3+4..., one until n and one until n+1, the resulting function would be:

nj = n+1
x = nj * (n * (n + 1) / 2) + n * (nj * (nj + 1) / 2)

There is probably a better or nicer function but this seems to work.
"Do not try to make difficult things possible, but make simple things simple." - David Platt on Software Design
Acrofales
Profile Joined August 2010
Spain17971 Posts
Last Edited: 2017-04-30 09:04:22
April 30 2017 08:55 GMT
#17552
On April 30 2017 09:04 travis wrote:
ok here is a question you guys will probably like more (though I suspect it's super easy)

the question is


x=0
For i=1 to n
For j=i to i+1
x=x+i+j; (This is just one step)


Find a function f(n) such that the runtime is Θ(f(n)).

Big theta means both Big O and Big?

So the function that it wants is f(n) = n ?
is this right?
seems a little easy so I am probably screwing it up

Are you sure the second loop looks like that? Because that's essentially the exact same thing as:


x=0
For i=1 to n
x=x+2*i;


So f(n) = n seems spot on. But I agree that that seems rather trivial.

Edit: I'm assuming your for-loop pseudocode runs without including the end condition. If it does include the end condition the above code does not do the same, but that just means it runs twice for every i, so big-theta complexity is still n.
Deleted User 3420
Profile Blog Joined May 2003
24492 Posts
Last Edited: 2017-04-30 12:02:43
April 30 2017 11:58 GMT
#17553
eddie are you and manitou misreading the code?
I couldn't really understand your solution, eddie.

But I think you guys are misinterpreting the 2nd line


For j=i to i+1


as something like

For j = 1 to i+1


acrofales, what do you mean by "you're assuming my for-loop runs without including the end condition"? What do you mean by the end condition?


To be honest I have a suspicion that it *was* supposed to be something like j = 1 to i+1 in the 2nd loop, but I am going to go with what's on the paper, lol. If it's the professors mistake I will take advantage of it
Acrofales
Profile Joined August 2010
Spain17971 Posts
April 30 2017 12:10 GMT
#17554
On April 30 2017 20:58 travis wrote:
eddie are you and manitou misreading the code?
I couldn't really understand your solution, eddie.

But I think you guys are misinterpreting the 2nd line


For j=i to i+1


as something like

For j = 1 to i+1


acrofales, what do you mean by "you're assuming my for-loop runs without including the end condition"? What do you mean by the end condition?


To be honest I have a suspicion that it *was* supposed to be something like j = 1 to i+1 in the 2nd loop, but I am going to go with what's on the paper, lol. If it's the professors mistake I will take advantage of it


Does "to" mean "up to and including", or "up to, but excluding": in other words, "<=" or "<". For the time complexity it doesn't matter (it's a constant factor), but in case of the former, my refactoring of the code would be wrong.


supereddie
Profile Joined March 2011
Netherlands151 Posts
April 30 2017 14:25 GMT
#17555
On April 30 2017 20:58 travis wrote:
eddie are you and manitou misreading the code?
I couldn't really understand your solution, eddie.

But I think you guys are misinterpreting the 2nd line


For j=i to i+1


as something like

For j = 1 to i+1


acrofales, what do you mean by "you're assuming my for-loop runs without including the end condition"? What do you mean by the end condition?


To be honest I have a suspicion that it *was* supposed to be something like j = 1 to i+1 in the 2nd loop, but I am going to go with what's on the paper, lol. If it's the professors mistake I will take advantage of it

Ah, i read it as
For j = 1 to i+1

I don't like one-letter variablenames :p

Still, just write out the first few n-values (n=1, n=2, n=3, n=4) and try to find a formula. I created a simple spreadsheet with columns for x, i and j and just filled in the values for different n.

The sum of i can be represented with: n + n^2
Sum of j = i + n = (n + n^2) + n = 2n + n^2
x = i + j = (n + n^2) + (2n + n^2) = 3n + 2n^2
"Do not try to make difficult things possible, but make simple things simple." - David Platt on Software Design
Hanh
Profile Joined June 2016
146 Posts
April 30 2017 14:53 GMT
#17556
On April 29 2017 23:54 travis wrote:
anyone around for a little bit that I could message a few questions about dup2 and pipes to?

edit: eh ill just post it

...



I couldn't understand much of what you said but here's some code that should help you understand pipe and dup2.

+ Show Spoiler +


#include <stdio.h>
#include <stdlib.h>
#include <sys/types.h>
#include <unistd.h>

void close_fds(int* fd) {
close(fd[0]);
close(fd[1]);
}

void run_pipe(char** cmds, int n) {
printf("CMD: %s\n", cmds[0]);
if (n == 1) {
execl("/bin/sh", "sh", "-c", cmds[0], NULL);
}
else {
int fd[2];

pipe(fd);
pid_t pid = fork();
if (pid == 0) {
dup2(fd[1], 1);
close_fds(fd);
execl("/bin/sh", "sh", "-c", cmds[0], NULL);
}
else {
dup2(fd[0], 0);
close_fds(fd);
run_pipe(cmds + 1, n - 1);
}
}
}

int main() {
char *cmds[] = { "ls -l ..", "grep core", "wc"};

run_pipe(cmds, 3);
}


Deleted User 3420
Profile Blog Joined May 2003
24492 Posts
April 30 2017 15:25 GMT
#17557
this is pretty close to the implementation I ended up using for my program

though I am having a ton of trouble with soemthing like


(ls | more) | more


because I fork and then send the contents of my subshell back to my tree traversal, and when it sees the new pipe it doesn't know how to handle the difference between being in a subshell vs being out of one. When I get on the right side of the pipe in the subshell I end up having closed both ends of the pipe, and then when the "more" tries to read from the pipe there is nothing in it (or some other sort of problem), and my program breaks

this project is really hard :/

maybenexttime
Profile Blog Joined November 2006
Poland5540 Posts
Last Edited: 2017-04-30 15:28:17
April 30 2017 15:27 GMT
#17558
If some calculation can be done element-wise on whole matrices/vectors, should I still define it as a function or just put it in the calculations block? Is defining it as a function considered redundant? If it weren't possible to do it element-wise, I would need to use a for-loop and defining a function would be as obvious solution, but I'm not sure what to do in this case.

def assign_location(i, j):

L_el = np.array([2*i-1, 2*i, 2*j-1, 2*j])

return L_el
Hanh
Profile Joined June 2016
146 Posts
April 30 2017 15:47 GMT
#17559
On May 01 2017 00:25 travis wrote:
this is pretty close to the implementation I ended up using for my program

though I am having a ton of trouble with soemthing like


(ls | more) | more


because I fork and then send the contents of my subshell back to my tree traversal, and when it sees the new pipe it doesn't know how to handle the difference between being in a subshell vs being out of one. When I get on the right side of the pipe in the subshell I end up having closed both ends of the pipe, and then when the "more" tries to read from the pipe there is nothing in it (or some other sort of problem), and my program breaks

this project is really hard :/


What's the syntax that it needs to support?
Deleted User 3420
Profile Blog Joined May 2003
24492 Posts
Last Edited: 2017-04-30 16:05:59
April 30 2017 16:05 GMT
#17560
I don't understand the question

the syntax of the commands themselves are the same as in any shell

the syntax in the tree is a tree of structures that have various fields, the 2 most important fields being an enum that can be "pipe" "subshell" or "and", or an array of strings that represents a commmand with it's arguments

so I traverse the tree and if it is a conjunction I take the proper action (fork off a subshell, open a pipe, or do nothing if its and). if I am forking off a subshell the child sends the stuff that is under on the subshell back to the traversal function while the parent waits for the traversal/child to finish.

if it's a command I fork and the parent waits for the child to exec the command.


so I have 4 primary functions in play here

function 1 traverses the tree

function 2 reads what type of node it is and takes an appropriate action

function 3 reads commands that are found by function 2, forks and execs in the child. also handles where read and write go to if my "piping" global int is greater than 0

function 4 opens a subshell if found by function one. it forks, in the child sets write to the pipe if a pipe is open, and closes read if a pipe is open, then sets "piping" to 0. then the child sends the node below it to the tree for traversal.


This works for all cases except for where we have to open a new pipe in a subshell. that's because in the subshell I had set "piping" to 0. So when we open a new pipe, we act like there is only one pipe open, so it opens the pipe, passes it to the second command in the subshell, closes the pipe). But that sends the read to standard out rather than to the pipe that is outside of our subshell.


Hopefully you can read this stuff and stay sane.


Prev 1 876 877 878 879 880 1031 Next
Please log in or register to reply.
Live Events Refresh
Next event in 9h 54m
[ Submit Event ]
Live Streams
Refresh
StarCraft 2
Nina 214
Livibee 208
RuFF_SC2 78
ProTech74
StarCraft: Brood War
Artosis 1128
Icarus 6
Dota 2
monkeys_forever667
Counter-Strike
tarik_tv7163
Fnx 1821
Stewie2K977
Super Smash Bros
Mew2King140
Heroes of the Storm
Khaldor239
Other Games
summit1g10102
fl0m765
ViBE246
Maynarde177
JuggernautJason20
Organizations
Other Games
gamesdonequick46739
BasetradeTV56
StarCraft 2
Blizzard YouTube
StarCraft: Brood War
BSLTrovo
sctven
[ Show 14 non-featured ]
StarCraft 2
• davetesta35
• Berry_CruncH13
• AfreecaTV YouTube
• intothetv
• Kozan
• IndyKCrew
• LaughNgamezSOOP
• Migwel
• sooper7s
StarCraft: Brood War
• BSLYoutube
• STPLYoutube
• ZZZeroYoutube
Dota 2
• Ler60
League of Legends
• masondota2795
Upcoming Events
Wardi Open
9h 54m
Replay Cast
22h 54m
Sparkling Tuna Cup
1d 8h
WardiTV European League
1d 14h
MaNa vs sebesdes
Mixu vs Fjant
ByuN vs HeRoMaRinE
ShoWTimE vs goblin
Gerald vs Babymarine
Krystianer vs YoungYakov
PiGosaur Monday
1d 22h
The PondCast
2 days
WardiTV European League
2 days
Jumy vs NightPhoenix
Percival vs Nicoract
ArT vs HiGhDrA
MaxPax vs Harstem
Scarlett vs Shameless
SKillous vs uThermal
uThermal 2v2 Circuit
2 days
Replay Cast
2 days
RSL Revival
3 days
ByuN vs SHIN
Clem vs Reynor
[ Show More ]
Replay Cast
3 days
RSL Revival
4 days
Classic vs Cure
FEL
4 days
RSL Revival
5 days
FEL
5 days
FEL
5 days
Sparkling Tuna Cup
6 days
RSL Revival
6 days
FEL
6 days
Liquipedia Results

Completed

BSL Season 20
HSC XXVII
Heroes 10 EU

Ongoing

JPL Season 2
Acropolis #3
KCM Race Survival 2025 Season 2
CSL 17: 2025 SUMMER
Copa Latinoamericana 4
Jiahua Invitational
Championship of Russia 2025
RSL Revival: Season 1
Murky Cup #2
BLAST.tv Austin Major 2025
ESL Impact League Season 7
IEM Dallas 2025
PGL Astana 2025
Asian Champions League '25
BLAST Rivals Spring 2025
MESA Nomadic Masters
CCT Season 2 Global Finals
IEM Melbourne 2025

Upcoming

2025 ACS Season 2: Qualifier
CSLPRO Last Chance 2025
CSL Xiamen Invitational
2025 ACS Season 2
CSLPRO Chat StarLAN 3
K-Championship
uThermal 2v2 Main Event
SEL Season 2 Championship
FEL Cracov 2025
Esports World Cup 2025
StarSeries Fall 2025
FISSURE Playground #2
BLAST Open Fall 2025
BLAST Open Fall Qual
Esports World Cup 2025
BLAST Bounty Fall 2025
BLAST Bounty Fall Qual
IEM Cologne 2025
FISSURE Playground #1
TLPD

1. ByuN
2. TY
3. Dark
4. Solar
5. Stats
6. Nerchio
7. sOs
8. soO
9. INnoVation
10. Elazer
1. Rain
2. Flash
3. EffOrt
4. Last
5. Bisu
6. Soulkey
7. Mini
8. Sharp
Sidebar Settings...

Advertising | Privacy Policy | Terms Of Use | Contact Us

Original banner artwork: Jim Warren
The contents of this webpage are copyright © 2025 TLnet. All Rights Reserved.