chore(versionbump): Removed redundant restrictions, fixed instances, ...

This commit is contained in:
Stephan Barth 2024-09-23 12:40:43 +02:00
parent 9cbe79cbe3
commit 53aced7714
7 changed files with 26 additions and 28 deletions

View File

@ -41,8 +41,7 @@ apDummy :: Text
apDummy = "dummy"
dummyLogin :: forall site.
( YesodAuth site
, YesodPersist site
( YesodPersist site
, SqlBackendCanRead (YesodPersistBackend site)
, RenderAFormSite site
, RenderMessage site DummyMessage

View File

@ -197,8 +197,7 @@ apLdap :: Text
apLdap = "LDAP"
campusLogin :: forall site.
( YesodAuth site
, RenderMessage site CampusMessage
( RenderMessage site CampusMessage
, RenderAFormSite site
, RenderMessage site (ValueRequired site)
, RenderMessage site ADInvalidCredentials

View File

@ -48,8 +48,7 @@ apHash :: Text
apHash = "PWHash"
hashLogin :: forall site.
( YesodAuth site
, YesodPersist site
( YesodPersist site
, SqlBackendCanRead (YesodPersistBackend site)
, PersistRecordBackend User (YesodPersistBackend site)
, RenderMessage site PWHashMessage

View File

@ -88,7 +88,7 @@ disambiguateMsgFile MsgFile{..}
| otherwise
= Right $ MsgFile{ msgFileContent = fmap msgDefToSingletons <$> toSingletons msgFileContent, .. }
where
toDuplicates :: forall k v. (Eq k, Hashable k) => InsOrdHashMap k (NonEmpty v) -> InsOrdHashSet k
toDuplicates :: forall k v. Hashable k => InsOrdHashMap k (NonEmpty v) -> InsOrdHashSet k
toDuplicates = InsOrdHashSet.fromList . InsOrdHashMap.keys . InsOrdHashMap.filter (minLength 2)
duplicateDefs = toDuplicates msgFileContent
duplicateVars = InsOrdHashMap.mapMaybe (assertM' (not . InsOrdHashSet.null) . toDuplicates . msgDefVars . NonEmpty.head) msgFileContent
@ -120,17 +120,17 @@ ensureTypesMsgFile MsgFile{..}
}
accumInsOrdHashMap :: (Foldable f, Eq k, Hashable k)
accumInsOrdHashMap :: (Foldable f, Hashable k)
=> f (k, v)
-> InsOrdHashMap k (NonEmpty v)
accumInsOrdHashMap = F.foldl' (\acc (k, v) -> InsOrdHashMap.insertWith (<>) k (pure v) acc) InsOrdHashMap.empty
unionsInsOrdHashMap :: (Foldable f, Eq k, Hashable k)
unionsInsOrdHashMap :: (Foldable f, Hashable k)
=> f (InsOrdHashMap k (NonEmpty v))
-> InsOrdHashMap k (NonEmpty v)
unionsInsOrdHashMap = F.foldl' (InsOrdHashMap.unionWith (<>)) InsOrdHashMap.empty
insOrdHashMapKeysSet :: (Eq k, Hashable k) => InsOrdHashMap k v -> InsOrdHashSet k
insOrdHashMapKeysSet :: Hashable k => InsOrdHashMap k v -> InsOrdHashSet k
insOrdHashMapKeysSet = InsOrdHashSet.fromList . map (view _1) . InsOrdHashMap.toList

View File

@ -271,8 +271,8 @@ respondFileConditional representationLastModified cType FileReference{..} = do
)
| otherwise -> throwM SourceFilesContentUnavailable
| otherwise
-> return $ sendResponseStatus noContent204 ()
{- | otherwise
-> return $ sendResponseStatus noContent204 ()*) -} -- rendundant, but only commented out in case that changes in the future
where
condInfo = RepresentationConditionalInformation
{ representationETag = review etagFileReference <$> fileReferenceContent

View File

@ -398,7 +398,7 @@ memcachedByHere = do
[e| \mExp k -> withMemcachedKeyedLoc (memcachedBy mExp (loc, k)) |]
data HashableDynamic = forall a. (Hashable a, Eq a) => HashableDynamic !(TypeRep a) !a
data HashableDynamic = forall a. Hashable a => HashableDynamic !(TypeRep a) !a
instance Hashable HashableDynamic where
hashWithSalt s (HashableDynamic tRep v) = s `hashWithSalt` tRep `hashWithSalt` v
@ -408,7 +408,7 @@ instance Eq HashableDynamic where
Nothing -> False
hashableDynamic :: forall a.
( Typeable a, Hashable a, Eq a )
( Typeable a, Hashable a )
=> a -> HashableDynamic
hashableDynamic v = HashableDynamic (typeOf v) v
@ -418,7 +418,7 @@ memcachedLimit = unsafePerformIO . newTVarIO $ HashMap.empty
memcachedLimitedWith :: ( MonadIO m
, MonadLogger m
, Typeable k', Hashable k', Eq k'
, Typeable k', Hashable k'
)
=> (m (Maybe a), a -> m ())
-> (m a -> MaybeT m a) -- ^ Wrap execution on cache miss
@ -467,7 +467,7 @@ memcachedLimitedKey :: forall a k' m.
( MonadHandler m, HandlerSite m ~ UniWorX
, MonadThrow m
, Typeable a, Binary a, NFData a
, Typeable k', Hashable k', Eq k'
, Typeable k', Hashable k'
)
=> k'
-> Word64 -- ^ burst-size (tokens)
@ -497,7 +497,7 @@ memcachedLimitedKeyBy :: forall a k' k m.
( MonadHandler m, HandlerSite m ~ UniWorX
, MonadThrow m
, Typeable a, Binary a, NFData a
, Typeable k', Hashable k', Eq k'
, Typeable k', Hashable k'
, Binary k
)
=> k'
@ -612,7 +612,7 @@ liftAsyncTimeout :: forall k'' a m.
( MonadHandler m, HandlerSite m ~ UniWorX
, MonadUnliftIO m
, MonadThrow m
, Typeable k'', Hashable k'', Eq k''
, Typeable k'', Hashable k''
, Typeable a
)
=> DiffTime
@ -665,7 +665,7 @@ liftAsyncTimeout dt (hashableDynamic -> cK) act = ifNotM memcachedAvailable (lif
memcachedTimeoutWith :: ( MonadHandler m, HandlerSite m ~ UniWorX
, MonadUnliftIO m
, MonadThrow m
, Typeable k'', Hashable k'', Eq k''
, Typeable k'', Hashable k''
, Typeable a
)
=> (m (Maybe a), a -> m ()) -> DiffTime -> k'' -> m a -> m (Maybe a)
@ -680,7 +680,7 @@ memcachedTimeoutWith (doGet, doSet) dt cK act = runMaybeT $ do
memcachedTimeout :: ( MonadHandler m, HandlerSite m ~ UniWorX
, MonadThrow m
, MonadUnliftIO m
, Typeable k'', Hashable k'', Eq k''
, Typeable k'', Hashable k''
, Typeable a, Binary a, NFData a
)
=> Maybe Expiry -> DiffTime -> k'' -> m a -> m (Maybe a)
@ -689,7 +689,7 @@ memcachedTimeout mExp = memcachedTimeoutWith (memcachedGet, memcachedSet mExp)
memcachedTimeoutBy :: ( MonadHandler m, HandlerSite m ~ UniWorX
, MonadThrow m
, MonadUnliftIO m
, Typeable k'', Hashable k'', Eq k''
, Typeable k'', Hashable k''
, Typeable a, Binary a, NFData a
, Binary k
)
@ -710,7 +710,7 @@ memcachedLimitedTimeout :: forall a k'' m.
( MonadHandler m, HandlerSite m ~ UniWorX
, MonadThrow m
, MonadUnliftIO m
, Typeable k'', Hashable k'', Eq k''
, Typeable k'', Hashable k''
, Typeable a, Binary a, NFData a
)
=> Word64 -- ^ burst-size (tokens)
@ -727,9 +727,9 @@ memcachedLimitedKeyTimeout :: forall a k' k'' m.
( MonadHandler m, HandlerSite m ~ UniWorX
, MonadThrow m
, MonadUnliftIO m
, Typeable k'', Hashable k'', Eq k''
, Typeable k'', Hashable k''
, Typeable a, Binary a, NFData a
, Typeable k', Hashable k', Eq k'
, Typeable k', Hashable k'
)
=> k'
-> Word64 -- ^ burst-size (tokens)
@ -746,7 +746,7 @@ memcachedLimitedTimeoutBy :: forall a k'' k m.
( MonadHandler m, HandlerSite m ~ UniWorX
, MonadThrow m
, MonadUnliftIO m
, Typeable k'', Hashable k'', Eq k''
, Typeable k'', Hashable k''
, Typeable a, Binary a, NFData a
, Binary k
)
@ -765,9 +765,9 @@ memcachedLimitedKeyTimeoutBy :: forall a k' k'' k m.
( MonadHandler m, HandlerSite m ~ UniWorX
, MonadThrow m
, MonadUnliftIO m
, Typeable k'', Hashable k'', Eq k''
, Typeable k'', Hashable k''
, Typeable a, Binary a, NFData a
, Typeable k', Hashable k', Eq k'
, Typeable k', Hashable k'
, Binary k
)
=> k'

View File

@ -11,6 +11,7 @@ module Utils.Exam.Correct
import Import.NoFoundation
import qualified Data.Aeson as JSON
import qualified Data.Aeson.KeyMap as KeyMap
import qualified Data.HashMap.Strict as HashMap
@ -84,7 +85,7 @@ instance FromJSON CorrectInterfaceRequest where
results <- o JSON..:? "results"
ciqResults <- for results $ maybe (fail "Results may not be nullable") return . fromNullable
ciqGrade <- if
| "grade" `HashMap.member` o
| "grade" `KeyMap.member` o
-> Just <$> o JSON..: "grade"
| otherwise
-> pure Nothing