Search results

Jump to navigation Jump to search
  • -- We don't sum the terms here but let the main thread sum the lists returned zetaRange :: (Floating a, Integral b) => a -> (b, b) -> [a]
    4 KB (555 words) - 10:58, 22 June 2021
  • -- Alt+LMB move floating window -- Alt+MMB resize floating window
    9 KB (1,195 words) - 15:17, 6 February 2021
  • Terminology is a little confusing. There's a few different things floating around: Now that we know what a failure is, let's discuss how to deal with it.
    6 KB (961 words) - 12:45, 12 August 2019
  • of xmonad's state. Let's take a look at the definition of the , floating :: M.Map a RationalRect -- ^ floating windows
    16 KB (2,690 words) - 16:02, 26 December 2022
  • [testBit n k | k <- let s = bitSize n in [s-1,s-2..0]] However, that only works well within the range of floating-point numbers
    8 KB (1,150 words) - 15:41, 5 July 2022
  • -- floating layer support , ((modMask , xK_b ), modifyGap (\i n -> let x = (defaultGaps ++ repeat (0,0,0,0)) !! i in if n == x then (0,0,0,0) else
    12 KB (1,574 words) - 15:16, 6 February 2021
  • mysqrt :: Floating a => a -> a mysqrt 4 + 2 :: Floating a => a
    10 KB (1,560 words) - 12:02, 15 April 2024
  • * <hask>Float</hask> is a single precision floating point number. * <hask>Double</hask> is a double precision floating point number.
    13 KB (1,986 words) - 17:59, 9 August 2019
  • -- floating layer support , ((modMask , xK_b ), modifyGap (\i n -> let x = (defaultGaps ++ repeat (0,0,0,0)) !! i in if n == x then (0,0,0,0) else
    11 KB (1,532 words) - 15:18, 6 February 2021
  • The easiest way is to let Gnome start Xmonad itself by setting the environment variable WINDOW_MANAGE ...may be mandatory. (Otherwise, the nautilus desktop will be raised into the floating layer where it covers all your other windows.)
    7 KB (1,095 words) - 15:16, 6 February 2021
  • modifyGap (\i n -> let x = (XMonad.defaultGaps conf ++ repeat (0,0,0,0)) !! i -- mod-button1, Set the window to floating mode and move by dragging
    10 KB (1,329 words) - 15:18, 6 February 2021
  • ===Let floating=== ...eerx.ist.psu.edu/viewdoc/download?doi=10.1.1.30.2589&rep=rep1&type=pdf Let-floating: moving bindings to give faster programs]
    19 KB (2,599 words) - 00:14, 15 June 2023
  • ...at NaN and +- Infinity are not in arguments or results. For most practical floating point processing, this is a non-issue and enabling the flag can speed up FP let sums = loop 1 n 1 0 0 0 0 0 0 0 0 0
    25 KB (3,873 words) - 11:08, 6 March 2023
  • Here the incredibly simple Haskell program <hask>let x = 3+4</hask> is Prelude> let x = 3 + 4
    41 KB (6,592 words) - 15:16, 6 February 2021
  • f :: (Floating t, (r :! "y") ~ t, (r :! "x") ~ t) => g r = let r' = f (x := 10 .| r)
    25 KB (4,073 words) - 08:53, 9 December 2013
  • ...a test scene with a variety of geometric shapes. If it doesn't work, then let [http://jsnow.bootlegether.net me] know or file a bug on the github page. The solution is that Glome includes several primitive types that let us create more complex Solids out of simple ones. For instance, a Group is
    40 KB (6,787 words) - 01:19, 8 April 2014
  • ====Floating all new windows==== ...<hask>doF W.swapDown</hask> which put new windows below others. Also, the floating layer isn't designed for extensive use; if possible, limit <hask>doFloat</h
    37 KB (5,217 words) - 02:13, 12 April 2019
  • ...f you have built xmonad from source code (either darcs or stable release). Let's assume you've installed xmonad to ...her than above, and can specify window properties that will avoid matching floating dialogs, etc. then adding a few swapDown manageHooks (or similar from Hooks
    71 KB (10,765 words) - 16:38, 22 August 2021
  • Let's examine some of the benefits of Haskell and functional programming. ...given in Figure 1 will not only sort lists of integers, but also lists of floating point numbers, lists of characters, lists of lists; indeed, it will sort li
    26 KB (4,102 words) - 23:54, 29 February 2020
  • let arr = listArray (1,1000) [1..1000] :: DiffArray Int Int let arr = listArray (1,1000) [1..1000] :: DiffArray Int Int
    27 KB (4,333 words) - 06:09, 23 July 2020

View (previous 20 | next 20) (20 | 50 | 100 | 250 | 500)