• Log InLog In
  • Register
Liquid`
Team Liquid Liquipedia
EDT 09:39
CEST 15:39
KST 22:39
  • 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
Weekly Cups (June 30 - July 6): Classic Doubles1[BSL20] Non-Korean Championship 4x BSL + 4x China7Flash Announces Hiatus From ASL64Weekly Cups (June 23-29): Reynor in world title form?13FEL Cracov 2025 (July 27) - $8000 live event22
StarCraft 2
General
Weekly Cups (June 30 - July 6): Classic Doubles 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?
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
SC uni coach streams logging into betting site BGH Auto Balance -> http://bghmmr.eu/ ASL20 Preliminary Maps Flash Announces Hiatus From ASL Player “Jedi” cheat on CSL
Tourneys
[BSL20] Grand Finals - Sunday 20:00 CET [BSL20] Non-Korean Championship 4x BSL + 4x China CSL Xiamen International Invitational The Casual Games of the Week Thread
Strategy
Simple Questions, Simple Answers I am doing this better than progamers do.
Other Games
General Games
Stormgate/Frost Giant Megathread Path of Exile 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 Stop Killing Games - European Citizens Initiative Summer Games Done Quick 2024! Summer Games Done Quick 2025!
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
The Automated Ban List
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: 756 users

The Big Programming Thread - Page 626

Forum Index > General Forum
Post a Reply
Prev 1 624 625 626 627 628 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.
Artesimo
Profile Joined February 2015
Germany546 Posts
April 30 2015 17:18 GMT
#12501
again, thanks for all the help, I was able properly finish my program. I do however have some questions regarding lists/linked lists.
If i understand lists correctly, you take an object/structure/template that stores some stuff. You then organize them by having each object/structure/template having a pointer that leads you to the next element of the list(next). If the object/structure/template also has an pointer that leads you to the previous element(head), it is a linked list.
In contrast to other datastructures/containers you cant access random elements of the list, without following the chain untill you find the one you want. If you insert/delete an object/structure/template from the list, you have to make sure that head/next get changed accordingly, otherwise the chain would be broken and parts of the list inaccessible. They work faster, a s long as you dont have to access random elements.

In contrast to that, stuff like <vector> (simplified spoken) takes care of the head/next part for you so you dont have to worry about it and grants methods to access random elements in a faster fashion.

So it seems, that lists/linked lists are the predecessor/more specialized version of stuff like vector. If I had a big database of adresses, to which I regularly send some newsletters, I would have organized them in a list/linked list since I usually just have to go through the whole thing/maybe have pointer to where the names with A/B/C etc. start.
If I have an database like bankaccoutn data, where sometimes certain parts get requested, without asking for the ata of just everyone in the database, I would use something else then linked lists.
So both ways of storing stuff are equally viable in their own scenario, even though we now have incredible computingpower at our disposal?

And on the behalf of my former problem, linked list wouldnt be the thing I want to use, since I want to randomly access parts of the database.
Millitron
Profile Blog Joined August 2010
United States2611 Posts
April 30 2015 17:34 GMT
#12502
On May 01 2015 02:18 Artesimo wrote:
again, thanks for all the help, I was able properly finish my program. I do however have some questions regarding lists/linked lists.
If i understand lists correctly, you take an object/structure/template that stores some stuff. You then organize them by having each object/structure/template having a pointer that leads you to the next element of the list(next). If the object/structure/template also has an pointer that leads you to the previous element(head), it is a linked list.
In contrast to other datastructures/containers you cant access random elements of the list, without following the chain untill you find the one you want. If you insert/delete an object/structure/template from the list, you have to make sure that head/next get changed accordingly, otherwise the chain would be broken and parts of the list inaccessible. They work faster, a s long as you dont have to access random elements.

In contrast to that, stuff like <vector> (simplified spoken) takes care of the head/next part for you so you dont have to worry about it and grants methods to access random elements in a faster fashion.

So it seems, that lists/linked lists are the predecessor/more specialized version of stuff like vector. If I had a big database of adresses, to which I regularly send some newsletters, I would have organized them in a list/linked list since I usually just have to go through the whole thing/maybe have pointer to where the names with A/B/C etc. start.
If I have an database like bankaccoutn data, where sometimes certain parts get requested, without asking for the ata of just everyone in the database, I would use something else then linked lists.
So both ways of storing stuff are equally viable in their own scenario, even though we now have incredible computingpower at our disposal?

And on the behalf of my former problem, linked list wouldnt be the thing I want to use, since I want to randomly access parts of the database.

I don't know anything about vector, but everything else you've said is spot on.
Who called in the fleet?
Manit0u
Profile Blog Joined August 2004
Poland17243 Posts
Last Edited: 2015-04-30 18:02:09
April 30 2015 18:00 GMT
#12503
On April 30 2015 23:26 netherh wrote:
I'm not sure there's any "good" way to read in a file format like that. Can you persuade your friend to use xml or json or lua... some actual data description language? (It'll be easier for him in the long run too).


XML is crap. It has a ton of overhead for even the simplest of data structures. JSON is fine but kind of meh. If you want readability you should go with YAML, which works very well with most languages (even Haskell if you're that hardcore). You could also go a step further and create a simple SQLite database to store the data.

The big plus of YAML is that its first and foremost goal is to be human readable. It also supports more complex data structures than JSON (while being easier to read).
Time is precious. Waste it wisely.
Ropid
Profile Joined March 2009
Germany3557 Posts
April 30 2015 18:12 GMT
#12504
@Artesimo:

For the list, while you can only do things at the position you currently look at, at that spot you can insert and remove elements without having to change all of the list. You only need to change the pointers that are in the surrounding elements. It's just the one pointer in the previous element for a singly-linked list, or also a second one in the following element for a doubly-linked list. It's also straight forward to think about how you'd go about inserting a second list into the spot where you are in your first list.

With the vector, if you remove or insert, you will have to copy the rest of the list to move it around. If the block where your vector is positioned in memory can't resize because something is following it, you will have to get a new block of memory and copy the whole vector.

Now, for some reason, the vector data structure actually beats the list on a real machine. I don't know if that's just most of the time or always. It has to do with things like caches in the CPU and latency of that vs. main memory.

When you use those data structures to deal with some sort of objects, what's saved in them is really just pointers to those objects. The vector will then just be an array of those pointers to the objects. A list will instead be multiple times the size of that array.

When you approach something like it's Math, try to reason about your problem so that you'll have proof that your solution is correct, a list is nice if the problem can be split into rules for (a) empty list, (b) single element, (c) rest of the list. You can then afterwards still hide the details of what the machine is actually doing in C++, make it so using a vector looks exactly like using a list. You can use those "iterators". So you can still use lists if it helps while thinking about your problem, but then the machine actually does something else.
"My goal is to replace my soul with coffee and become immortal."
Shield
Profile Blog Joined August 2009
Bulgaria4824 Posts
Last Edited: 2015-04-30 18:29:19
April 30 2015 18:25 GMT
#12505
On May 01 2015 02:18 Artesimo wrote:
again, thanks for all the help, I was able properly finish my program. I do however have some questions regarding lists/linked lists.
If i understand lists correctly, you take an object/structure/template that stores some stuff. You then organize them by having each object/structure/template having a pointer that leads you to the next element of the list(next). If the object/structure/template also has an pointer that leads you to the previous element(head), it is a linked list.
In contrast to other datastructures/containers you cant access random elements of the list, without following the chain untill you find the one you want. If you insert/delete an object/structure/template from the list, you have to make sure that head/next get changed accordingly, otherwise the chain would be broken and parts of the list inaccessible. They work faster, a s long as you dont have to access random elements.

In contrast to that, stuff like <vector> (simplified spoken) takes care of the head/next part for you so you dont have to worry about it and grants methods to access random elements in a faster fashion.

So it seems, that lists/linked lists are the predecessor/more specialized version of stuff like vector. If I had a big database of adresses, to which I regularly send some newsletters, I would have organized them in a list/linked list since I usually just have to go through the whole thing/maybe have pointer to where the names with A/B/C etc. start.
If I have an database like bankaccoutn data, where sometimes certain parts get requested, without asking for the ata of just everyone in the database, I would use something else then linked lists.
So both ways of storing stuff are equally viable in their own scenario, even though we now have incredible computingpower at our disposal?

And on the behalf of my former problem, linked list wouldnt be the thing I want to use, since I want to randomly access parts of the database.


Linked list doesn't have to point to the previous element. If so, it is singly linked list. Otherwise, doubly linked list.

If vector is like ArrayList in Java (and I think it's similar), then it uses array under the cover, so its implementation is completely different from list. Because it uses arrays, it can access them by index efficiently. That's why you have random access advantage with vectors. If you ask how a vector/ArrayList holds 'unlimited' data even though arrays are fixed, it is because they create a new array, its size is twice larger or something and they copy all previous elements if it needs more space.

I think databases don't use either. What they usually use is binary tree or tree of some sort as far as I remember.
Artesimo
Profile Joined February 2015
Germany546 Posts
April 30 2015 18:28 GMT
#12506
On May 01 2015 03:25 darkness wrote:

Linked list doesn't have to point to the previous element. If so, it is singly linked list. Otherwise, doubly linked list.

If vector is like ArrayList in Java (and I think it's similar), then it uses array under the cover, so its implementation is completely different from list. Because it uses arrays, it can access them by index efficiently. That's why you have random access advantage with vectors.

I think databases don't use either. What they usually use is binary tree or tree of some sort as far as I remember.


From what I read, binary trees mainly get implemented using linked lists. Could be wrong though.

@Ropid: thanks for the explanation
Blitzkrieg0
Profile Blog Joined August 2010
United States13132 Posts
April 30 2015 18:31 GMT
#12507
On May 01 2015 03:28 Artesimo wrote:
Show nested quote +
On May 01 2015 03:25 darkness wrote:

Linked list doesn't have to point to the previous element. If so, it is singly linked list. Otherwise, doubly linked list.

If vector is like ArrayList in Java (and I think it's similar), then it uses array under the cover, so its implementation is completely different from list. Because it uses arrays, it can access them by index efficiently. That's why you have random access advantage with vectors.

I think databases don't use either. What they usually use is binary tree or tree of some sort as far as I remember.


From what I read, binary trees mainly get implemented using linked lists. Could be wrong though.

@Ropid: thanks for the explanation


A binary tree is essentially a linked list that has two next pointers instead of only one so the comparison is pretty natural. It is possible to implement a binary tree as an array though.
I'll always be your shadow and veil your eyes from states of ain soph aur.
phar
Profile Joined August 2011
United States1080 Posts
May 01 2015 00:43 GMT
#12508
On April 30 2015 23:33 Artesimo wrote:
Show nested quote +
On April 30 2015 23:26 netherh wrote:
I'm not sure there's any "good" way to read in a file format like that. Can you persuade your friend to use xml or json or lua... some actual data description language? (It'll be easier for him in the long run too).


Unfortunately he only codes in java since its the only thing he knows. He also does it as a hobby since his work isnt related to IT in any form (even though he still is better than me at coding... for now ).


Have your friend consider protocol buffers. The java support for it is quite good (though it is an odd to get used to at first).
Who after all is today speaking about the destruction of the Armenians?
Artesimo
Profile Joined February 2015
Germany546 Posts
May 01 2015 11:29 GMT
#12509
On May 01 2015 09:43 phar wrote:
Have your friend consider protocol buffers. The java support for it is quite good (though it is an odd to get used to at first).


I will redirect this to him. I dont think he will really read it though, he just likes to fondle around with his java-skills without really expanding them as far as I can tell.
sabas123
Profile Blog Joined December 2010
Netherlands3122 Posts
Last Edited: 2015-05-01 20:45:20
May 01 2015 20:45 GMT
#12510
Anybody has some experiance with c# unit testing?

Im trying to test if if a function returns an object of type Grass (which is a subclass of type Tile), I used AreEqual and AreEqual<T> but keep getting errors like this


Result Message: Assert.AreEqual failed. Expected:<ConsiGame.Grass>. Actual:<ConsiGame.Grass>.

The harder it becomes, the more you should focus on the basics.
ZenithM
Profile Joined February 2011
France15952 Posts
Last Edited: 2015-05-01 21:00:20
May 01 2015 20:56 GMT
#12511
On May 02 2015 05:45 sabas123 wrote:
Anybody has some experiance with c# unit testing?

Im trying to test if if a function returns an object of type Grass (which is a subclass of type Tile), I used AreEqual and AreEqual<T> but keep getting errors like this


Result Message: Assert.AreEqual failed. Expected:<ConsiGame.Grass>. Actual:<ConsiGame.Grass>.


Are you checking for equality or equality of types? I don't know your exact code, but I would guess you're checking for the first (so, what you see printed is probably the default toString value, which you didn't override if I'm correct), while you want the second.
You should do this:
Assert.AreEqual(obj.GetType(), typeof(MyObject));

Is that what you do? Note that this passes if obj's exact type is MyObject, it fails if it is from a derived class I believe. Alternatively you could use
Assert.IsInstanceOfType(obj, typeof(MyObject));
, which does pass if obj is of a class derived from MyObject. I would probably use that in your case, so if you have subclasses of Grass, like GreenerGrass, it still passes your test
phar
Profile Joined August 2011
United States1080 Posts
May 02 2015 01:16 GMT
#12512
On May 01 2015 20:29 Artesimo wrote:
Show nested quote +
On May 01 2015 09:43 phar wrote:
Have your friend consider protocol buffers. The java support for it is quite good (though it is an odd to get used to at first).


I will redirect this to him. I dont think he will really read it though, he just likes to fondle around with his java-skills without really expanding them as far as I can tell.

Ah ha well, then props to you for trying to help, but maybe abandon all hope
Who after all is today speaking about the destruction of the Armenians?
dae
Profile Joined June 2010
Canada1600 Posts
Last Edited: 2015-05-02 02:40:06
May 02 2015 02:36 GMT
#12513
On May 01 2015 03:31 Blitzkrieg0 wrote:
Show nested quote +
On May 01 2015 03:28 Artesimo wrote:
On May 01 2015 03:25 darkness wrote:

Linked list doesn't have to point to the previous element. If so, it is singly linked list. Otherwise, doubly linked list.

If vector is like ArrayList in Java (and I think it's similar), then it uses array under the cover, so its implementation is completely different from list. Because it uses arrays, it can access them by index efficiently. That's why you have random access advantage with vectors.

I think databases don't use either. What they usually use is binary tree or tree of some sort as far as I remember.


From what I read, binary trees mainly get implemented using linked lists. Could be wrong though.

@Ropid: thanks for the explanation


A binary tree is essentially a linked list that has two next pointers instead of only one so the comparison is pretty natural. It is possible to implement a binary tree as an array though.


If you have a fairly balanced binary tree, it is really common to implement it as an array. Root node is at index 1 (or 0, but that makes the math a bit less nice). A node with index n's children are at indexes n*2 and n*2+1, and it's parent is at floor(n/2).

For example, the node at index 7 has children in positions 14 and 15, and parent at position 3.

Since n*2 and n/2 are just one bit shift operation, this is a rather fast way of implementing binary trees.

In addition, the binary representation of a number is directly correlated to it's position in the binary tree. (the series of 1's and 0's is the path to get to that node.)

sabas123
Profile Blog Joined December 2010
Netherlands3122 Posts
May 02 2015 11:37 GMT
#12514
On May 02 2015 05:56 ZenithM wrote:
Show nested quote +
On May 02 2015 05:45 sabas123 wrote:
Anybody has some experiance with c# unit testing?

Im trying to test if if a function returns an object of type Grass (which is a subclass of type Tile), I used AreEqual and AreEqual<T> but keep getting errors like this


Result Message: Assert.AreEqual failed. Expected:<ConsiGame.Grass>. Actual:<ConsiGame.Grass>.


Are you checking for equality or equality of types? I don't know your exact code, but I would guess you're checking for the first (so, what you see printed is probably the default toString value, which you didn't override if I'm correct), while you want the second.
You should do this:
Show nested quote +
Assert.AreEqual(obj.GetType(), typeof(MyObject));

Is that what you do? Note that this passes if obj's exact type is MyObject, it fails if it is from a derived class I believe. Alternatively you could use
Show nested quote +
Assert.IsInstanceOfType(obj, typeof(MyObject));
, which does pass if obj is of a class derived from MyObject. I would probably use that in your case, so if you have subclasses of Grass, like GreenerGrass, it still passes your test

Yes, that was exactly I was looking for.

thank you<3
The harder it becomes, the more you should focus on the basics.
Propelled
Profile Joined October 2010
Denmark184 Posts
May 02 2015 15:00 GMT
#12515
I have just started looking Javascript and I'm wondering if there's an OS agnostic constant for linebreaks, like phps PHP_EOL.

At the moment I'm doing something along these lines:
str.split("\r\n");
str.split("\n");

However I'm wondering if theres a way to do it in a single pass.
sabas123
Profile Blog Joined December 2010
Netherlands3122 Posts
Last Edited: 2015-05-02 17:55:58
May 02 2015 17:55 GMT
#12516
On May 03 2015 00:00 Propelled wrote:
I have just started looking Javascript and I'm wondering if there's an OS agnostic constant for linebreaks, like phps PHP_EOL.

At the moment I'm doing something along these lines:
str.split("\r\n");
str.split("\n");

However I'm wondering if theres a way to do it in a single pass.

Im not sure if the break line tag works entirely the same as EOL, but they both make a new line.


str.split("<br>");
The harder it becomes, the more you should focus on the basics.
Acrofales
Profile Joined August 2010
Spain17971 Posts
May 02 2015 18:28 GMT
#12517
On May 03 2015 02:55 sabas123 wrote:
Show nested quote +
On May 03 2015 00:00 Propelled wrote:
I have just started looking Javascript and I'm wondering if there's an OS agnostic constant for linebreaks, like phps PHP_EOL.

At the moment I'm doing something along these lines:
str.split("\r\n");
str.split("\n");

However I'm wondering if theres a way to do it in a single pass.

Im not sure if the break line tag works entirely the same as EOL, but they both make a new line.


str.split("<br>");

The html <br /> code is not the same thing at all. I don´t think there is an OS agnostic version (there's probably a library to do that, though, depending on your framework). Of course, if you just split on "\n" you will get all the ones with a carriage return in there as well, just remember to parse them out when you use your string.

Ame
Profile Joined October 2009
United States246 Posts
May 02 2015 20:22 GMT
#12518
Not sure if this is what you mean by 'single pass', but I think Javascript's str.split() accepts regex... so it might be doable with one call to str.split().

Then again regex might be introducing needless complexity, so eh D:
AKnopf
Profile Blog Joined March 2011
Germany259 Posts
Last Edited: 2015-05-02 20:59:34
May 02 2015 20:56 GMT
#12519
Well, a regex like /[\n\r]+/ is not too terribly complex. But you are right: It does not feel right, there should be a better solution to this.


"a\n\rb\nc\rd".split(/[ \n\r]+/) => Array [ "a", "b", "c", "d" ]
^
This space is not supposed to be there, but whithout, the backslash was not displayed in this post.
The world - its a funny place
spinesheath
Profile Blog Joined June 2009
Germany8679 Posts
Last Edited: 2015-05-02 21:03:39
May 02 2015 21:01 GMT
#12520
Now I don't know much JS, but that shouldn't matter here. A quick google search indicates that you probably should use a regex. There are 2 approaches: Use string.match with a regex that matches non-linebreak characters, or string.split with a regex that matches linebreaks. Don't know how accurate it really is, but this seems to be the best one:
string.split(\r\n|[ \n\v\f\r\x85\u2028\u2029])
See Alan Moore's comment a bit down the page.
(same deal as above, remove the space in front of the \n)

This should match \r\n, \r, \n and a number of other obscure newline variations. Shove it into a dedicated function, put a comment on it and never think about it again.
If you have a good reason to disagree with the above, please tell me. Thank you.
Prev 1 624 625 626 627 628 1031 Next
Please log in or register to reply.
Live Events Refresh
Wardi Open
11:00
#43
WardiTV1344
OGKoka 531
Harstem448
Rex169
IndyStarCraft 165
CranKy Ducklings117
Liquipedia
[ Submit Event ]
Live Streams
Refresh
StarCraft 2
OGKoka 531
Harstem 448
Hui .184
Rex 169
IndyStarCraft 165
StarCraft: Brood War
Bisu 3073
Flash 2328
Jaedong 1756
Hyuk 1094
firebathero 707
EffOrt 657
Larva 521
ZerO 478
actioN 454
Soulkey 441
[ Show more ]
Stork 397
Snow 306
Soma 298
GuemChi 163
Mind 133
sSak 118
Light 108
Pusan 106
PianO 94
Sharp 77
JulyZerg 75
hero 73
TY 65
Barracks 48
Yoon 37
Aegong 36
sorry 32
Free 29
zelot 27
GoRush 25
HiyA 24
soO 23
Movie 18
JYJ17
yabsab 17
Terrorterran 11
Shine 10
IntoTheRainbow 10
ivOry 5
Dota 2
qojqva3113
Gorgc2576
XaKoH 629
syndereN301
XcaliburYe297
League of Legends
singsing2583
Dendi1
Counter-Strike
byalli270
markeloff134
Super Smash Bros
Mew2King202
Other Games
hiko1246
B2W.Neo1069
Beastyqt386
crisheroes369
Lowko293
ArmadaUGS140
Liquid`VortiX70
ZerO(Twitch)20
Organizations
Other Games
gamesdonequick38108
StarCraft: Brood War
UltimateBattle 978
StarCraft 2
Blizzard YouTube
StarCraft: Brood War
BSLTrovo
sctven
[ Show 13 non-featured ]
StarCraft 2
• AfreecaTV YouTube
• intothetv
• Kozan
• IndyKCrew
• LaughNgamezSOOP
• Migwel
• sooper7s
StarCraft: Brood War
• BSLYoutube
• STPLYoutube
• ZZZeroYoutube
Dota 2
• C_a_k_e 3069
• WagamamaTV335
League of Legends
• Nemesis6060
Upcoming Events
RotterdaM Event
2h 21m
Replay Cast
10h 21m
Sparkling Tuna Cup
20h 21m
WardiTV European League
1d 2h
MaNa vs sebesdes
Mixu vs Fjant
ByuN vs HeRoMaRinE
ShoWTimE vs goblin
Gerald vs Babymarine
Krystianer vs YoungYakov
PiGosaur Monday
1d 10h
The PondCast
1d 20h
WardiTV European League
1d 22h
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
2 days
ByuN vs SHIN
Clem vs Reynor
[ Show More ]
Replay Cast
3 days
RSL Revival
3 days
Classic vs Cure
FEL
4 days
RSL Revival
4 days
FEL
4 days
FEL
5 days
BSL20 Non-Korean Champi…
5 days
Bonyth vs QiaoGege
Dewalt vs Fengzi
Hawk vs Zhanhun
Sziky vs Mihu
Mihu vs QiaoGege
Zhanhun vs Sziky
Fengzi vs Hawk
Sparkling Tuna Cup
5 days
RSL Revival
5 days
FEL
6 days
BSL20 Non-Korean Champi…
6 days
Bonyth vs Dewalt
QiaoGege vs Dewalt
Hawk vs Bonyth
Sziky vs Fengzi
Mihu vs Zhanhun
QiaoGege vs Zhanhun
Fengzi vs Mihu
Liquipedia Results

Completed

BSL Season 20
HSC XXVII
Heroes 10 EU

Ongoing

JPL Season 2
BSL 2v2 Season 3
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.