Lightning Car Company

The Lightning Car Company is a British sports car developer, originally based in Fulham and Peterborough, the company relocated to Coventry and is focused on the development and production of high performance electric sports cars.

Lightning Car Company
Private
IndustryAutomotive
Founded18 January 2007
Headquarters,
ProductsCars
OwnerIain Sanderson (96%)
Websitehttps://lightninggt.com

Lightning GT

The firm's first product, the eponymous Lightning GT, was unveiled in 2008 where it won Car of The Show at the last Excel London Motor Show.[1][2] It is loosely based on an extant internal-combustion vehicle from Ronart Cars. It incorporates quick-charging lithium-titanate batteries from Altairnano into a body made from Carbon Fibre. The Lightning GT employs rear wheel drive from two synchronous motors to accelerate to 60 miles per hour (97 km/h) in less than 4 seconds and has an expected usable range of 150 miles (240 km) on a single battery charge, with a range extender battery pack option increasing this to 225 miles (360 km).

The company was taking orders for 2012 delivery, this was later moved back to 2014, and subsequently 2017. The prototype was displayed at the Coventry Motofest, featuring a revised Magtec power train.

gollark: Please also give me write access to the repo.
gollark: Oh, right, array indexing.
gollark: ```python# parsita-based pseudocode syntax parserfrom stmt import *from parsita import *from parsita.util import constantdef compose(f, g): return lambda x: f(g(x))def map_expr(x): start, end = x if end == "": return start return Op([start, end[1]], end[0])def map_unop_expr(x): return Op(x[1], x[0])def aliases(name, aliases): p = lit(name) for alias in aliases: p |= (lit(alias) > (lambda _: name)) return pclass ExprParser(TextParsers): ε = lit("") IntLit = reg("\-?[0-9]+") > compose(IntLit, int) StrLit = "'" >> reg("[^']*") << "'" > StrLit # TODO escapes (not in "spec" but could be needed) FloatLit = reg("\-?[0-9]+\.[0-9]+") > compose(FloatLit, float) Identifier = reg("[a-zA-Z_]+[a-zA-Z_0-9]*") > Var BracketedExpr = "(" >> Expr << ")" UnaryOperator = lit("NOT") Start = FloatLit | StrLit | IntLit | BracketedExpr | (UnaryOperator & Expr > map_unop_expr) | Identifier # avoid left recursion problems by not doing left recursion # AQA pseudocode does not appear to have a notion of "operator precedence", simplifying parsing logic nicely BinaryOperator = aliases("≤", ["<="]) | aliases("≠", ["!="]) | aliases("≥", [">="]) | lit("DIV") | lit("MOD") | lit("AND") | lit("OR") | reg("[+/*\-=<>]") End = (BinaryOperator & Expr) | ε Expr = (Start & End) > map_exprparse = ExprParser.Expr.parsex = parse("1+2+3 != 6 AND NOT 4 AND x + y")if isinstance(x, Failure): print(x.message)else: print(x.value)```
gollark: <@332271551481118732> Expression parsing is done, I think.
gollark: I wonder if AQA pseudocode *does* have operator precedence. We may need to harvest exam papers.

See also

Notes

  1. "dailytech.com, March 10, 2008". Dailytech.com. Retrieved 27 November 2010.
  2. Cockcroft, Lucy (10 July 2008). "The Telegraph, July 10, 2008". The Telegraph. Retrieved 27 November 2010.
  • 3. Green Pioneers: Can I interest you in an electric supercar? Sunday Times article 24 October 2010

Official website


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