K#:      !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUV W X Y Z [ \ ] ^ _ ` a b c d e f g h i j k l m n o p q r s t u v w x y z { | } ~  None -FKSTVReplaceColumns x ys, keeps the textual name of each element of ys", but replaces its data type with x.;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     Safe7];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-FST"*ReplaceAll x ys3 produces a type-level list of the same length as ys where each element is x/. In other words, it replaces each element of ys with x. This would be map (const x) ys in value-level Haskell.+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.*++*None%&'+-;<=>?FQSTVdh9,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.=N-ary version of ! over functorial frame rows. See .>N-ary version of  over pure frame rows. See .?-Lift an N-ary function to work over a row of  computations. See .@%Lift an N-ary function over types in g to work over a record of d * computations. A more general version of ?.ADelete a field from a recordBPretty printing of  values.CVBuild a record whose elements are derived solely from a constraint satisfied by each.,-./0123456789:;<=>?@ABCA-89:6712./0;<=>@?,B3455C,./045None&'+,-;<=>?AFSTVcdAK(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.LA cons function for building K values.M Separate the first element of a K from the rest of the row.N Undistribute  from a  $. This is just a specific usage of , but it is quite common.OShow each field of a K without its column name.JKLMNOKLJMNOL5None+-;<=>?FQSTVDQ Getter for a  fieldR Setter for a  field.S)Create a lens for accessing a field of a K.T Getter for a K field.U Setter for a K field.PQRSTUPQRSTU NoneSTNiVA W whose rows are K values.WA W+ is a finite collection of rows indexed by .[Build a W from any . This simply uses a boxed / to hold each row. If you have a collection of Ks, consider using  .\ Horizontal W concatenation. That is, zipFrames f1 f2 will return a W% 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.aThe  instance for W5 provides a mechanism for vertical concatenation of W s. That is, f1 <> f2 will return a new W with the rows of f1 followed by the rows of f2.VWXZY[\WXYZVc[ba`_^]\WXYZ None+,-;<=>?FSTV[ndTransform a record into a list of its fields, retaining proof that each field is part of the whole.pThis is sK, but the variables are at the front of the record, which reads a bit odd.q'Turn a cons into a snoc after the fact.rLike 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.sApplies r to each row of a V.defghijklmnopqrsmlkjighutnofpqrdewvsdegh None-;=FNSTVc{" xPTooling 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 W_ 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 W3 that provides a function to index into the table.Like R, but applies the provided function to the record of columns before building the W.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 W from a collection of K(s using efficient column-based storage.Keep only those rows of a V that satisfy a predicate.x~}|{zyxyz{|}~xyz{|}~ None+,-;<=>?FQSTVh.Perform an inner join operation on two frames. Requires the language extension TypeApplications( for specifying the columns to join on.QJoins can be done on on one or more columns provided the matched columns have a Grouping instance, most simple types do.\Presently join columns must be present and named identically in both left and right frames. Basic usage: :innerJoin @'[JoinCol1, ..., JoinColN] leftFrame rightFramePerform an outer join ( FULL JOIN) operation on two frames.)Requires the use the language extension TypeApplications( for specifying the columns to join on.IJoins can be done on on one or more columns provided the columns have a Grouping instance, most simple types do.\Presently join columns must be present and named identically in both left and right frames.Returns a list of Records in the Maybe interpretation functor. If a key in the left table is missing from the right table, non-key columns from the right table are filled with Nothingu. If a key in the right table is missing from the left table, non-key columns from the right table are filled with Nothing. Basic usage: :outerJoin @'[JoinCol1, ..., JoinColN] leftFrame rightFrame.Perform an right join operation on two frames. Requires the language extension TypeApplications( for specifying the columns to join on.IJoins can be done on on one or more columns provided the columns have a Grouping instance, most simple types do.\Presently join columns must be present and named identically in both left and right frames.Returns a list of Records in the Maybe interpretation functor. If a key in the right table is missing from the left table, non-key columns from the right table are filled with Nothing. Basic usage: :rightJoin @'[JoinCol1, ..., JoinColN] leftFrame rightFrame-Perform an left join operation on two frames. Requires the language extension TypeApplications( for specifying the columns to join on.IJoins can be done on on one or more columns provided the columns have a Grouping instance, most simple types do.\Presently join columns must be present and named identically in both left and right frames.Returns a list of Records in the Maybe interpretation functor. If a key in the left table is missing from the right table, non-key columns from the right table are filled with Nothing. Basic usage: 9leftJoin @'[JoinCol1, ..., JoinColN] leftFrame rightFrameThe left frameThe right frameThe joined frameThe left frameThe right frame6A list of the merged records, now in the Maybe functorThe left frameThe right frame6A list of the merged records, now in the Maybe functorThe left frameThe right frame6A list of the merged records, now in the Maybe functor None+,-;<=>?FQSTVh None&'+-.;<=>?FQSTV]d OA 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.ADefine a set of variants that captures all possible column types.Common 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 .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.OThe high-level goal here is that we will pick the "greater" of two choices in  . A # parse result is preferred over a ' parse result. If we have two distinct 5 parse results, we give up. If we have two distinct G parse results, we are in dangerous waters: all data is parseable at both types, so which do we default to? The defaulting choices made here are described in the previous paragraph. If there is no defaulting rule, we give up (i.e. use  as a representation). Find the best (i.e. smallest) p variant to represent a parsed value. For inspection in GHCi after loading this module, consider this example::set -XTypeApplications:set -XOverloadedStrings#import Data.Vinyl.CoRec (foldCoRec)6foldCoRec parsedTypeRep (bestRep @CommonColumns "2.3")Definitely Double None"#-;=>?FQSTV]g/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 .!A producer of lines of T.Text xsParsing 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.Produce the lines of a latin1 (or ISO8859 Part 1) encoded file as T.Text  values. Similar to PT.readFileLn  that uses the system locale for decoding, but built on the PT.decodeIso8859_1  decoder.Read a RecF from one line of CSV.5Produce rows where any given entry can fail to parse.cStream lines of CSV data into rows of Rec  values values where any given entry can fail to parse.Stream lines of CSV data into rows of Rec  values values where any given entry can fail to parse. In the case of a parse failure, the raw  of that entry is retained.5Produce rows where any given entry can fail to parse.\Stream lines of CSV data into rows of Rec  values where any given entry can fail to parse.Stream lines of CSV data into rows of Rec  values where any given entry can fail to parse. In the case of a parse failure, the raw  of that entry is retained.JReturns a producer of rows for which each column was successfully parsed.PPipe lines of CSV text into rows for which each column was successfully parsed.JReturns a producer of rows for which each column was successfully parsed.PPipe lines of CSV text into rows for which each column was successfully parsed.Generate a column type.!Capitalize the first letter of a .LMassage a column name from a CSV file into a valid Haskell type identifier.$Declare a type synonym for a column.\Declare a singleton value of the given column type and lenses for working with that column.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 ! 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 1 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).AInspect no more than this many lines when inferring column types.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 ).*Tokenize the first line of a P.Producer .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). E a header row with column names followed by a line of text for each K: with each field separated by a comma. If your source of K values is a  , consider using  to keep everything streaming. E a header row with column names followed by a line of text for each K< with each field separated by a comma. This is the same as j, but adapated for cases where you have streaming input that you wish to use to produce streaming output.JWrite a header row with column names followed by a line of text for each K to the given file.:>None &'+<ST#preview src n f prints out the first n results of piping src through f.select (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 .lenses (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 .>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.Like 7, 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 .NoneFT8hRun a self-contained Pipes.Effect  and execute the finalizers associated with the SafeT  transformer.!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 W3 that provides a function to index into the table.Like R, but applies the provided function to the record of columns before building the W.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.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 toAoS to convert the result to a W_ which provides an easier-to-use function that indexes into the table in a row-major fashion.p !"#$%&'()* *+,-./0123456789:;<=>?@ABCJKLMNOPQRSTUVWXYZ[\rs + !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghij k l l m n o p q r s t u v w x y z { | } ~          RS U      !"#$%#&'()(*+,-./0./1./2./3456(7(8(9(:(;(<(=(>(?(@(ABCDCECFCGCHI#Frames-0.4.0-47U3lkGtNa7IKqqgWbE24HFramesFrames.ColumnUniverse Frames.RecF Frames.ColFrames.ColumnTypeableFrames.TypeLevel Frames.RecFrames.RecLens Frames.Frame Frames.Melt Frames.InCore Frames.JoinsFrames.ExtraInstances Frames.CSVFrames.ExplorationtoFrame#text-1.2.2.2-EakMpasry3jA6OIwSZhq9MData.Text.InternalText$vinyl-0.8.1.1-Aq0Iy6xFd74Ef42TFkkRSPData.Vinyl.CoRecCoRecData.Vinyl.Core rtraverserappendReplaceColumnsCol':->ColgetColcol' $fShow:-> $fShowCol'$fEq:->$fOrd:->$fNum:->$fSemigroup:-> $fMonoid:-> $fReal:->$fRealFloat:-> $fRealFrac:->$fFractional:-> $fFloating:->ColumnTypeablecolType inferType ParseableparseParsedPossibly DefinitelydiscardConfidenceparse'$fFunctorParsed$fParseableText$fParseableDouble$fParseableFloat$fParseableInt$fParseableBool $fEqParsed $fOrdParsed $fShowParsed ReplaceAllAllAreShowRec CanDeleteAsVinyltoVinyl fromVinylAllColsUnColumnColFun ColumnHeaders columnHeaders:&Nil frameCons frameConsA frameSnocmapMono mapMethodruncurry runcurry' runcurryA' runcurryArdelshowRec reifyDict$fColumnHeaders:$fColumnHeaders[] $fAsVinyl: $fAsVinyl[] $fShowRecf: $fShowRecf[] RecordColumnsRecord&: recUnconsrecMaybe showFieldsrlens'rget'rput'rlensrgetrputFrameRecFrame frameLengthframeRow boxedFrame zipFrames $fMonadFrame$fApplicativeFrame$fFoldableFrame$fSemigroupFrame $fMonoidFrame $fEqFrame$fFunctorFrame HasLength hasLength RDeleteAll RowToColumnrowToColumnAuxElemOfDisjointNotOrElem rowToColumnmeltAuxmeltRow' retroSnocmeltRowmelt$fRowToColumnats:$fRowToColumnkts[] $fHasLengthk:$fHasLengthk[]RecVecallocRec freezeRecgrowRecwriteRecindexRec produceRecVectorsVectorMs VectorMFor VectorForinitialCapacity inCoreSoA inCoreAoS inCoreAoS'toAoSinCore filterFrame $fRecVec: $fRecVec[] innerJoin outerJoin rightJoinleftJoin $fNFData:-> $fNFDataFrame $fNFDataRec $fNFDataRec0$fNFData1Identity$fNFDataIdentity$fGroupingText $fGrouping:-> $fGroupingRec$fGroupingRec0ColumnsColumnUniverse CommonColumns parsedTypeRep$fColumnTypeableCoRec$fSemigroupCoRec $fMonoidCoRecRowGen columnNames tablePrefix separator rowTypeNamecolumnUniverse lineReaderReadRecreadRec ParserOptionsheaderOverridecolumnSeparator quotingMode QuotingMode NoQuotingRFC4180Quoting QuoteChar Separator defaultParser defaultSep tokenizeRowreassembleRFC4180QuotedPartsprefixInferencereadColHeadersreadFileLatin1LnreadRowreadTableMaybeOptpipeTableMaybeOptpipeTableEitherOptreadTableMaybepipeTableMaybepipeTableEither readTableOpt pipeTableOpt readTable pipeTablerecDec capitalize1sanitizeTypeName mkColTDec mkColPDec lowerHeadcolDec declareColumncolQrowGen tableType tableTypes prefixSize tableType' colNamesPtableTypesText' tableTypes' produceCSV pipeToCSVwriteCSV$fLiftQuotingMode$fLiftParserOptions $fReadRec: $fReadRec[]$fEqQuotingMode$fShowQuotingMode$fEqParserOptions$fShowParserOptions pipePreviewselectlensesprpr1 recToList runSafeEffectbaseGHC.BaseNothing%readable-0.3.1-Km2YdzHR0HWKJRGBz0Btok Data.ReadablefromTextRec frameUnconsmapMonoV mapMethodV Data.TupleuncurryData.Vinyl.Curry ApplicativeData.Vinyl.FunctorComposeshowRec'IdentityMaybeghc-prim GHC.TypesInt Data.FoldableFoldable&vector-0.12.0.1-LflPw1fguMb6as60UrZpxN Data.VectorVectorMonoidColInfoTyped Data.TypeableTypeRepinferParseableinferParseable' elementTypes lubTypeRepsbestRep Data.ProxyProxy"pipes-4.3.9-FOelNlxnLbK2fonN2G8GYPPipesyield Pipes.CoreProducerData.Vinyl.LensrcastrsubsetsplitOnstripString'pipes-safe-2.2.9-7eQ4bstN96FKoDtPHlofEm Pipes.SaferunSafePrunSafeTSafeT MonadSafeonFieldonCoRecFieldRecElemRElem RecSubsetrreplaceRSubset REquivalent∈⊆≅<::~:<+>Data.Vinyl.TypeLevelRDeleteRecAllAllConstrained AllSatisfied AllAllSat