grapefruit-records 0.1.0.5 → 0.1.0.6
raw patch · 2 files changed
+33/−26 lines, 2 filesPVP: major bump suggested
API removals or changes: PVP suggests a major version bump
API changes (from Hackage documentation)
- Data.Record: instance [overlap ok] (Dissection init initRemainder lookupName lookupSort, (initRemainder :& (lastName ::: lastSort)) ~ remainder) => Dissection (init :& (lastName ::: lastSort)) remainder lookupName lookupSort
- Data.Record: instance [overlap ok] (Dissection record remainder subname subsort, Subrecord subrecord remainder) => Subrecord (subrecord :& (subname ::: subsort)) record
- Data.Record: instance [overlap ok] (Kind kind, Record kind record, Sort kind sort) => Record kind (record :& (name ::: sort))
- Data.Record: instance [overlap ok] (Show (init style), Show (last style)) => Show ((:&) init last style)
- Data.Record: instance [overlap ok] (Show name, Show (Value style sort)) => Show ((:::) name sort style)
- Data.Record: instance [overlap ok] Kind kind => Record kind X
- Data.Record: instance [overlap ok] Show (X style)
- Data.Record: instance [overlap ok] Subrecord X record
- Data.Record: instance [overlap ok] lastSort ~ lookupSort => Dissection (init :& (lookupName ::: lastSort)) init lookupName lookupSort
- Data.Record.Context: instance [overlap ok] Style style => Style (ContextStyle context style)
- Data.Record.Optionality: instance [overlap ok] OptRecord X
- Data.Record.Optionality: instance [overlap ok] OptRecord optRecord => OptRecord (optRecord :& (Opt name ::: sort))
- Data.Record.Optionality: instance [overlap ok] OptRecord optRecord => OptRecord (optRecord :& (Req name ::: sort))
- Data.Record.Plain: instance [overlap ok] Kind PlainKind
- Data.Record.Plain: instance [overlap ok] Sort PlainKind val
- Data.Record.Plain: instance [overlap ok] Style PlainStyle
- Data.Record.Signal: instance [overlap ok] Kind SignalKind
- Data.Record.Signal: instance [overlap ok] Sort SignalKind (Of signal val)
- Data.Record.Signal: instance [overlap ok] Style (ConnectorStyle connector)
- Data.Record.Signal: instance [overlap ok] Style (SignalStyle era)
+ Data.Record: data family Forall kind :: (* -> *) -> *;
+ Data.Record: instance (Data.Record.Dissection init initRemainder lookupName lookupSort, (initRemainder Data.Record.:& (lastName Data.Record.::: lastSort)) ~ remainder) => Data.Record.Dissection (init Data.Record.:& (lastName Data.Record.::: lastSort)) remainder lookupName lookupSort
+ Data.Record: instance (Data.Record.Dissection record remainder subname subsort, Data.Record.Subrecord subrecord remainder) => Data.Record.Subrecord (subrecord Data.Record.:& (subname Data.Record.::: subsort)) record
+ Data.Record: instance (Data.Record.Kind kind, Data.Record.Record kind record, Data.Record.Sort kind sort) => Data.Record.Record kind (record Data.Record.:& (name Data.Record.::: sort))
+ Data.Record: instance (GHC.Show.Show (init style), GHC.Show.Show (last style)) => GHC.Show.Show ((Data.Record.:&) init last style)
+ Data.Record: instance (GHC.Show.Show name, GHC.Show.Show (Data.Record.Value style sort)) => GHC.Show.Show ((Data.Record.:::) name sort style)
+ Data.Record: instance Data.Record.Kind kind => Data.Record.Record kind Data.Record.X
+ Data.Record: instance Data.Record.Subrecord Data.Record.X record
+ Data.Record: instance GHC.Show.Show (Data.Record.X style)
+ Data.Record: instance lastSort ~ lookupSort => Data.Record.Dissection (init Data.Record.:& (lookupName Data.Record.::: lastSort)) init lookupName lookupSort
+ Data.Record: type family K style :: *;
+ Data.Record: }
+ Data.Record.Context: infixr 0 `app`
+ Data.Record.Context: instance Data.Record.Style style => Data.Record.Style (Data.Record.Context.ContextStyle context style)
+ Data.Record.Optionality: instance Data.Record.Optionality.OptRecord Data.Record.X
+ Data.Record.Optionality: instance Data.Record.Optionality.OptRecord optRecord => Data.Record.Optionality.OptRecord (optRecord Data.Record.:& (Data.Record.Optionality.Opt name Data.Record.::: sort))
+ Data.Record.Optionality: instance Data.Record.Optionality.OptRecord optRecord => Data.Record.Optionality.OptRecord (optRecord Data.Record.:& (Data.Record.Optionality.Req name Data.Record.::: sort))
+ Data.Record.Optionality: type family Required optRecord :: * -> *;
+ Data.Record.Optionality: }
+ Data.Record.Plain: instance Data.Record.Kind Data.Record.Plain.PlainKind
+ Data.Record.Plain: instance Data.Record.Sort Data.Record.Plain.PlainKind val
+ Data.Record.Plain: instance Data.Record.Style Data.Record.Plain.PlainStyle
+ Data.Record.Signal: instance Data.Record.Kind Data.Record.Signal.SignalKind
+ Data.Record.Signal: instance Data.Record.Sort Data.Record.Signal.SignalKind (Internal.Signal.Of signal val)
+ Data.Record.Signal: instance Data.Record.Style (Data.Record.Signal.ConnectorStyle connector)
+ Data.Record.Signal: instance Data.Record.Style (Data.Record.Signal.SignalStyle era)
- Data.Record: (:&) :: !(record style) -> !(field style) -> :& record field style
+ Data.Record: (:&) :: !(record style) -> !(field style) -> (:&) record field style
- Data.Record: (:=) :: !name -> Value style sort -> ::: name sort style
+ Data.Record: (:=) :: !name -> Value style sort -> (:::) name sort style
- Data.Record: build :: Record kind record => thing X -> (forall record name. Record kind record => Forall kind (ExtenderPiece thing record name)) -> thing record
+ Data.Record: build :: Record kind record => thing X -> (forall record name. (Record kind record) => Forall kind (ExtenderPiece thing record name)) -> thing record
- Data.Record: class Kind kind where data family Forall kind :: (* -> *) -> *
+ Data.Record: class Kind kind where data Forall kind :: (* -> *) -> * where {
- Data.Record: class Kind kind => Record kind record
+ Data.Record: class (Kind kind) => Record kind record
- Data.Record: class Kind (K style) => Style style where type family K style :: *
+ Data.Record: class (Kind (K style)) => Style style where type K style :: * where {
- Data.Record: encase :: Kind kind => (forall sort. Sort kind sort => piece sort) -> Forall kind piece
+ Data.Record: encase :: Kind kind => (forall sort. (Sort kind sort) => piece sort) -> Forall kind piece
- Data.Record.Optionality: class OptRecord (optRecord :: * -> *) where type family All optRecord :: * -> * type family Required optRecord :: * -> *
+ Data.Record.Optionality: class OptRecord (optRecord :: * -> *) where type All optRecord :: * -> * type Required optRecord :: * -> * where {
- Data.Record.Signal: consume :: Record SignalKind record => ConsumerRecord record -> Circuit era (SignalRecord era record) ()
+ Data.Record.Signal: consume :: (Record SignalKind record) => ConsumerRecord record -> Circuit era (SignalRecord era record) ()
- Data.Record.Signal: produce :: Record SignalKind record => ProducerRecord record -> Circuit era () (SignalRecord era record)
+ Data.Record.Signal: produce :: (Record SignalKind record) => ProducerRecord record -> Circuit era () (SignalRecord era record)
- Data.Record.Signal.Context: consume :: Record SignalKind record => ContextConsumerRecord context record -> ReaderArrow context (Circuit era) (SignalRecord era record) ()
+ Data.Record.Signal.Context: consume :: (Record SignalKind record) => ContextConsumerRecord context record -> ReaderArrow context (Circuit era) (SignalRecord era record) ()
- Data.Record.Signal.Context: produce :: Record SignalKind record => ContextProducerRecord context record -> ReaderArrow context (Circuit era) () (SignalRecord era record)
+ Data.Record.Signal.Context: produce :: (Record SignalKind record) => ContextProducerRecord context record -> ReaderArrow context (Circuit era) () (SignalRecord era record)
Files
- LICENSE +22/−19
- grapefruit-records.cabal +11/−7
LICENSE view
@@ -2,27 +2,30 @@ Copyright © 2011–2014 Wolfgang Jeltsch All rights reserved. -Redistribution and use in source and binary forms, with or without modification,-are permitted provided that the following conditions are met:+Redistribution and use in source and binary forms, with or without+modification, are permitted provided that the following conditions are+met: - • Redistributions of source code must retain the above copyright notice,- this list of conditions and the following disclaimer.+ • Redistributions of source code must retain the above copyright+ notice, this list of conditions and the following disclaimer. - • Redistributions in binary form must reproduce the above copyright notice,- this list of conditions and the following disclaimer in the documentation- and/or other materials provided with the distribution.+ • Redistributions in binary form must reproduce the above copyright+ notice, this list of conditions and the following disclaimer in+ the documentation and/or other materials provided with the+ distribution. • Neither the name of the copyright holders nor the names of the- contributors may be used to endorse or promote products derived from this- software without specific prior written permission.+ contributors may be used to endorse or promote products derived+ from this software without specific prior written permission. -THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS “AS IS” AND-ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED-WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE-DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDERS OR CONTRIBUTORS BE LIABLE-FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL-DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR-SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER-CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR-TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF-THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.+THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS “AS+IS” AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED+TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A+PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT+HOLDERS OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,+SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED+TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR+PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF+LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING+NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS+SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
grapefruit-records.cabal view
@@ -1,5 +1,5 @@ Name: grapefruit-records-Version: 0.1.0.5+Version: 0.1.0.6 Cabal-Version: >= 1.8 Build-Type: Simple License: BSD3@@ -7,10 +7,10 @@ Copyright: © 2007–2009 Brandenburgische Technische Universität Cottbus © 2011–2014 Wolfgang Jeltsch Author: Wolfgang Jeltsch-Maintainer: wolfgang@cs.ioc.ee+Maintainer: wolfgang-it@jeltsch.info Stability: provisional-Homepage: http://grapefruit-project.org/-Package-URL: http://hackage.haskell.org/packages/archive/grapefruit-records/0.1.0.5/grapefruit-records-0.1.0.5.tar.gz+Homepage: https://grapefruit-project.org/+Package-URL: https://hackage.haskell.org/package/grapefruit-records-0.1.0.6/grapefruit-records-0.1.0.6.tar.gz Synopsis: A record system for Functional Reactive Programming Description: Grapefruit is a library for Functional Reactive Programming (FRP) with a focus on user interfaces. FRP makes it possible to@@ -20,12 +20,16 @@ . This package provides a record system for use with FRP. Category: Data, FRP, Reactivity-Tested-With: GHC == 7.6.3+Tested-With: GHC == 8.0.1 +Source-Repository head+ Type: darcs+ Location: http://hub.darcs.net/jeltsch/grapefruit+ Source-Repository this Type: darcs- Location: http://darcs.grapefruit-project.org/monolithic/0.1- Tag: grapefruit-0.1.0.5+ Location: http://hub.darcs.net/jeltsch/grapefruit+ Tag: grapefruit-0.1.0.6 Library Build-Depends: arrows >= 0.2 && < 0.5,