Carol Ronning Kapsner

Carol Ronning Kapsner (born November 25, 1947) is a former Justice of the North Dakota Supreme Court. Carol Ronning Kapsner was born and raised in Bismarck, North Dakota. She graduated with B.A. degree in English literature from College of St. Catherine, studied 17th-century English literature at Oxford University, received a Master of Arts degree in English literature from Indiana University, and a Juris Doctor degree from the University of Colorado School of Law in Boulder, Colorado, in 1977. She was appointed to the Supreme Court in 1998. She retired from active service on July 31, 2017.[1]

Career
  • 1977 - started the law firm of Kapsner and Kapsner
  • 1980 - served as president of the Burleigh County Bar Association.
  • 1988-1996 - appointed by the Bar Association to serve on the Judicial Conference
  • 1998 - appointed by Governor Ed Schafer to fill vacancy created by Justice Herbert L. Meschke
  • 2000 - elected to a full 10-year term
gollark: See, this is much nicer.
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.

References
  1. Smith, Nick (April 25, 2017). "Supreme Court Justice Carol Kapsner to resign in July". The Bismarck Tribune. Retrieved August 28, 2017.



This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.