{-# LANGUAGE DeriveGeneric #-}
{-# LANGUAGE DuplicateRecordFields #-}
{-# LANGUAGE NamedFieldPuns #-}
{-# LANGUAGE OverloadedStrings #-}
{-# LANGUAGE RecordWildCards #-}
{-# LANGUAGE StrictData #-}
{-# LANGUAGE NoImplicitPrelude #-}
{-# OPTIONS_GHC -fno-warn-unused-imports #-}
{-# OPTIONS_GHC -fno-warn-unused-matches #-}

-- Derived from AWS service descriptions, licensed under Apache 2.0.

-- |
-- Module      : Amazonka.ConnectCases.Types.Sort
-- Copyright   : (c) 2013-2023 Brendan Hay
-- License     : Mozilla Public License, v. 2.0.
-- Maintainer  : Brendan Hay
-- Stability   : auto-generated
-- Portability : non-portable (GHC extensions)
module Amazonka.ConnectCases.Types.Sort where

import Amazonka.ConnectCases.Types.Order
import qualified Amazonka.Core as Core
import qualified Amazonka.Core.Lens.Internal as Lens
import qualified Amazonka.Data as Data
import qualified Amazonka.Prelude as Prelude

-- | A structured set of sort terms.
--
-- /See:/ 'newSort' smart constructor.
data Sort = Sort'
  { -- | Unique identifier of a field.
    Sort -> Text
fieldId :: Prelude.Text,
    -- | A structured set of sort terms
    Sort -> Order
sortOrder :: Order
  }
  deriving (Sort -> Sort -> Bool
forall a. (a -> a -> Bool) -> (a -> a -> Bool) -> Eq a
/= :: Sort -> Sort -> Bool
$c/= :: Sort -> Sort -> Bool
== :: Sort -> Sort -> Bool
$c== :: Sort -> Sort -> Bool
Prelude.Eq, ReadPrec [Sort]
ReadPrec Sort
Int -> ReadS Sort
ReadS [Sort]
forall a.
(Int -> ReadS a)
-> ReadS [a] -> ReadPrec a -> ReadPrec [a] -> Read a
readListPrec :: ReadPrec [Sort]
$creadListPrec :: ReadPrec [Sort]
readPrec :: ReadPrec Sort
$creadPrec :: ReadPrec Sort
readList :: ReadS [Sort]
$creadList :: ReadS [Sort]
readsPrec :: Int -> ReadS Sort
$creadsPrec :: Int -> ReadS Sort
Prelude.Read, Int -> Sort -> ShowS
[Sort] -> ShowS
Sort -> String
forall a.
(Int -> a -> ShowS) -> (a -> String) -> ([a] -> ShowS) -> Show a
showList :: [Sort] -> ShowS
$cshowList :: [Sort] -> ShowS
show :: Sort -> String
$cshow :: Sort -> String
showsPrec :: Int -> Sort -> ShowS
$cshowsPrec :: Int -> Sort -> ShowS
Prelude.Show, forall x. Rep Sort x -> Sort
forall x. Sort -> Rep Sort x
forall a.
(forall x. a -> Rep a x) -> (forall x. Rep a x -> a) -> Generic a
$cto :: forall x. Rep Sort x -> Sort
$cfrom :: forall x. Sort -> Rep Sort x
Prelude.Generic)

-- |
-- Create a value of 'Sort' with all optional fields omitted.
--
-- Use <https://hackage.haskell.org/package/generic-lens generic-lens> or <https://hackage.haskell.org/package/optics optics> to modify other optional fields.
--
-- The following record fields are available, with the corresponding lenses provided
-- for backwards compatibility:
--
-- 'fieldId', 'sort_fieldId' - Unique identifier of a field.
--
-- 'sortOrder', 'sort_sortOrder' - A structured set of sort terms
newSort ::
  -- | 'fieldId'
  Prelude.Text ->
  -- | 'sortOrder'
  Order ->
  Sort
newSort :: Text -> Order -> Sort
newSort Text
pFieldId_ Order
pSortOrder_ =
  Sort' {$sel:fieldId:Sort' :: Text
fieldId = Text
pFieldId_, $sel:sortOrder:Sort' :: Order
sortOrder = Order
pSortOrder_}

-- | Unique identifier of a field.
sort_fieldId :: Lens.Lens' Sort Prelude.Text
sort_fieldId :: Lens' Sort Text
sort_fieldId = forall s a b t. (s -> a) -> (s -> b -> t) -> Lens s t a b
Lens.lens (\Sort' {Text
fieldId :: Text
$sel:fieldId:Sort' :: Sort -> Text
fieldId} -> Text
fieldId) (\s :: Sort
s@Sort' {} Text
a -> Sort
s {$sel:fieldId:Sort' :: Text
fieldId = Text
a} :: Sort)

-- | A structured set of sort terms
sort_sortOrder :: Lens.Lens' Sort Order
sort_sortOrder :: Lens' Sort Order
sort_sortOrder = forall s a b t. (s -> a) -> (s -> b -> t) -> Lens s t a b
Lens.lens (\Sort' {Order
sortOrder :: Order
$sel:sortOrder:Sort' :: Sort -> Order
sortOrder} -> Order
sortOrder) (\s :: Sort
s@Sort' {} Order
a -> Sort
s {$sel:sortOrder:Sort' :: Order
sortOrder = Order
a} :: Sort)

instance Prelude.Hashable Sort where
  hashWithSalt :: Int -> Sort -> Int
hashWithSalt Int
_salt Sort' {Text
Order
sortOrder :: Order
fieldId :: Text
$sel:sortOrder:Sort' :: Sort -> Order
$sel:fieldId:Sort' :: Sort -> Text
..} =
    Int
_salt
      forall a. Hashable a => Int -> a -> Int
`Prelude.hashWithSalt` Text
fieldId
      forall a. Hashable a => Int -> a -> Int
`Prelude.hashWithSalt` Order
sortOrder

instance Prelude.NFData Sort where
  rnf :: Sort -> ()
rnf Sort' {Text
Order
sortOrder :: Order
fieldId :: Text
$sel:sortOrder:Sort' :: Sort -> Order
$sel:fieldId:Sort' :: Sort -> Text
..} =
    forall a. NFData a => a -> ()
Prelude.rnf Text
fieldId
      seq :: forall a b. a -> b -> b
`Prelude.seq` forall a. NFData a => a -> ()
Prelude.rnf Order
sortOrder

instance Data.ToJSON Sort where
  toJSON :: Sort -> Value
toJSON Sort' {Text
Order
sortOrder :: Order
fieldId :: Text
$sel:sortOrder:Sort' :: Sort -> Order
$sel:fieldId:Sort' :: Sort -> Text
..} =
    [Pair] -> Value
Data.object
      ( forall a. [Maybe a] -> [a]
Prelude.catMaybes
          [ forall a. a -> Maybe a
Prelude.Just (Key
"fieldId" forall kv v. (KeyValue kv, ToJSON v) => Key -> v -> kv
Data..= Text
fieldId),
            forall a. a -> Maybe a
Prelude.Just (Key
"sortOrder" forall kv v. (KeyValue kv, ToJSON v) => Key -> v -> kv
Data..= Order
sortOrder)
          ]
      )