Archilestes
Archilestes is a genus of damselflies in the family Lestidae. Like most members of Lestidae, Archliestes rest with their wings spread out. This genus has eight species, the great spreadwing and California Spreadwing are the most common and widespread.
Archilestes | |
---|---|
A. grandis | |
Scientific classification | |
Kingdom: | |
Phylum: | |
Class: | |
Order: | |
Suborder: | |
Family: | |
Genus: | Archilestes Selys, 1862 |
The genus contains the following species:
- Archilestes californicus McLachlan, 1895 - California Spreadwing[1]
- Archilestes exoletus (Hagen in Selys, 1862)
- Archilestes grandis (Rambur, 1942) - Great Spreadwing[1]
- Archilestes guayaraca De Marmels, 1982
- Archilestes latialatus Donnelly, 1981
- Archilestes neblina Garrison, 1982
- Archilestes regalis Gloyd, 1944
- Archilestes tuberalatus (Williamson, 1921)
Notes
- "North American Odonata". University of Puget Sound. 2009. Archived from the original on 11 July 2010. Retrieved 5 August 2010.
gollark: ... also array literals, bee their bad docs.
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.
References
- Martin Schorr; Dennis Paulson. "World Odonata List". University of Puget Sound. Retrieved 12 Oct 2018.
Wikispecies has information related to Archilestes |
This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.