Daniela Oltean

Daniela Oltean (born July 24, 1980, in Cluj-Napoca, Cluj County) is a Romanian long track speed skater who participates in international competitions.

Personal records

Personal records
Women's Speed skating
Event Result Date Location Notes
500 m 41.15 2005-11-20 Salt Lake City
1,000 m 1:19.53 2005-11-19 Salt Lake City
1,500 m 2:00.81 2005-11-20 Salt Lake City
3,000 m 4:10.96 2005-11-18 Salt Lake City
5,000 m 7:27.14 2004-01-11 Heerenveen

Career highlights

Olympic Winter Games
2002 - Salt Lake City, 29th at 3000 m
2002 - Salt Lake City, 36th at 1500 m
2006 - Torino, 26th at 3000 m
2006 - Torino, 35th at 1000 m
2006 - Torino, 35th at 1500 m
World Allround Championships
2003 - Göteborg, 23rd
World Single Distance Championships
2003 - Berlin, 22nd at 500 m
2003 - Berlin, 19th at 3000 m
World Sprint Championships
2006 - Heerenveen, 30th
2007 - Hamar, 29th
European Allround Championships
1999 - Heerenveen, 23rd
2000 - Hamar, 19th
2001 - Baselga di Pinè, 13th
2002 - Erfurt, 19th
2003 - Heerenveen, 18th
2004 - Heerenveen, 13th
2005 - Heerenveen, 23rd
2006 - Hamar, 20th
2008 - Kolomna, 18th
World Junior Allround Championships
1998 - Roseville, Minnesota, 29th
1999 - Geithus, 30th
2000 - Seinäjoki, 15th
National Championships
2002 - Miercurea Ciuc, 1st at allround
2003 - Miercurea Ciuc, 2nd at 1000 m
2003 - Miercurea Ciuc, 2nd at 500 m
2003 - Miercurea Ciuc, 2nd at 1500 m
2003 - Miercurea Ciuc, 2nd at allround
2003 - Miercurea Ciuc, 2nd at 3000 m
2004 - Miercurea Ciuc, 3rd at 1000 m
2004 - Miercurea Ciuc, 3rd at 500 m
2004 - Miercurea Ciuc, 1st at 3000 m
2004 - Miercurea Ciuc, 1st at allround
2004 - Miercurea Ciuc, 1st at 1500 m
gollark: ```rustpub struct List<T> { head: Link<T>,}type Link<T> = Option<Box<Node<T>>>;struct Node<T> { elem: T, next: Link<T>,}impl<T> List<T> { pub fn new() -> Self { List { head: None } } pub fn push(&mut self, elem: T) { let new_node = Box::new(Node { elem: elem, next: self.head.take(), }); self.head = Some(new_node); } pub fn pop(&mut self) -> Option<T> { self.head.take().map(|node| { self.head = node.next; node.elem }) }}impl<T> Drop for List<T> { fn drop(&mut self) { let mut cur_link = self.head.take(); while let Some(mut boxed_node) = cur_link { cur_link = boxed_node.next.take(); } }}```
gollark: ... or at all?
gollark: You don't have a thing to efficiently deallocate the list.
gollark: Collections which work on a big chunk of memory or something *do* kind of have to use unsafe, linked lists or (some?) trees mostly don't.
gollark: And the unsafe stuff is better checked than in ©.
This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.