!"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmnopqr s t u v w x y z { | } ~  None6[This class relates a universe of possible column types to Haskell types, and provides a mechanism to infer which type best represents some textual data.Values that can be read from a # with more or less discrimination.Returns  if a value of the given type can not be read; returns 'Just Possibly' if a value can be read, but is likely ambiguous (e.g. an empty string); returns 'Just Definitely' if a value can be read and is unlikely to be ambiguous." ,Discard any estimate of a parse's ambiguity. Acts just like  : tries to parse a value from a 5 and discards any estimate of the parse's ambiguity.        Safe,DQRYCompound constraint that all types have instances for each of a list of type clasesses. AllHave classes types.TCompound constraint that a type has an instance for each of a list of type classes.Constraint that every element of a promoted list is equal to a particular type. That is, the list of types is a single type repeated some number of times.2A constraint on each element of a type-level list.<Remove the first occurence of a type from a type-level list.None,DIQRT;Used only for a show instance that parenthesizes the value.KA column's type includes a textual name and the data type of each element. Helper for making a  !" " ! !"None$%&*,9:;<=DOQRTb,The ability to pretty print a Rec' s fields.-7A constraint that a field can be deleted from a record..YRemove the column name phantom types from a record, leaving you with an unadorned Vinyl .18Enforce a constraint on the payload type of each column.2CStrip the column information from each element of a list of types.3A type function to convert a Record to a . ColFun f (Rec rs) = Rec f rs.5%Return the column names for a record.8"Add a column to the head of a row.9'Add a pure column to the head of a row.=Separate the first element of a row from the rest of the row.:MAdd a column to the tail of a row. Note that the supplied value should be a  to work with the Frames tooling.1Map a function across a homogeneous, monomorphic .;1Map a function across a homogeneous, monomorphic . Map a typeclass method across a 7 each of whose fields have instances of the typeclass.< Map a typeclass method across a 8 each of whose fields has an instance of the typeclass.=Delete a field from a record>Pretty printing of  values.?VBuild a record whose elements are derived solely from a constraint satisfied by each.,-./0123456789:;<=>?@ABCDE,-./0123456789:;<=>?=-89:6712./0;<,>3455?,-./0123456789:;<=>?@ABCDENone%&*,9:;<=DOQRTFu'Handlers ts b', is essentially a list of functions, one for each type in ts. All functions produce a value of type ba. Hence, 'Handlers ts b' would represent something like the type-level list: [t -> b | t in ts ]G#Newtype around functions for a to bI'Fold a field selection function over a .KKA function type constructor that takes its arguments in the reverse order.N A Field of a Record is a 'CoRec Identity'.OGeneralize algebraic sum types.QHelper to build a -able OR for Rec's.S Remove a  wrapper from a value.THelper to build a  Dict ShowUWe can inject a a O into a  where every field of the  is E except for the one whose type corresponds to the type of the given O variant.VShorthand for applying U with common functors.W,Apply a natural transformation to a variant.X*This can be used to pull effects out of a O.Y1Fold a field selection function over a non-empty .Z Similar to $: find the first field that is not .[ Similar to #: find the last field that is not .\Apply a type class method on a O. The first argument is a  value for a list of  constructors. For example, onCoRec [pr|Num,Ord|] (> 20) r-. If only one constraint is needed, use the pr1 quasiquoter.]Apply a type class method on a N. The first argument is a  value for a list of  constructors. For example, onCoRec [pr|Num,Ord|] (> 20) r-. If only one constraint is needed, use the pr1 quasiquoter.^kBuild a record whose elements are derived solely from a list of constraint constructors satisfied by each._cGiven a proxy of type t and a 'CoRec Identity' that might be a t, try to convert the CoRec to a t.`Pattern match on a CoRec by specifying handlers for each case. If the CoRec is non-empty this function is total. Note that the order of the Handlers has to match the type level list (t:ts).:{Mlet testCoRec = Col (Identity False) :: CoRec Identity [Int, String, Bool] inmatch testCoRec $? (H $ \i -> "my Int is the successor of " ++ show (i - 1))' :& (H $ \s -> "my String is: " ++ s)P :& (H $ \b -> "my Bool is not: " ++ show (not b) ++ " thus it is " ++ show b) :& RNil:}'"my Bool is not: True thus it is False"aPattern match on a CoRec by specifying handlers for each case. The only case in which this can produce a Nothing is if the list ts is empty.!FGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefFGHIJKLMNOPQRSTUVWXYZ[\]^_`a!OPNQfKLMedRSTUVIJcbWXYZ[\]^_`aGHFFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefNone%&*,-9:;<=DOQRT[ gOA universe of common column variants. These are the default column types that Frames can infer. See the  &http://acowley.github.io/Frames/#sec-4Tutorial> for an example of extending the default types with your own.hADefine a set of variants that captures all possible column types.iCommon column typesFInformation necessary for synthesizing row types and comparing types.A , tagged with the type it is associated with.WExtract a function to test whether some value of a given type could be read from some .Helper to call  on variants of a O.TPreserving the outermost two functor layers, replace each element with its TypeRep.We use a join semi-lattice on types for representations. The bottom of the lattice is effectively an error (we have nothing to represent),  Bool < Int,  Int < Double, and forall n. n <= Text.Find the best (i.e. smallest) O& variant to represent a parsed value.ghijkOghiOghighijkNone%&*+,9:;<=?DQRTabm(A record with unadorned values. This is Vinyl's  E. We give this type a name as it is used pervasively for records in Frames.nA cons function for building m values.o Separate the first element of a m from the rest of the row.p Undistribute  from a  $. This is just a specific usage of , but it is quite common.qShow each field of a m without its column name.lmnopqlmnopqmnlopqlmnopqn5 None %&*:QRrpreview src n f prints out the first n results of piping src through f.sselect (Proxy::Proxy [A,B,C]) extracts columns A, B, and CY, from a larger record. Note, this is just a way of pinning down the type of a usage of .tlenses (Proxy::Proxy [A,B,C]) provides a lens onto columns A, B, and C2. This is just a way of pinning down the type of .u>A proxy value quasiquoter; a way of passing types as values. [pr|T|] will splice an expression Proxy::Proxy T , while  [pr|A,B,C|] will splice in a value of Proxy :: Proxy [A,B,C] . If we have a record type with Name and Age# among other fields, we can write select P[pr|Name,Age|]@ for a function that extracts those fields from a larger record.vLike u7, but takes a single type, which is used to produce a  for a single-element list containing only that type. This is useful for passing a single type to a function that wants a list of types.Split on a delimiter.'Remove white space from both ends of a .rstuvwrstuvwrstwuvrstuvw NoneQRxA y whose rows are m values.yA y+ is a finite collection of rows indexed by .}Build a y from any . This simply uses a boxed  / to hold each row. If you have a collection of ms, consider using  .~ Horizontal y concatenation. That is, zipFrames f1 f2 will return a y% with as many rows as the smaller of f1 and f28 whose rows are the result of appending the columns of f2 to those of f1.The   instance for y5 provides a mechanism for vertical concatenation of y s. That is, f1 <> f2 will return a new y with the rows of f1 followed by the rows of f2. xyz{|}~xyz{|}~ yz{|x}~ xyz{|}~ None,9;DLQRTa PTooling to allocate, grow, write to, freeze, and index into records of vectors.0Immutable vector types for each column in a row..Mutable vector types for each column in a row.The mutable version of  a particular type.9The most efficient vector type for each column data type.Since we stream into the in-memory representation, we use an exponential growth strategy to resize arrays as more data is read in. This is the initial capacity of each column.bStream a finite sequence of rows into an efficient in-memory representation for further manipulation. Each column of the input table will be stored optimally based on its type, making use of the resulting generators a matter of indexing into a densely packed representation. Returns the number of rows and a record of column indexing functions. See  to convert the result to a y_ which provides an easier-to-use function that indexes into the table in a row-major fashion.!Stream a finite sequence of rows into an efficient in-memory representation for further manipulation. Each column of the input table will be stored optimally based on its type, making use of the resulting generators a matter of indexing into a densely packed representation. Returns a y3 that provides a function to index into the table.Like R, but applies the provided function to the record of columns before building the y.qConvert a structure-of-arrays to an array-of-structures. This can simplify usage of an in-memory representation.Stream a finite sequence of rows into an efficient in-memory representation for further manipulation. Each column of the input table will be stored optimally based on its type, making use of the resulting generator a matter of indexing into a densely packed representation.Build a y from a collection of m(s using efficient column-based storage.Keep only those rows of a x that satisfy a predicate. None*+,9:;<=DQRTdTransform a record into a list of its fields, retaining proof that each field is part of the whole.This is K, but the variables are at the front of the record, which reads a bit odd.'Turn a cons into a snoc after the fact.Like melt in the reshape2 package for the R language. It stacks multiple columns into a single column over multiple rows. Takes a specification of the id columns that remain unchanged. The remaining columns will be stacked.Suppose we have a record, r :: Record [Name,Age,Weight]. If we apply melt [pr1|Name|] r, we get two values with type 7Record [Name, "value" :-> CoRec Identity [Age,Weight]]. The first will contain Age in the value& column, and the second will contain Weight in the value column.Applies  to each row of a x. None*,9:;<=DOQRT Getter for a  field Setter for a  field.)Create a lens for accessing a field of a m. Getter for a m field. Setter for a m field.None!",9;<=DQRT[#5Control how row and named column types are generated.aUse these column names. If empty, expect a header row in the data file to provide column names.8A common prefix to use for every generated declaration.0The string that separates the columns on a row.*The row type that enumerates all columns.A type that identifies all the types that can be used to classify a column. This is essentially a type-level list of types. See .Parsing each component of a RecF= from a list of text chunks, one chunk per record component.:No quoting enabled. The separator may not appear in valuesQuoted values with the given quoting character. Quotes are escaped by doubling them. Mostly RFC4180 compliant, except doesn't support newlines in valuesDefault  ParseOptionsJ get column names from a header line, and use commas to separate columns.Default separator string.Helper to split a P on commas and strip leading and trailing whitespace from each resulting chunk.qPost processing applied to a list of tokens split by the separator which should have quoted sections reassembeldCInfer column types from a prefix (up to 1000 lines) of a CSV file.8Extract column names and inferred types from a CSV file.Read a RecF from one line of CSV.5Produce rows where any given entry can fail to parse.5Produce rows where any given entry can fail to parse. Returns a  ` producer of rows for which each column was successfully parsed. This is typically slower than . Returns a  ` producer of rows for which each column was successfully parsed. This is typically slower than .JReturns a producer of rows for which each column was successfully parsed.JReturns a producer of rows for which each column was successfully parsed.Generate a column type.LMassage a column name from a CSV file into a valid Haskell type identifier.$Declare a type synonym for a column.3Declare a singleton value of the given column type.YFor each column, we declare a type synonym for its type, and a Proxy value of that type.FSplice for manually declaring a column of a given type. For example, declareColumn "x2" ''Double will declare a type synonym type X2 = "x2" :-> Double and a lens x2.Shorthand for a  value of h! applied to the given type list. A default . This instructs the type inference engine to get column names from the data file, use the default column separator (a comma), infer column types from the default g1 set of types, and produce a row type with name Row.FGenerate a type for each row of a table. This will be something like (Record ["x" :-> a, "y" :-> b, "z" :-> c].Like , but additionally generates a type synonym for each column, and a proxy value of that type. If the CSV file has column names "foo", "bar", and "baz", then this will declare type Foo = "foo" :-> Int, for example, !foo = rlens (Proxy :: Proxy Foo), and "foo' = rlens' (Proxy :: Proxy Foo).CGenerate a type for a row of a table. This will be something like (Record ["x" :-> a, "y" :-> b, "z" :-> c]. Column type synonyms are not generated (see ).KGenerate a type for a row of a table all of whose columns remain unparsed Text values.Like , but additionally generates a type synonym for each column, and a proxy value of that type. If the CSV file has column names "foo", "bar", and "baz", then this will declare type Foo = "foo" :-> Int, for example, !foo = rlens (Proxy :: Proxy Foo), and "foo' = rlens' (Proxy :: Proxy Foo).1-1$None[  ,-./0123456789:;<=>?NO\]ghilmnopqrstuvwxyz{|}~ !"#$%&'()*+,-./01223456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`aabcd4efghijklmnopqrstuvwxyz{|}~                           !  "#$%&'()*+,-./01234#Frames-0.1.3-GL4F9S3qPB86KIoOFtnbAzFrames Frames.RecFFrames.ColumnTypeableFrames.TypeLevel Frames.Col Frames.CoRecFrames.ColumnUniverse Frames.RecFrames.Exploration Frames.Frame Frames.InCore Frames.MeltFrames.RecLens Frames.CSV Data.MonoidFirstLasttoFrame#text-1.2.2.1-KQUs69qI1MxK1HnREULzu6Data.Text.InternalText"vinyl-0.5.2-3EutD40rSJo1yFj7iF9G8zData.Vinyl.Core rtraverserappendColumnTypeablecolType inferType ParseableparseParsedPossibly DefinitelydiscardConfidenceparse'$fParseableText$fParseableDouble$fParseableFloat$fParseableInt$fParseableBool$fFunctorParsed $fEqParsed $fOrdParsed $fShowParsedAllHave HasInstancesAllAreLAllRDeleteCol':->ColgetColcol' $fShowCol' $fShow:->$fEq:->$fOrd:->$fNum:-> $fMonoid:-> $fReal:->$fRealFloat:-> $fRealFrac:->$fFractional:-> $fFloating:->ShowRec CanDeleteAsVinyltoVinyl fromVinylAllColsUnColumnColFun ColumnHeaders columnHeaders:&Nil frameCons frameConsA frameSnocmapMono mapMethodrdelshowRec reifyDict $fShowRecf: $fShowRecf[] $fAsVinyl: $fAsVinyl[]$fColumnHeaders:$fColumnHeaders[]HandlersHandlerHFoldRecfoldRecOprunOpFieldCoReccol zipRecsWithdictIdshowDict corecToRec corecToRec'corecMap corecTraversefoldRec1 firstField lastFieldonCoReconField reifyDictsasAmatchmatch' $fFoldRecss: $fFoldRecss[] $fEqCoRec $fShowCoRec $fShowCoRec0ColumnsColumnUniverse CommonColumns$fColumnTypeableCoRec $fMonoidCoRec RecordColumnsRecord&: recUnconsrecMaybe showFields pipePreviewselectlensesprpr1 recToListFrameRecFrame frameLengthframeRow boxedFrame zipFrames $fMonadFrame$fApplicativeFrame$fFoldableFrame $fMonoidFrame$fFunctorFrameRecVecallocRec freezeRecgrowRecwriteRecindexRec produceRecVectorsVectorMs VectorMFor VectorForinitialCapacity inCoreSoA inCoreAoS inCoreAoS'toAoSinCore filterFrame $fRecVec: $fRecVec[] HasLength hasLength RDeleteAll RowToColumnrowToColumnAuxElemOfDisjointNotOrElem rowToColumnmeltAuxmeltRow' retroSnocmeltRowmelt $fHasLengthk:$fHasLengthk[]$fRowToColumnts:$fRowToColumnts[]rlens'rget'rput'rlensrgetrputRowGen columnNames tablePrefix separator rowTypeNamecolumnUniverseReadRecreadRec ParserOptionsheaderOverridecolumnSeparator quotingMode QuotingMode NoQuotingRFC4180Quoting QuoteChar Separator defaultParser defaultSep tokenizeRowreassembleRFC4180QuotedPartsprefixInferencereadColHeadersreadRowreadTableMaybeOptreadTableMaybe readTableOpt' readTable' readTableOpt readTablerecDecsanitizeTypeName mkColTDec mkColPDeccolDec declareColumncolQrowGen tableType tableTypes tableType'tableTypesText' tableTypes' $fReadRec: $fReadRec[]$fLiftParserOptions$fLiftQuotingMode$fEqQuotingMode$fShowQuotingMode$fEqParserOptions$fShowParserOptionsbaseGHC.BaseNothing$readable-0.3.1-yGDFpkuWvRHKvYKDnQAp9 Data.ReadablefromTextRec frameUnconsmapMonoV mapMethodVshowRec'GHC.ShowShowGHC.ListzipWithDict Data.ProxyProxyghc-prim GHC.Types ConstraintColInfoTypedData.Typeable.InternalTypeRepinferParseableinferParseable' elementTypes lubTypeRepsbestRepmkTyped quoteType tryParseAllData.Vinyl.FunctorIdentityMaybeData.Vinyl.LensrcastrsubsetsplitOnstripStringInt Data.FoldableFoldable&vector-0.11.0.0-BEDZb5o2QOhGbIm6ky7rl6 Data.VectorVectorMonoid MonadPlusRElemRSubsetrreplace REquivalent∈⊆≅<::~:<+>