url stringlengths 11 2.25k | text stringlengths 88 50k | ts timestamp[s]date 2026-01-13 08:47:33 2026-01-13 09:30:40 |
|---|---|---|
https://unicode-org.github.io/icu/download/ | Downloading ICU | ICU Documentation Skip to main content Link Menu Expand (external link) Document Search Copy Copied ICU Documentation ICU Documentation Downloading ICU ICU 78 ICU 77 ICU 76 Contacts and Mailing Lists ICU User Guide ICU Internationalization How To Use ICU Unicode Basics ICU Services ICU Design C/POSIX Migration Release Info Glossary Demos ICU4C ICU4C FAQ Building ICU4C Packaging ICU4C Plug-ins ICU4J ICU4J FAQ ICU4J Locale Service Provider Why Use ICU4J? Chars and Strings UTF-8 Properties CharacterIterator UText UnicodeSet Regular Expressions StringPrep Conversion Converter Conversion Data Charset Detection Compression Locales and Resources Locale Examples Resources Localizing with ICU Date/Time Calendar Services Calendar Examples TimeZone Classes Date and Time Zone Examples Universal Time Scale Formatting Formatting Numbers Legacy NumberFormat Rounding Modes Number Skeletons FormattedValue RuleBasedNumberFormat RuleBasedNumberFormat Examples Formatting Dates and Times Date and Time Formatting Examples Formatting Messages Message Formatting Examples MessageFormat 2.0 Trying MF 2.0 Final Candidate Transforms Case Mappings BiDi Algorithm Normalization ∞ Transform Rule Tutorial Collation Concepts Architecture Customization String Search Collation FAQ API Details Collation Examples Ignore Punctuation Options Boundary Analysis Break Rules IO ustdio ustream Layout Engine Paragraph Layout ICU Data ICU Data Build Tool Resource and Data Tracing Use From... Cobol Design Docs Custom Normalization Data Structures BytesTrie ICU Code Point Tries ICU String Tries UCharsTrie Preparsed UCD Contributors Coding Guidelines Continuous Integration Custom ICU4C Synchronization Developing Fuzzer Targets for ICU APIs Release & Milestone Tasks Announcements APIs & Docs Build Updates Copy Shared Tests Healthy Code Integration Tests Legalities Maintenance Release Procedure Miscellaneous Publish Publish - Version 76.1 - WIP Standards Update CLDR-ICU integration (including ICU4C data to ICU4J) Updating MeasureUnit with new CLDR data Updating MeasureUnit with new CLDR data Unicode Update Version Numbers Skipping Known Test Failures Synchronization Updating ICU's built-in Break Iterator rules User Guide Editing git and Github for ICU Developers Setup for Contributors C++ Setup C++ Setup on Linux Configuring VS Code for ICU4C Profiling ICU4C with callgrind Java Setup Ant Setup for Java Eclipse Setup for Java Developers Java Profiling and Monitoring tools Maven Setup for Java Source Code Setup Local tooling configs for git and Github This site uses Just the Docs , a documentation theme for Jekyll. Search ICU Documentation API Docs ICU on GitHub ICU Home Page Unicode Home Page Downloading ICU If you want to use ICU (as opposed to developing it), it is recommended that you download an official packaged version of the ICU source code. These versions are tested more thoroughly than day-to-day development builds of the system, and they are packaged in zip and tar files for convenient download. Here are several recent releases of ICU that are available: Latest Release 2025-10-30: ICU 78 is now available — releases/tag/release-78.1 — Maven: com.ibm.icu / icu4j / version 78.1 ICU 78 updates to Unicode 17 ( blog ), including new characters and scripts, emoji, collation & IDNA changes, and corresponding APIs and implementations. It also updates to CLDR 48 ( blog ) locale data with new locales, and various additions and corrections. In Java, there is a new Segmenter API which is easier and safer to use than BreakIterator. In C++, there is a new set of APIs for Unicode string (UTF-8/16/32) code point iteration that works seamlessly with modern C++ iterators and ranges. The Java implementation of the CLDR MessageFormat 2.0 specification has been updated to CLDR 48. The core API has been upgraded to “draft”, while the Data Model API remains in technology preview. The C++ implementation of MessageFormat 2.0 is at CLDR 47 level and remains in technology preview. ICU 78 and CLDR 48 are major releases, including a new version of Unicode and major locale data improvements. Previous Releases 2025-03-13: ICU 77 updates to CLDR 47 locale data with new locales, and various additions and corrections. The technology preview implementations of the CLDR MessageFormat 2.0 specification have been updated to incorporate some, but not yet all, of the CLDR 47 changes. (Java more than C++) 2024-10-24: ICU 76 updates to Unicode 16 ( blog ), including new characters and scripts, emoji, collation & IDNA changes, and corresponding APIs and implementations. It also updates to CLDR 46 ( beta blog ) locale data with new locales, significant updates to existing locales, and various additions and corrections. For example, the CLDR and Unicode default sort orders are now very nearly the same. Most of the java.time (Temporal) types can now be formatted directly. There are some new APIs to make ICU easier to use with modern C++ and Java patterns. The Java and C++ technology preview implementations of the CLDR MessageFormat 2.0 specification have been updated to match recent changes. See ICU 76 . 2024-04-17: ICU 75 updates to CLDR 45 ( beta blog ) locale data with new locales and various additions and corrections. C++ code now requires C++17 and is being made more robust. The CLDR MessageFormat 2.0 specification is now in technology preview , together with a corresponding update of the ICU4J (Java) tech preview and a new ICU4C (C++) tech preview. See Downloading ICU > ICU 75 . 2023-12-13: ICU 74.2 released with date/time formatting bug fixes. See Downloading ICU > ICU 74 . 2023-10-31: ICU 74 updates to Unicode 15.1 , including new characters, emoji, security mechanisms, and corresponding APIs and implementations. It also updates to CLDR 44 ( blog ) locale data with new locales and various additions and corrections. See Downloading ICU > ICU 74 . 2023-06-15: ICU 73.2 : Maintenance release with changes for GB18030 compliance, English AM/PM spaces, word segmentation around @ sign, etc. See Downloading ICU > ICU 73 . 2023-04-13: ICU 73 updates to CLDR 43 locale data with various additions and corrections. ICU 73 improves Japanese and Korean short-text line breaking, reduces C++ memory use in date formatting, and promotes the Java person name formatter from tech preview to draft. For details, see Downloading ICU > ICU 73 . Release ICU4C ICU4J Major Changes ICU 72 72.1 72.1 Unicode 15, CLDR 42, tech previews: person name formatting, MessageFormat 2 ICU 71 71.1 71.1 CLDR 41, phrase-based line breaking for Japanese. ICU 70 70.1 70.1 Unicode 14 & CLDR 40, emoji properties. ICU 69 69.1 69.1 CLDR 39, enhancements in measurement unit formatting and number formatting. ICU 68 68.2 68.2 CLDR 38, locale-dependent smart unit preferences (road distance, temperature, etc.), locale ID canonicalization conformant with CLDR. ICU 67 67.1 67.1 Unicode 13 & CLDR 37. Bug fixes for date and number formatting, enhanced support for user preferences in the locale identifier. LocaleMatcher code and data improved. Number skeletons have a new “concise” form that can be used in MessageFormat strings. ICU 66 66.1 66.1 Unicode 13 & CLDR 36.1. New, extra Q1 releases for low-risk integration of Unicode 13. ICU 65 65.1 65.1 CLDR 36 with some new measurement units. Java LocaleMatcher API is improved, and ported to C++. For building ICU data, there are new filtering options, and new tracing support for data loading in ICU4C. ICU 64 64.2 64.2 Unicode 12.0, CLDR 35, data filtering/subsetting mechanism, improved formatting API, C++ LocaleBuilder. ICU 63 63.2 63.2 CLDR 34, API for number & currency range formatting, API for additional Unicode properties and for constructing custom properties; test data for upcoming Japanese era; C++ Locale enhancements; Java 7 as minimum runtime. ICU 62 62.2 62.2 Unicode 11.0, CLDR 33.1, number format skeleton pattern in MessageFormat and ICU4C DecimalFormat wrapping new NumberFormatter implementation. ICU 61 61.2 61.2 CLDR 33, new Java implementation for number and currency parsing, and many small API additions, improvements, and bug fixes. ICU 60 60.3 60.3 Unicode 10.0, CLDR 32, and ICU4J has been tested with Java 9. New API for number formatting, NumberFormatter, which new users should link instead of NumberFormat/DecimalFormat. There are many more features and bug fixes. ICU 59 59.2 59.2 CLDR 31, Emoji 5.0 draft data, C++11 support, Java number formatting code rewrite. ICU 58 58.3 58.3 Unicode 9.0, CLDR 30.0.2, Emoji 4.0 draft data, JUnit test integration, more locale data loading improvements. ICU 57 57.2 57.2 CLDR 29, Unicode emoji properties, improved locale data loading. ICU 56 56.2 56.2 Unicode 8.0, CLDR 28, ICU data size reduction, ICU4C DecimalFormat refactoring. ICU 55 55.2 55.2 CLDR 27.0.1, CSS line-break support in BreakIterator, easier-to-use ScientificNumberFormatter (“1.2 × 10³”), ICU4C DateFormat performance improvement, C wrapper for ListFormatter and FieldPositionIterator, regex named capture groups. ICU4J has been improved and tested for using ICU4C data and for running on Android. ICU 54 54.2 54.2 CLDR 26, Unicode 7.0, many more units, Unihan in root collation, new RBNF PluralFormat syntax, dictionary-based break iterator for Burmese, tech preview of FilteredBreakIterator using ULI break data, time separator configurable from CLDR data, … ICU 53 53.2 53.2 CLDR 25, collation code rewrite, measure formatting for various units, relative date formatter and leniency controls in date format parsing ICU 52 52.2 52.2 CLDR 24, Unicode 6.3, Plurals for fractional values, Islamic Umm al-Qura calendar, DateFormat parse leniency controls and Lao dictionary based word segmentation. ICU 51 51.3 51.3 CLDR 23, short weekday names, new time zone format patterns, display context for date format and locale display names ICU 50 50.2 50.2 CLDR 22.1, Unicode 6.2, ordinal number support, dictionary-based break iterators for Chinese & Japanese… ICU 49 49.1.2 49.1 CLDR 21.0.1, Unicode 6.1, simpler ICU4C build without generated platform.h, many small API additions Note: We have changed the ICU release version numbering , combining the former first two fields into one, thus the major release sequence is ICU 4.8, ICU 49, ICU 50, … For more details on building ICU once you’ve checked out the code, please see the ICU4C or ICU4J readme (linked from the nav bar). Note: In 2012, starting with ICU 49 , we changed the ICU release version numbering , combining the former first two fields into one, thus the major release sequence is …, ICU 4.6, ICU 4.8, ICU 49 , ICU 50, ICU 51, … For older ICU releases see the Old ICU Releases page. Table of contents ICU 78 ICU 77 ICU 76 Back to top © 2016 and later: Unicode, Inc. and others. License & terms of use: http://www.unicode.org/copyright.html Edit this page on GitHub. This site uses Just the Docs , a documentation theme for Jekyll. | 2026-01-13T09:30:24 |
http://heisenbug.blogspot.com/search/label/mathematics?updated-max=2013-08-10T05:11:00-07:00&max-results=20&start=20&by-date=false | don't count on finding me: mathematics skip to main | skip to sidebar don't count on finding me No posts with label mathematics . Show all posts No posts with label mathematics . Show all posts Home Subscribe to: Comments (Atom) Blog Archive ▼  2022 (1) ▼  February (1) Pattern musings ►  2014 (5) ►  November (1) ►  October (1) ►  August (1) ►  July (1) ►  January (1) ►  2013 (5) ►  September (1) ►  August (3) ►  February (1) ►  2012 (2) ►  December (1) ►  September (1) ►  2011 (7) ►  December (1) ►  November (1) ►  October (1) ►  September (1) ►  August (1) ►  February (1) ►  January (1) ►  2010 (19) ►  December (5) ►  November (6) ►  October (1) ►  August (1) ►  July (2) ►  June (4) ►  2009 (12) ►  November (2) ►  October (1) ►  August (1) ►  June (1) ►  May (1) ►  March (4) ►  January (2) ►  2008 (22) ►  October (1) ►  September (3) ►  August (6) ►  July (3) ►  June (2) ►  May (1) ►  April (3) ►  March (1) ►  February (1) ►  January (1) ►  2007 (20) ►  December (2) ►  November (1) ►  October (1) ►  September (1) ►  August (1) ►  July (14) About Me heisenbug I am here and there. You may encounter me if you try, but no guarantees. Just a hint: I am mostly with my family. View my complete profile   | 2026-01-13T09:30:24 |
http://heisenbug.blogspot.com/search?updated-max=2010-11-27T16:27:00-08:00#sidebar | don't count on finding me skip to main | skip to sidebar don't count on finding me Saturday, November 27, 2010 Applicative Structures and Thrists I've been toying with the idea of furnishing the the applicative framework into thrist-like clothing , with early attempts here . Last night I might have gotten it, finally... Here is the idea. Since function application is left-associative, but thrists are right associative, I'll reverse the application's direction to right-to-left, i.e. f a b c will become c b a f . This uglyness is another reason to finally whip up a RevThrist , which would be SNOC-like and left-associative. We need following ingredients: Fun - functions perform the reduction to a new object, Arg - arguments successively saturate the applicable structure to the right, Par - partial application (or parent) initiates the reduction. I'll explain these elements next, but first rewrite the above expression a bit to get a parentesized form (c(b(a f))) , and now with roles marked up in thrist syntax: Cons (Arg c) $ Cons (Arg b) $ Cons (Arg a) $ Cons (Fun f) Nil Looks almost reasonable. Time to define the ingredients mentioned above. Remember, that it must be a two-parameter data type and that the types must match up between Arg c and Arg b , etc., and finally between Arg a and Fun f . This is a pretty hefty requirement! We can attempt passing the effective application type between the ingredients, defining the data structure as data Appli :: * → * → * where Fun :: (a → b) → Appli (a → b) c Arg :: a → Appli b (a → b) This means functions pass their own type to the left (and ignoring what comes from the right), while arguments expect a saturable effective type from the right, store an appropriate value and propagate the remaining type to the left. This should work now: Cons (Arg 'a') $ Cons (Fun ord) Nil , with the type being Thrist Appli Int c . As you can see, no function type gets passed to the left, so you cannot prepend any more arguments. But this all appears useless since we cannot nest things. The Par ingredient will take care of this: Par :: Thrist Appli a c → Appli b (a → b) Par has a double role, it acts just like an argument, but holding a thrist inside, and thus groups a sub-application. The c type variable occurring in Par and Fun troubled me a lot, because it allows building up illegal thrists. Consider Cons (Fun f) $ Cons (Fun f) Nil . This gibberish cannot be assigned any reasonable semantics! Finally it occurred to me to use a phantom type for filling in this breach: data Peg Since Peg is uninhabited, no function signature can include it (unless it is a divergent one). It also ensures that the leftmost ingredient in a thrist is a function, how practial for Par ! Anyway, our Appli is done now: data Appli :: * → * → * where Fun :: (a → b) → Appli (a → b) Peg Arg :: a → Appli b (a → b) Par :: Thrist Appli a Peg → Appli b (a → b) So what brave soul will try this out? Because I must confess, up to this point I've been too lazy to fire up GHC! You might be inclined to say, why this whole circus? An awkward notation for something as simple as function application? Any Haskell implementation can do this with a beautiful syntax! Yes, we can build up applications but can't even compute them. This is a toy at the moment. But try to pull apart an application in Haskell! You can't! Here you can add an evaluator ( foldlThrist ?) and also instrument, trace, debug your evaluation process. Also, there is a reason I say 'Applicative Structures' in the title. Here is a generalization of Appli that is parametrized: data Appli :: ( * → * → * ) → * → * → * where Fun :: (a ~> b) → Appli ( ~> ) (a ~> b) Peg Arg :: a → Appli ( ~> ) b (a ~> b) Par :: Thrist (Appli ( ~> )) a Peg → Appli ( ~> ) b (a ~> b) You are free now to create your own function and value space with attached typing rules and still be able to use Thrist (Appli MySpace) ... The possibilities are endless, e.g. encrypted execution on remote hosts or abstract interpretation, you say it. Have Fun ! Posted by heisenbug at 6:37 AM No comments: Labels: applicative , haskell , thrist Thursday, November 25, 2010 Type Synonyms Generalized Type functions are the new trend. Ωmega has them with the following syntax: tfun :: Nat ~> Nat {tfun Z} = S Z Haskell (that is GHC) has them in the flavor of type families. It has just occurred to me that they can be considered as a syntactic relaxation of type synonyms! Look: tfun :: Nat ~> Nat type tfun Z = S Z type tfun (S n) = Z When conventional type synonyms are used they must be fully applied. This should be the case here too. I am not sure whether type families or Ωmega-style type functions can be partially applied, though. Anyway, a bit more to write at the definition site but less curlies to type at the call site; it may well be worth it. Posted by heisenbug at 3:06 PM No comments: Labels: crazy , haskell , omega Patterns and Existentials I am reading papers again and this always activates my creative fantasy. I want to explain a small revelation I had just now. Patterns are the same thing as declaring existential values corresponding to all pattern variables according to their respective types as stated in their respective constructors and asserting that the pattern interpreted as a value is the same as the scrutinee. The body behind the pattern in turn is similarly evaluated with the existential variables in scope. Of course the existential values are filled in by some oracle which is uninteresting from the typing perspective. A strong corollary of the asserted value identity is that we can also assert that the type of the scrutinee unifies with the type of the pattern-value (in the scope of the existentials, but not outside of it)! Just as universally quantified values are typed by dependent products (∏-stuff) the existentially quantified values are typed by dependent sums (∑-stuff). Note that the stuff is at stratum 1, e.g. types. This is in contrast to the Haskell data declaration data Foo = forall a . Foo a where a is at stratum 1, being an existential type . Hmm, when thinking this to the end we may either end up at the conventional non-inference for GADTs or something like the generalized existentials as proposed in Chuan-kai Lin's thesis. I conjecture also that this is the same thing as the post-facto type inference I suggested here . Now all remains to is to reinterpret function calls as a data type being a tuple with existential values and to apply the above trick. Posted by heisenbug at 2:21 PM No comments: Labels: crazy , GADT , haskell Tuesday, November 23, 2010 Hats off The types subreddit references Chuan-kai Lin's PhD thesis about GADT type inference. I already have read the pointwise paper , but this is of course a revelation. He actually did implement an algorithm that inferred types for 25 (out of 30) little benchmark programs with GADTs. Previous attempts accomplished at most one! But the thing that impressed me the most wasn't the technical side of his story but the beautifully crafted slides of his PhD defense talk. I am baffled... Congratulations Chuan-kai! Posted by heisenbug at 6:09 PM No comments: Labels: GADT , types Friday, November 12, 2010 Cooperation I have just uploaded the thrist-0.2 package to hackage. All credit goes to Brandon Simmons , who has added significant functionality and now provides some functions for thrists that are more in line with the prelude. Brandon has accepted to be a co-author to the library and I am very happy about it. Welcome, Brandon! For the users of the package this is good news, as I am a little dim spot on the outer sectors of the haskell radar, while Brandon is a savvy and ambitioned person, and to continue with my previous metaphor, a bright green dot on the screen, swiftly moving towards the center :-) This post is a kind of mini release note for the release. Being an experimental package we do not intend to guarantee API stability, so we took the freedom to rename routines to make naming more consistent with the prelude. foldThrist is now foldrThrist and it got a bunch of new cousins too. Notably the types are much wider now, which allows for some more magic to happen. Finally, the haddock comments have been enhanced and as-of-present actually tell something. Please ignore the sub-modules for now, they are unfinished, and much more experimental than the rest (I have not got around researching a compelling solution yet). A RevThrist (or similar) GADT did not make it into the release, I hope I can cram it in sometime later. Anyway, enjoy the lib! Posted by heisenbug at 5:55 PM No comments: Labels: hackage , haskell , thrist Monday, October 18, 2010 Lion's Share I am sick. Five days already, and counting. My brain feels like Sauerkraut and thinking is hard. But my dysregulated sleep cycle lets me ponder all kinds of idle things. One of them is the upcoming "Back to Mac" announcements on Wednesday 11/9. It seems pretty sure that Mac OS X 10.7 (or 11.0 possibly) will be introduced under the 'Lion' code name. This is pretty exciting as nothing really revolutionary happened in the Mac world since 'Leopard'. Many people are speculating what the foundations will be. My bet is a fully-LLVM compiled system: good-bye GCC, we had a nice time together. The majority of the LLVM team is virtually absent from the IRC channel and the mailing lists, they must be working on something big... That is, ironing out the latest bugs so that nothing embarrassing can happen while Steve is on stage. But clang v2.8 already compiles e.g. the FreeBSD kernel and userland with pretty good quality, so this cannot be the entire reason. The (already filled-in) job posting for a "revolutionary new feature in the very foundations of Mac OS X" is probably LLVM-related. Modern GPUs have hundreds of very potent processors that excel at floating-point computations. To use them effectively one needs a flexible compiler that can specialize snippets of code to run on each with optimal throughput. OpenCL attempts this but mostly in the graphical domain, and it sources from a C-like language. What we have in this case, however, is not about graphics... I am going on a limb here and suggest that the new feature is about ... conscience! Yeah, a primitive (compared to humans) but effective way of reflection, that is, understanding of its own existence and goals. Also the goals of the user! This will pave the way to new forms of assistance the OS can provide for us to get our jobs done. It has been tried many times, but to cite the job description, "Something that has never been done before and will truly amaze everyone". My neuronal storm has ceased, I feel limp and tired. Time for another nap. Bye. Posted by heisenbug at 1:56 PM No comments: Labels: llvm , mac , speculation Friday, August 27, 2010 Link as link can Today I made my first significant contribution to clang , by fixing PR8007 , which was a showstopper for building the codebase that I develop at my workplace. I added a testcase that validates the fix, too. In a nutshell, everything compiled well, but failed to link because of a non-instantiated type-dependent friend function. Admittedly, I am a green-horned newbie when it comes to clang, but even so I succeeded debugging the problem with some hints from Doug Gregor (on IRC ) in two hours. The fix arrived on short order after the conception of the solution idea. That I could get this working in a few hours is an astonishing feat (that I am pretty proud of) and a tell-tale aspect of clang's awesome design. Naturally, I still have to survive post-commit review, especially w.r.t. performance regressions; OTOH I am rather confident that I got the semantics right. Some loose ends in testing remain, which I hope to wrap up this weekend, so that I can see my application linking with clang (LLVM) on monday. That will burst up the doors towards static analysis ... Go CLANG! PS: Hopefully I won't need months to make this working ;-) Posted by heisenbug at 8:29 PM No comments: Labels: clang , llvm Wednesday, July 21, 2010 64-bit Waymarking Finally I came around working on the 64bit variant of my (array) waymarking algorithm, the result of which can be observer here (starting at line 77). But I'd like to provide some background first. Back when I implemented the original waymarking algorithm with a 2-bit alphabet used as the marks, I hoped that extending the alphabet to have 3 bits could be a major win. 64-bit pointers are by ABI rules aligned on an eight byte boundary, so pointers to these have their 3 lowest bits cleared, and I can use this space for jotting down the marks. With eight letters I can fully encode four digits and the two stops. This almost halves the number of accesses. The big question is how to assign a lucrative rôle to the remaining two characters! After some thinking I settled with the idea to make them valued stops. Clearly, increasing the frequency of stops reduces the chance of long linear searches. In the current incarnation 'x' carries a value of (binary) 01 at the start and at the end of a digit sequence, while 'y' carries 02 in the start rôle only. 's' is not carrying any value and is used when neither of the others fit. Since "s0" is a silly fragment to create, so I assign a special meaning of "s10" to it. I designed the decoder (d3code) first. It is essential that it obtains the correct length for the string tail wherever it starts out. And it should minimize the number of accesses to characters in the string. The decoding rules are taylored to only need maximally 4 accesses to compute the correct length for the last 12 characters. Actually the last couple of marks were a result of a co-evolution with the decoder's rules. In the front of this part the digit sequences become longer and there is less wiggle room, this part can be automatically generated. The code as it is now needs some serious cleanup, but it does QuickCheck and I am pretty confident that it is correct for all lengths. Of course you are encouraged to find a better scheme, but so far I am happy with it. PS: As I wrote this I discovered that I can eliminate another 2 characters of my hand-written seed string. PPS: I do not employ the 'x' terminates with a value rule in the generator yet, only in the hand-written seed. But it should be easy enough to change every "3sx" to "x" in the generator. Posted by heisenbug at 3:00 PM No comments: Labels: haskell , llvm , waymarking Wednesday, July 14, 2010 The Proof is in the Pudding Looks like I've finally done it! r108240 stuck and no broken external projects have been reported. I've prepared some little statistic and quietly celebrating the 1%+ speed gain of LLVM in the last week. Now on, plucking some more low-hanging fruit before adventuring into some more hard-core changes! Update: The ClangBSD project will surely put it through some serious regression testing... Posted by heisenbug at 4:12 PM No comments: Labels: bsd , llvm Thursday, June 24, 2010 Emacs the Lifesaver I was not thrilled of the task in front of me. Refreshing an old mega-patch, revise virtually every hunk to use a different interface, and committing it piecemeal to the repository again. Sounds like a long error prone job of suffering. Fortunately here is where the power tools come in. I re-merged the backed out revision, postponing conflicts; saved the diff away and reverted the repository; wrote a small awk script to massage the hunks in the diff to get a new patch; fired up emacs with the patch and applied each hunk after thorough review (and seldom with minor changes); some hunks are not ready to go in yet as they do not qualify as refactoring, these are kept for later; commit almost every file as a separate revision. I spend the most time in Emacs (the Mac OS X incarnation, Aquamacs is fantastic). It provides me all the comfort and productivity I need: it provides all necessary hunk operations such as apply, reverse, go to original, drop etc. I can transparently work from a remote machine via ssh, including editing, version control and the above diff operations peace of mind, by being rock solid and autosaving stuff. The only inconvenience is the sheer amount of keyboard equivalents, but I am getting used to them too. Thanks Emacs, without you I would probably drop! Posted by heisenbug at 7:55 AM No comments: Labels: emacs , llvm Tuesday, June 22, 2010 Burning ISO CDs I wasted some hours with trying to burn ISO CDs on the mac. I tried various methods like converting .dmg to .cdr (CD Master) in Disk Utility, but the resulting CD always mounted as HFS+. Finally I googled a nice method: hdiutil makehybrid -iso -o MyImage.iso /Volumes/SomeFolder/ will create an ISO filesystem, which can be burnt with Disk Utility and shows up like that in the Finder. That is - well, I am pretty sure - readable on PCs. Alternatively I may use hdiutil burn MyImage.iso I believe... In retrospect, some of my burn products may have ended up as PC-readable too, since hybrid filesystems may have been created. I'll test them on a PC tomorrow for sure. Posted by heisenbug at 5:24 PM No comments: Labels: filesystem , iso Friday, June 18, 2010 Sized types I have always liked the idea of assigning some notion of size to (tree-like) values, and track its changes along pattern matching and construction to be able to reason about termination-unaffecting recursive calls. Many years ago, when reading the Hughes-Pareto-Sabry paper I did not see the point yet why termination is fundamental in various aspects. Only when sitting on the park bench on the isle of Margitsziget (Budapest) and discussing with Tim about sound logic in Ωmega, it dawned to me how termination checking with sized types can be exploited. I developed the intuition of the tree-like data floating heads down in the water and we are reasoning about criteria that it can still float without touching the ground at depth n . Still, this metaphor was rather hazy. In the meantime I have tried to digest the relevant papers from Barthe and Abel, brainstormed somewhat here and let my brain background. Yesterday, I found (on reddit) a link to Abel's new MiniAgda implementation and its description. It made clear to me that my early intuition was not bad at all, the water depth is the upper limit of the size, and recursion is to reduce this to obtain a well-founded induction. Now it is time to rethink my ideas about infinite function types and how they can be reconciled with sized types. But it looks like Abel has done the hard work and his Haskell implementation of MiniAgda could be married with Ωmega in the following way: Derive a sized variant of every (suitable) Ωmega datatype and try to check which functions on them terminate. These can be used as theorems in Ωmega. Hopefully Tim is paying attention to this when implementing Trellys... Posted by heisenbug at 12:01 PM No comments: Labels: omega , termination , types Tuesday, June 8, 2010 My grief with out-of-tree code This post is a long-standing todo item in my brain, but this checkin actually prompted me to do it. A little bit of history first. As a software developer currently mostly active in the embedded space, I like solutions which allow me to save some CPU cycles or bytes of RAM here and there as long as they still allow me to use the same interfaces. Exploiting the characteristics of the underlying hardware and algorithms is often low-hanging fruit when it comes to optimizations. So I have this little agenda of about 10 items I wish to implement in the future to make the LLVM framework a little more efficient. One of these was to reorder the operands inside of the call instruction, to obtain faster access to the callee but mainly to allow fast visitation of all instructions that have a certain callee. I explained all my motives in a separate mail , so I want to save you from the gory details here. To make a long story short, it took me several iterations to catch all places in the optimizers where the operand order was assumed to be in the (callee, arg1, arg2, ...) fashion, instead of the new (arg1, arg2, ..., callee) one, and some miscompilations were only revealed by running the nightly tests. It was a work of blood and sweat because there are many intrinsics and transformations on them and they are often manipulating via the low-level interface getOperand(n) . Actually there is a nice helper interface, called CallSite , which makes it easy to access the call instruction's arguments in a high-level fashion and this interface probably the best for LLVM clients, since its also handles the invoke instructions. However, I regard it ok to use the low-level interface in the LLVM tree directly, since it is possible to consistently change things in one atomic commit. Finally, the day where all regression and nightly tests succeeded, has dawned. My patch seemingly stuck, with all buildbots green. I left for downtown and returned late at night. Just to discover that all has been backed out, because my change broke havoc in an Apple project that obviously used the low-level interface. This was especially frustrating, since I cannot even submit a correcting patch against that project. I did receive very little encouraging support, not even moral one. Some comments were even pretty dismissive, like this patch has already caused many problems, it is not worth it for such a marginal gain . I have no problem with the comment itself, since I would utter such words in comparable situations too, but this time it was my investment that was at stake. I was pretty determined to keep fighting. I wondered whether new measurements with higher arity calls would find a significant speedup with my patch applied. So I did some benchmarking for cases where the change is expected to make a difference, and actually found (roughly) a 3% speedup. Clearly this number is only achieved in specific situations, so the generic case would be well below that, but still it could compensate for many little time eaters that are necessary for an advanced optimization pass or analysis. In my conversation with the involved engineer I enumerated following reasons why resorting to low-level interface in out-of-tree projects is a bad idea: they are not conveying the intent they are depending on implementation details by reaching over abstraction barriers they are an impediment to change (these are mostly the same reasons which you can find in the above commit message too). He did agree to all this and promised to nudge the OpenGL implementors. I also received a request to submit a patch that guarantees that no silent breakage can happen. Well, I acknowledged that this is a valid concern, so I did some brainstorming. I succeeded to put together a small patch that detected all instances of get/setOperand(0) , the major potential cause of breakage in external projects. Compiling with this patch would pinpoint all places where getCalledValue() should be used. But I cannot promise more than that! Why it is impossible to guarantee that with my proposed change either everything keeps working or there is a compilation error with a clear fixing indication? Because the User baseclass does provide the low-level getOperand interface too and I cannot disallow that. C++ only lets me protect parts of the CallInst class... Would a patch to make getOperand private in CallInst be accepted? Probably not now, but read on. What aggravates the problem with private trees is file ownership. The engineer who detects the breakage is not entitled to fix simple cases, but needs to lobby the project/file owner first. This results in additional inertia. (Disclaimer: I am not sure whether Apple does have a file-ownership model internally.) Surprisingly the same thing that happened to me theoretically could happen to any Apple engineer too. Imagine some checkin to LLVM broke the dragonegg GCC plugin which is effectively licensed as GPLv3, so no Apple engineer is allowed to inspect its sources. What would happen if the dragonegg maintainer backed out the change on grounds of "broke an important external project"? What to do next? Now, whining is not one of the things I like to do, so let's advance in some way. Bill's patch I mentioned in the beginning is a possible first step, as I could rework a large portion of my patch in terms of getArgOperand(n-1) instead of getOperand(n-1) , without actually changing the operand order for now. These kinds of incremental refactorings that do not change functionality are mostly welcome in the LLVM world. Then I am dependent on the goodwill of some Apple engineer to make a similar change in that internal project too. Finally the switch (i.e. the operand order) could be flipped. Why I am reluctant to begin? Because it is lots of work, many new intrinsics have been introduced, I definitely will get a bunch of merge conflicts, and finally, who knows, there might be another internal project that chokes and the whole misery enters a new iteration. Why do I feel that the change is urgent? Because LLVM is getting popular with an extraordinal speed. As more and more external projects use LLVM as a foundation, more and more code will exhibit bad habits of using low-level interfaces. The few post-v2.7 months are probably the last chance to make the switch in argument order, before things become de-facto cemented. Maybe it is too late already. That would be a pity, though, LLVM as a compilation infrastructure should be as fast and nimble as possible. Every one of its clients would profit. So, dear external tree developers, I hope you get rid of the low-level calls and use the high-level ones instead. It should not cost you more than touching a couple of lines and retesting. I would be happy to assist you. Regarding development policy, I would welcome a clear statement about what amount of testing in the LLVM ecosystem is "sufficient" and excludes the risk of a patch being backed out. Bottom line, I'd love to get this patch wrapped up, but I am dependent on the support of external tree owners. Are you willing to help me? Posted by heisenbug at 3:23 AM No comments: Labels: llvm Wednesday, November 25, 2009 Patrícia's New Hobby The artistic blood of my lovely wife is flowing again :-) Her newest hobby is orchestrating photo-shootings. Predominantly of pregnant friends and everybody who simply wants to feel marvelous... Like Lelêca! Posted by heisenbug at 2:45 PM No comments: Labels: family Monday, November 2, 2009 Freude, die man sieht Dieses Photo zeigt Lelêca (alias MausiMausi, alias SchlausiMausi) in mit einem Kopfschmuck, der eigentlich zur pernambucanischen Tracht gehört. Ein Geschenk von Tio Davis – Danke! Lelê freut sich inzwischen auf den morgentlichen Gang in den Kindergarten (natürlich mit Papa!) und scheut sich auch nicht vor kleineren Wortgefechten ("vai comer não!"). Aber was richtig gut ist heißt dann "muito ótimo" und Akzeptanz wird mit einem klaren "tá certo!" signalisiert. Und wie man sieht, geht es den Jungs auch ganz passabel... Posted by heisenbug at 3:47 PM No comments: Labels: family Thursday, October 1, 2009 New Thrist Cabbage Yeah, it took more than a year (and dcoutts help on IRC), but finally I've gathered all my hackage-foo to submit a new thrist package (v1.1.1). Its main purpose is to require base v4.0 or higher. As an added bonus (Thrist p) now provides a Category instance. I have also added an Arrow (Thrist (->)) instance, but its first method is bogus as of now. I plan to correct this with v1.1.2. My plans for 0.2 are: adaptors Data.Thrist.Monad , Data.Thrist.List (aka. R*), Data.Thrist.Arrow , all with their respective sensible class instances, tests. Then sometime I can start setting up some cool stuff to demonstrate hoare-triples in thrist setting. We'll see. Posted by heisenbug at 2:37 PM No comments: Labels: thrist Tuesday, August 4, 2009 Static Constraints In the last months Tim has been adding a new function sameLabel to Ωmega and this finally allowed me to encode the concept of free variables. In just a couple of days I managed to implement environment construction with statically checked proof that no identifier is shadowed. Here is a little example. Building on this advance I fulfilled a long lasting desire and managed to prototype LLVM basic blocks in Ωmega with thrists. The approach is implemented in 2 steps: build up a labelled sequence of preinstructions, and then construct sufficient evidence about well-formedness, that the strict type constraints in the thrist can be proven. Curiously, the defs propagate to the right and the uses to the right in this thrist. The good thing is, that after all this struggle I am pretty confident that many more properties and constraints can be encoded, such as the LLVM type system (on defs, uses and constants), that Phi nodes must not go into entry blocks, that Phi nodes must preceed other instructions in the basic block, every use must happen in the scope of a corresponding def, etc. The next days will surely see more progress, I have crawled out of the swamp and have firm ground under my feet... Posted by heisenbug at 3:52 PM No comments: Labels: llvm , omega , thrist Sunday, June 14, 2009 Daddy's Girl Das Bild zeigt die Ruhe vor dem Sturm. Wenige Minuten später ist Leleka in ihren Festanzug geschlüpft und die Party ging los, mit Geschenken und viel Leckerem. Spruch der letzten Woche: "Aniversário de Lelêca no domingo!" Posted by heisenbug at 2:56 PM No comments: Labels: family Wednesday, May 27, 2009 Ketchup Problem In Chapter 6 (page 16) Jeremy Gibbons describes a datatype that models all secure operations that can be applied to a (partially filled) ketchup bottle . I believe that this is the example that Jeremy has shown me at ICFP'07 in Freiburg (when I have introduced him to my thrist concept), and I have been unable to find it ever since. Now, I guess I can add it to the bibliography section of my paper. That is, if I ever get around updating the draft again... PS: a bibtex-able conference paper is here . Posted by heisenbug at 6:43 AM No comments: Labels: thrist Tuesday, March 31, 2009 Sieben Tage Regen, Sieben Tage Schnee … … und es tut nicht mehr weh! Dieser Winter war der schmerzhafteste den ich bisher in Deutschland erlebt habe. Lang und kalt. Die Natur ist acht Wochen (oder mehr?) hinterher, unser Hunger nach Sonne unvorstellbar. Wie gut, daß mein Wetter-Widget jetzt sieben Tage Sonne und angenehme Temperaturen verspricht! Das Haus ist nunmehr tiptop eingerichtet, die Gartensaison kann kommen. Auf wiedersehen, Winter, willkommen Frühling! Posted by heisenbug at 10:15 PM No comments: Labels: family , garden , weather Newer Posts Older Posts Home Subscribe to: Comments (Atom) Blog Archive ▼  2022 (1) ▼  February (1) Pattern musings ►  2014 (5) ►  November (1) ►  October (1) ►  August (1) ►  July (1) ►  January (1) ►  2013 (5) ►  September (1) ►  August (3) ►  February (1) ►  2012 (2) ►  December (1) ►  September (1) ►  2011 (7) ►  December (1) ►  November (1) ►  October (1) ►  September (1) ►  August (1) ►  February (1) ►  January (1) ►  2010 (19) ►  December (5) ►  November (6) ►  October (1) ►  August (1) ►  July (2) ►  June (4) ►  2009 (12) ►  November (2) ►  October (1) ►  August (1) ►  June (1) ►  May (1) ►  March (4) ►  January (2) ►  2008 (22) ►  October (1) ►  September (3) ►  August (6) ►  July (3) ►  June (2) ►  May (1) ►  April (3) ►  March (1) ►  February (1) ►  January (1) ►  2007 (20) ►  December (2) ►  November (1) ►  October (1) ►  September (1) ►  August (1) ►  July (14) About Me heisenbug I am here and there. You may encounter me if you try, but no guarantees. Just a hint: I am mostly with my family. View my complete profile   | 2026-01-13T09:30:24 |
https://hackage.haskell.org/package/base-4.7.0.1/docs/Text-Show.html#v:show | Text.Show Source Contents Index base-4.7.0.1: Basic libraries Copyright (c) The University of Glasgow 2001 License BSD-style (see the file libraries/base/LICENSE) Maintainer libraries@haskell.org Stability provisional Portability portable Safe Haskell Safe Language Haskell2010 Text.Show Description Converting values to readable strings: the Show class and associated functions. Synopsis type ShowS = String -> String class Show a where showsPrec :: Int -> a -> ShowS show :: a -> String showList :: [a] -> ShowS shows :: Show a => a -> ShowS showChar :: Char -> ShowS showString :: String -> ShowS showParen :: Bool -> ShowS -> ShowS showListWith :: (a -> ShowS ) -> [a] -> ShowS Documentation type ShowS = String -> String Source The shows functions return a function that prepends the output String to an existing String . This allows constant-time concatenation of results using function composition. class Show a where Source Conversion of values to readable String s. Minimal complete definition: showsPrec or show . Derived instances of Show have the following properties, which are compatible with derived instances of Read : The result of show is a syntactically correct Haskell expression containing only constants, given the fixity declarations in force at the point where the type is declared. It contains only the constructor names defined in the data type, parentheses, and spaces. When labelled constructor fields are used, braces, commas, field names, and equal signs are also used. If the constructor is defined to be an infix operator, then showsPrec will produce infix applications of the constructor. the representation will be enclosed in parentheses if the precedence of the top-level constructor in x is less than d (associativity is ignored). Thus, if d is 0 then the result is never surrounded in parentheses; if d is 11 it is always surrounded in parentheses, unless it is an atomic expression. If the constructor is defined using record syntax, then show will produce the record-syntax form, with the fields given in the same order as the original declaration. For example, given the declarations infixr 5 :^: data Tree a = Leaf a | Tree a :^: Tree a the derived instance of Show is equivalent to instance (Show a) => Show (Tree a) where showsPrec d (Leaf m) = showParen (d > app_prec) $ showString "Leaf " . showsPrec (app_prec+1) m where app_prec = 10 showsPrec d (u :^: v) = showParen (d > up_prec) $ showsPrec (up_prec+1) u . showString " :^: " . showsPrec (up_prec+1) v where up_prec = 5 Note that right-associativity of :^: is ignored. For example, show (Leaf 1 :^: Leaf 2 :^: Leaf 3) produces the string "Leaf 1 :^: (Leaf 2 :^: Leaf 3)" . Minimal complete definition showsPrec | show Methods showsPrec Source Arguments :: Int the operator precedence of the enclosing context (a number from 0 to 11 ). Function application has precedence 10 . -> a the value to be converted to a String -> ShowS Convert a value to a readable String . showsPrec should satisfy the law showsPrec d x r ++ s == showsPrec d x (r ++ s) Derived instances of Read and Show satisfy the following: (x,"") is an element of ( readsPrec d ( showsPrec d x "")) . That is, readsPrec parses the string produced by showsPrec , and delivers the value that showsPrec started with. show :: a -> String Source A specialised variant of showsPrec , using precedence context zero, and returning an ordinary String . showList :: [a] -> ShowS Source The method showList is provided to allow the programmer to give a specialised way of showing lists of values. For example, this is used by the predefined Show instance of the Char type, where values of type String should be shown in double quotes, rather than between square brackets. Instances Show Bool Show Char Show Double Show Float Show Int Show Int8 Show Int16 Show Int32 Show Int64 Show Integer Show Ordering Show Word Show Word8 Show Word16 Show Word32 Show Word64 Show () Show SomeException Show Number Show Lexeme Show Fingerprint Show TyCon Show TypeRep Show Associativity Show Fixity Show Arity Show Any Show All Show ArithException Show ErrorCall Show IOException Show MaskingState Show Dynamic Show CUIntMax Show CIntMax Show CUIntPtr Show CIntPtr Show CSUSeconds Show CUSeconds Show CTime Show CClock Show CSigAtomic Show CWchar Show CSize Show CPtrdiff Show CDouble Show CFloat Show CULLong Show CLLong Show CULong Show CLong Show CUInt Show CInt Show CUShort Show CShort Show CUChar Show CSChar Show CChar Show GeneralCategory Show IntPtr Show WordPtr Show CodingProgress Show TextEncoding Show SeekMode Show NewlineMode Show Newline Show BufferMode Show Handle Show IOErrorType Show ExitCode Show ArrayException Show AsyncException Show SomeAsyncException Show AssertionFailed Show Deadlock Show BlockedIndefinitelyOnSTM Show BlockedIndefinitelyOnMVar Show Fd Show CRLim Show CTcflag Show CSpeed Show CCc Show CUid Show CNlink Show CGid Show CSsize Show CPid Show COff Show CMode Show CIno Show CDev Show CodingFailureMode Show ThreadStatus Show BlockReason Show ThreadId Show NestedAtomically Show NonTermination Show NoMethodError Show RecUpdError Show RecConError Show RecSelError Show PatternMatchFail Show IOMode Show Event Show FdKey Show HandlePosn Show TyCon Show TypeRep Show SomeSymbol Show SomeNat Show Version Show Fixity Show ConstrRep Show DataRep Show Constr Show DataType Show GCStats Show a => Show [a] ( Integral a, Show a) => Show ( Ratio a) Show ( Ptr a) Show ( FunPtr a) Show ( U1 p) Show p => Show ( Par1 p) Show a => Show ( Maybe a) Show a => Show ( Down a) Show a => Show ( Last a) Show a => Show ( First a) Show a => Show ( Product a) Show a => Show ( Sum a) Show a => Show ( Dual a) Show ( ForeignPtr a) Show a => Show ( ZipList a) Show a => Show ( Complex a) HasResolution a => Show ( Fixed a) Show (a -> b) ( Show a, Show b) => Show ( Either a b) Show (f p) => Show ( Rec1 f p) ( Show a, Show b) => Show (a, b) Show ( ST s a) Show ( Proxy k s) Show c => Show ( K1 i c p) ( Show (f p), Show (g p)) => Show ( (:+:) f g p) ( Show (f p), Show (g p)) => Show ( (:*:) f g p) Show (f (g p)) => Show ( (:.:) f g p) ( Show a, Show b, Show c) => Show (a, b, c) Show ( (:~:) k a b) Show ( Coercion k a b) Show (f p) => Show ( M1 i c f p) ( Show a, Show b, Show c, Show d) => Show (a, b, c, d) ( Show a, Show b, Show c, Show d, Show e) => Show (a, b, c, d, e) ( Show a, Show b, Show c, Show d, Show e, Show f) => Show (a, b, c, d, e, f) ( Show a, Show b, Show c, Show d, Show e, Show f, Show g) => Show (a, b, c, d, e, f, g) ( Show a, Show b, Show c, Show d, Show e, Show f, Show g, Show h) => Show (a, b, c, d, e, f, g, h) ( Show a, Show b, Show c, Show d, Show e, Show f, Show g, Show h, Show i) => Show (a, b, c, d, e, f, g, h, i) ( Show a, Show b, Show c, Show d, Show e, Show f, Show g, Show h, Show i, Show j) => Show (a, b, c, d, e, f, g, h, i, j) ( Show a, Show b, Show c, Show d, Show e, Show f, Show g, Show h, Show i, Show j, Show k) => Show (a, b, c, d, e, f, g, h, i, j, k) ( Show a, Show b, Show c, Show d, Show e, Show f, Show g, Show h, Show i, Show j, Show k, Show l) => Show (a, b, c, d, e, f, g, h, i, j, k, l) ( Show a, Show b, Show c, Show d, Show e, Show f, Show g, Show h, Show i, Show j, Show k, Show l, Show m) => Show (a, b, c, d, e, f, g, h, i, j, k, l, m) ( Show a, Show b, Show c, Show d, Show e, Show f, Show g, Show h, Show i, Show j, Show k, Show l, Show m, Show n) => Show (a, b, c, d, e, f, g, h, i, j, k, l, m, n) ( Show a, Show b, Show c, Show d, Show e, Show f, Show g, Show h, Show i, Show j, Show k, Show l, Show m, Show n, Show o) => Show (a, b, c, d, e, f, g, h, i, j, k, l, m, n, o) shows :: Show a => a -> ShowS Source equivalent to showsPrec with a precedence of 0. showChar :: Char -> ShowS Source utility function converting a Char to a show function that simply prepends the character unchanged. showString :: String -> ShowS Source utility function converting a String to a show function that simply prepends the string unchanged. showParen :: Bool -> ShowS -> ShowS Source utility function that surrounds the inner show function with parentheses when the Bool parameter is True . showListWith :: (a -> ShowS ) -> [a] -> ShowS Source Show a list (using square brackets and commas), given a function for showing elements. Produced by Haddock version 2.14.3 | 2026-01-13T09:30:24 |
https://github.com/colby-swandale | colby-swandale (Colby Swandale) · GitHub Skip to content Navigation Menu Toggle navigation Sign in Appearance settings Platform AI CODE CREATION GitHub Copilot Write better code with AI GitHub Spark Build and deploy intelligent apps GitHub Models Manage and compare prompts MCP Registry New Integrate external tools DEVELOPER WORKFLOWS Actions Automate any workflow Codespaces Instant dev environments Issues Plan and track work Code Review Manage code changes APPLICATION SECURITY GitHub Advanced Security Find and fix vulnerabilities Code security Secure your code as you build Secret protection Stop leaks before they start EXPLORE Why GitHub Documentation Blog Changelog Marketplace View all features Solutions BY COMPANY SIZE Enterprises Small and medium teams Startups Nonprofits BY USE CASE App Modernization DevSecOps DevOps CI/CD View all use cases BY INDUSTRY Healthcare Financial services Manufacturing Government View all industries View all solutions Resources EXPLORE BY TOPIC AI Software Development DevOps Security View all topics EXPLORE BY TYPE Customer stories Events & webinars Ebooks & reports Business insights GitHub Skills SUPPORT & SERVICES Documentation Customer support Community forum Trust center Partners Open Source COMMUNITY GitHub Sponsors Fund open source developers PROGRAMS Security Lab Maintainer Community Accelerator Archive Program REPOSITORIES Topics Trending Collections Enterprise ENTERPRISE SOLUTIONS Enterprise platform AI-powered developer platform AVAILABLE ADD-ONS GitHub Advanced Security Enterprise-grade security features Copilot for Business Enterprise-grade AI features Premium Support Enterprise-grade 24/7 support Pricing Search or jump to... Search code, repositories, users, issues, pull requests... --> Search Clear Search syntax tips Provide feedback --> We read every piece of feedback, and take your input very seriously. Include my email address so I can be contacted Cancel Submit feedback Saved searches Use saved searches to filter your results more quickly --> Name Query To see all available qualifiers, see our documentation . Cancel Create saved search Sign in Sign up Appearance settings Resetting focus You signed in with another tab or window. Reload to refresh your session. You signed out in another tab or window. Reload to refresh your session. You switched accounts on another tab or window. Reload to refresh your session. Dismiss alert {{ message }} colby-swandale Follow Overview Repositories 31 Projects 0 Packages 0 Stars 44 More Overview Repositories Projects Packages Stars colby-swandale Follow ✌️ Colby Swandale colby-swandale ✌️ Follow 139 followers · 2 following @rubycentral Melbourne, Australia 20:30 (UTC +11:00) Achievements x4 x3 x3 Achievements x4 x3 x3 Highlights Pro Organizations Block or Report Block or report colby-swandale --> Block user Prevent this user from interacting with your repositories and sending you notifications. Learn more about blocking users . You must be logged in to block users. Add an optional note Maximum 250 characters. Please don't include any personal information such as legal names or email addresses. Markdown supported. This note will be visible to only you. Block user Report abuse Contact GitHub support about this user’s behavior. Learn more about reporting abuse . Report abuse Overview Repositories 31 Projects 0 Packages 0 Stars 44 More Overview Repositories Projects Packages Stars Pinned Loading waterfoul waterfoul Public Gameboy emulator written in Ruby-lang Ruby 93 7 rubyapi/ rubyapi rubyapi/rubyapi Public Ruby API makes it easy and fast to search or browse the Ruby language API docs HTML 595 34 rubygems/ bundler rubygems/bundler Public archive Manage your Ruby application's gem dependencies Ruby 4.9k 2k ruby/ rubygems ruby/rubygems Public Library packaging and distribution for Ruby. Ruby 3.9k 1.9k rubygems/ rubygems.org rubygems/rubygems.org Public The Ruby community's gem hosting service. Ruby 2.4k 982 Something went wrong, please refresh the page to try again. If the problem persists, check the GitHub status page or contact support . Uh oh! There was an error while loading. Please reload this page . Footer © 2026 GitHub, Inc. Footer navigation Terms Privacy Security Status Community Docs Contact Manage cookies Do not share my personal information You can’t perform that action at this time. | 2026-01-13T09:30:24 |
https://twitter.com/asciidoctor | JavaScript is not available. We’ve detected that JavaScript is disabled in this browser. Please enable JavaScript or switch to a supported browser to continue using x.com. You can see a list of supported browsers in our Help Center. Help Center Terms of Service Privacy Policy Cookie Policy Imprint Ads info © 2026 X Corp. Something went wrong, but don’t fret — let’s give it another shot. Try again Some privacy related extensions may cause issues on x.com. Please disable them and try again. | 2026-01-13T09:30:24 |
https://www.linkedin.com/legal/privacy-policy?session_redirect=https%3A%2F%2Fwww%2Elinkedin%2Ecom%2Fposts%2Fnaveenkumarn_hackathon-goose-claude-activity-7385862337678774272-i9so&trk=registration-frontend_join-form-privacy-policy#lithograph-app | LinkedIn Privacy Policy Skip to main content User Agreement Summary of User Agreement Privacy Policy Professional Community Policies Cookie Policy Copyright Policy Regional Info EU Notice California Privacy Disclosure U.S. State Privacy Laws User Agreement Summary of User Agreement Privacy Policy Professional Community Policies Cookie Policy Copyright Policy Regional Info EU Notice California Privacy Disclosure U.S. State Privacy Laws Privacy Policy Effective November 3, 2025 Your Privacy Matters LinkedIn’s mission is to connect the world’s professionals to allow them to be more productive and successful. Central to this mission is our commitment to be transparent about the data we collect about you, how it is used and with whom it is shared. This Privacy Policy applies when you use our Services (described below). We offer our users choices about the data we collect, use and share as described in this Privacy Policy, Cookie Policy , Settings and our Help Center. Key Terms Choices Settings are available to Members of LinkedIn and Visitors are provided separate controls. Learn More . Table of Contents Data We Collect How We Use Your Data How We Share Information Your Choices and Obligations Other Important Information Introduction We are a social network and online platform for professionals. People use our Services to find and be found for business opportunities, to connect with others and find information. Our Privacy Policy applies to any Member or Visitor to our Services. Our registered users (“Members”) share their professional identities, engage with their network, exchange knowledge and professional insights, post and view relevant content, learn and develop skills, and find business and career opportunities. Content and data on some of our Services is viewable to non-Members (“Visitors”). We use the term “Designated Countries” to refer to countries in the European Union (EU), European Economic Area (EEA), and Switzerland. Members and Visitors located in the Designated Countries or the UK can review additional information in our European Regional Privacy Notice . Services This Privacy Policy, including our Cookie Policy applies to your use of our Services. This Privacy Policy applies to LinkedIn.com, LinkedIn-branded apps, and other LinkedIn-branded sites, apps, communications and services offered by LinkedIn (“Services”), including off-site Services, such as our ad services and the “Apply with LinkedIn” and “Share with LinkedIn” plugins, but excluding services that state that they are offered under a different privacy policy. For California residents, additional disclosures required by California law may be found in our California Privacy Disclosure . Data Controllers and Contracting Parties If you are in the “Designated Countries”, LinkedIn Ireland Unlimited Company (“LinkedIn Ireland”) will be the controller of your personal data provided to, or collected by or for, or processed in connection with our Services. If you are outside of the Designated Countries, LinkedIn Corporation will be the controller of (or business responsible for) your personal data provided to, or collected by or for, or processed in connection with our Services. As a Visitor or Member of our Services, the collection, use and sharing of your personal data is subject to this Privacy Policy and other documents referenced in this Privacy Policy, as well as updates. Change Changes to the Privacy Policy apply to your use of our Services after the “effective date.” LinkedIn (“we” or “us”) can modify this Privacy Policy, and if we make material changes to it, we will provide notice through our Services, or by other means, to provide you the opportunity to review the changes before they become effective. If you object to any changes, you may close your account. You acknowledge that your continued use of our Services after we publish or send a notice about our changes to this Privacy Policy means that the collection, use and sharing of your personal data is subject to the updated Privacy Policy, as of its effective date. 1. Data We Collect 1.1 Data You Provide To Us You provide data to create an account with us. Registration To create an account you need to provide data including your name, email address and/or mobile number, general location (e.g., city), and a password. If you register for a premium Service, you will need to provide payment (e.g., credit card) and billing information. You create your LinkedIn profile (a complete profile helps you get the most from our Services). Profile You have choices about the information on your profile, such as your education, work experience, skills, photo, city or area , endorsements, and optional verifications of information on your profile (such as verifications of your identity or workplace). You don’t have to provide additional information on your profile; however, profile information helps you to get more from our Services, including helping recruiters and business opportunities find you. It’s your choice whether to include sensitive information on your profile and to make that sensitive information public. Please do not post or add personal data to your profile that you would not want to be publicly available. You may give other data to us, such as by syncing your calendar. Posting and Uploading We collect personal data from you when you provide, post or upload it to our Services, such as when you fill out a form, (e.g., with demographic data or salary), respond to a survey, or submit a resume or fill out a job application on our Services. If you sync your calendars with our Services, we will collect your calendar meeting information to keep growing your network by suggesting connections for you and others, and by providing information about events, e.g. times, places, attendees and contacts. You don’t have to post or upload personal data; though if you don’t, it may limit your ability to grow and engage with your network over our Services. 1.2 Data From Others Others may post or write about you. Content and News You and others may post content that includes information about you (as part of articles, posts, comments, videos) on our Services. We also may collect public information about you, such as professional-related news and accomplishments, and make it available as part of our Services, including, as permitted by your settings, in notifications to others of mentions in the news . Others may sync their calendar with our Services Contact and Calendar Information We receive personal data (including contact information) about you when others import or sync their calendar with our Services, associate their contacts with Member profiles, scan and upload business cards, or send messages using our Services (including invites or connection requests). If you or others opt-in to sync email accounts with our Services, we will also collect “email header” information that we can associate with Member profiles. Customers and partners may provide data to us. Partners We receive personal data (e.g., your job title and work email address) about you when you use the services of our customers and partners, such as employers or prospective employers and applicant tracking systems providing us job application data. Related Companies and Other Services We receive data about you when you use some of the other services provided by us or our Affiliates , including Microsoft. For example, you may choose to send us information about your contacts in Microsoft apps and services, such as Outlook, for improved professional networking activities on our Services or we may receive information from Microsoft about your engagement with their sites and services. 1.3 Service Use We log your visits and use of our Services, including mobile apps. We log usage data when you visit or otherwise use our Services, including our sites, app and platform technology, such as when you view or click on content (e.g., learning video) or ads (on or off our sites and apps), perform a search, install or update one of our mobile apps, share articles or apply for jobs. We use log-ins, cookies, device information and internet protocol (“IP”) addresses to identify you and log your use. 1.4 Cookies and Similar Technologies We collect data through cookies and similar technologies. As further described in our Cookie Policy , we use cookies and similar technologies (e.g., pixels and ad tags) to collect data (e.g., device IDs) to recognize you and your device(s) on, off and across different services and devices where you have engaged with our Services. We also allow some others to use cookies as described in our Cookie Policy. If you are outside the Designated Countries, we also collect (or rely on others, including Microsoft, who collect) information about your device where you have not engaged with our Services (e.g., ad ID, IP address, operating system and browser information) so we can provide our Members with relevant ads and better understand their effectiveness. Learn more . You can opt out from our use of data from cookies and similar technologies that track your behavior on the sites of others for ad targeting and other ad-related purposes. For Visitors, the controls are here . 1.5 Your Device and Location We receive data through cookies and similar technologies When you visit or leave our Services (including some plugins and our cookies or similar technology on the sites of others), we receive the URL of both the site you came from and the one you go to and the time of your visit. We also get information about your network and device (e.g., IP address, proxy server, operating system, web browser and add-ons, device identifier and features, cookie IDs and/or ISP, or your mobile carrier). If you use our Services from a mobile device, that device will send us data about your location based on your phone settings. We will ask you to opt-in before we use GPS or other tools to identify your precise location. 1.6 Communications If you communicate through our Services, we learn about that. We collect information about you when you communicate with others through our Services (e.g., when you send, receive, or engage with messages, events, or connection requests, including our marketing communications). This may include information that indicates who you are communicating with and when. We also use automated systems to support and protect our site. For example, we use such systems to suggest possible responses to messages and to manage or block content that violates our User Agreement or Professional Community Policies . 1.7 Workplace and School Provided Information When your organization (e.g., employer or school) buys a premium Service for you to use, they give us data about you. Others buying our Services for your use, such as your employer or your school, provide us with personal data about you and your eligibility to use the Services that they purchase for use by their workers, students or alumni. For example, we will get contact information for “ LinkedIn Page ” (formerly Company Page) administrators and for authorizing users of our premium Services, such as our recruiting, sales or learning products. 1.8 Sites and Services of Others We get data when you visit sites that include our ads, cookies or plugins or when you log-in to others’ services with your LinkedIn account. We receive information about your visits and interaction with services provided by others when you log-in with LinkedIn or visit others’ services that include some of our plugins (such as “Apply with LinkedIn”) or our ads, cookies or similar technologies. 1.9 Other We are improving our Services, which means we get new data and create new ways to use data. Our Services are dynamic, and we often introduce new features, which may require the collection of new information. If we collect materially different personal data or materially change how we collect, use or share your data, we will notify you and may also modify this Privacy Policy. Key Terms Affiliates Affiliates are companies controlling, controlled by or under common control with us, including, for example, LinkedIn Ireland, LinkedIn Corporation, LinkedIn Singapore and Microsoft Corporation or any of its subsidiaries (e.g., GitHub, Inc.). 2. How We Use Your Data We use your data to provide, support, personalize and develop our Services. How we use your personal data will depend on which Services you use, how you use those Services and the choices you make in your settings . We may use your personal data to improve, develop, and provide products and Services, develop and train artificial intelligence (AI) models, develop, provide, and personalize our Services, and gain insights with the help of AI, automated systems, and inferences, so that our Services can be more relevant and useful to you and others. You can review LinkedIn's Responsible AI principles here and learn more about our approach to generative AI here . Learn more about the inferences we may make, including as to your age and gender and how we use them. 2.1 Services Our Services help you connect with others, find and be found for work and business opportunities, stay informed, get training and be more productive. We use your data to authorize access to our Services and honor your settings. Stay Connected Our Services allow you to stay in touch and up to date with colleagues, partners, clients, and other professional contacts. To do so, you can “connect” with the professionals who you choose, and who also wish to “connect” with you. Subject to your and their settings , when you connect with other Members, you will be able to search each others’ connections in order to exchange professional opportunities. We use data about you (such as your profile, profiles you have viewed or data provided through address book uploads or partner integrations) to help others find your profile, suggest connections for you and others (e.g. Members who share your contacts or job experiences) and enable you to invite others to become a Member and connect with you. You can also opt-in to allow us to use your precise location or proximity to others for certain tasks (e.g. to suggest other nearby Members for you to connect with, calculate the commute to a new job, or notify your connections that you are at a professional event). It is your choice whether to invite someone to our Services, send a connection request, or allow another Member to become your connection. When you invite someone to connect with you, your invitation will include your network and basic profile information (e.g., name, profile photo, job title, region). We will send invitation reminders to the person you invited. You can choose whether or not to share your own list of connections with your connections. Visitors have choices about how we use their data. Stay Informed Our Services allow you to stay informed about news, events and ideas regarding professional topics you care about, and from professionals you respect. Our Services also allow you to improve your professional skills, or learn new ones. We use the data we have about you (e.g., data you provide, data we collect from your engagement with our Services and inferences we make from the data we have about you), to personalize our Services for you, such as by recommending or ranking relevant content and conversations on our Services. We also use the data we have about you to suggest skills you could add to your profile and skills that you might need to pursue your next opportunity. So, if you let us know that you are interested in a new skill (e.g., by watching a learning video), we will use this information to personalize content in your feed, suggest that you follow certain Members on our site, or suggest related learning content to help you towards that new skill. We use your content, activity and other data, including your name and photo, to provide notices to your network and others. For example, subject to your settings , we may notify others that you have updated your profile, posted content, took a social action , used a feature, made new connections or were mentioned in the news . Career Our Services allow you to explore careers, evaluate educational opportunities, and seek out, and be found for, career opportunities. Your profile can be found by those looking to hire (for a job or a specific task ) or be hired by you. We will use your data to recommend jobs and show you and others relevant professional contacts (e.g., who work at a company, in an industry, function or location or have certain skills and connections). You can signal that you are interested in changing jobs and share information with recruiters. We will use your data to recommend jobs to you and you to recruiters. We may use automated systems to provide content and recommendations to help make our Services more relevant to our Members, Visitors and customers. Keeping your profile accurate and up-to-date may help you better connect to others and to opportunities through our Services. Productivity Our Services allow you to collaborate with colleagues, search for potential clients, customers, partners and others to do business with. Our Services allow you to communicate with other Members and schedule and prepare meetings with them. If your settings allow, we scan messages to provide “bots” or similar tools that facilitate tasks such as scheduling meetings, drafting responses, summarizing messages or recommending next steps. Learn more . 2.2 Premium Services Our premium Services help paying users to search for and contact Members through our Services, such as searching for and contacting job candidates, sales leads and co-workers, manage talent and promote content. We sell premium Services that provide our customers and subscribers with customized-search functionality and tools (including messaging and activity alerts) as part of our talent, marketing and sales solutions. Customers can export limited information from your profile, such as name, headline, current company, current title, and general location (e.g., Dublin), such as to manage sales leads or talent, unless you opt-out . We do not provide contact information to customers as part of these premium Services without your consent. Premium Services customers can store information they have about you in our premium Services, such as a resume or contact information or sales history. The data stored about you by these customers is subject to the policies of those customers. Other enterprise Services and features that use your data include TeamLink and LinkedIn Pages (e.g., content analytics and followers). 2.3 Communications We contact you and enable communications between Members. We offer settings to control what messages you receive and how often you receive some types of messages. We will contact you through email, mobile phone, notices posted on our websites or apps, messages to your LinkedIn inbox, and other ways through our Services, including text messages and push notifications. We will send you messages about the availability of our Services, security, or other service-related issues. We also send messages about how to use our Services, network updates, reminders, job suggestions and promotional messages from us and our partners. You may change your communication preferences at any time. Please be aware that you cannot opt out of receiving service messages from us, including security and legal notices. We also enable communications between you and others through our Services, including for example invitations , InMail , groups and messages between connections. 2.4 Advertising We serve you tailored ads both on and off our Services. We offer you choices regarding personalized ads, but you cannot opt-out of seeing non-personalized ads. We target (and measure the performance of) ads to Members, Visitors and others both on and off our Services directly or through a variety of partners, using the following data, whether separately or combined: Data collected by advertising technologies on and off our Services using pixels, ad tags (e.g., when an advertiser installs a LinkedIn tag on their website), cookies, and other device identifiers; Member-provided information (e.g., profile, contact information, title and industry); Data from your use of our Services (e.g., search history, feed, content you read, who you follow or is following you, connections, groups participation, page visits, videos you watch, clicking on an ad, etc.), including as described in Section 1.3; Information from advertising partners , vendors and publishers ; and Information inferred from data described above (e.g., using job titles from a profile to infer industry, seniority, and compensation bracket; using graduation dates to infer age or using first names or pronoun usage to infer gender; using your feed activity to infer your interests; or using device data to recognize you as a Member). Learn more about the inferences we make and how they may be used for advertising. Learn more about the ad technologies we use and our advertising services and partners. You can learn more about our compliance with laws in the Designated Countries or the UK in our European Regional Privacy Notice . We will show you ads called sponsored content which look similar to non-sponsored content, except that they are labeled as advertising (e.g., as “ad” or “sponsored”). If you take a social action (such as like, comment or share) on these ads, your action is associated with your name and viewable by others, including the advertiser. Subject to your settings , if you take a social action on the LinkedIn Services, that action may be mentioned with related ads. For example, when you like a company we may include your name and photo when their sponsored content is shown. Ad Choices You have choices regarding our uses of certain categories of data to show you more relevant ads. Member settings can be found here . For Visitors, the setting is here . Info to Ad Providers We do not share your personal data with any non-Affiliated third-party advertisers or ad networks except for: (i) hashed IDs or device identifiers (to the extent they are personal data in some countries); (ii) with your separate permission (e.g., in a lead generation form) or (iii) data already visible to any users of the Services (e.g., profile). However, if you view or click on an ad on or off our Services, the ad provider will get a signal that someone visited the page that displayed the ad, and they may, through the use of mechanisms such as cookies, determine it is you. Advertising partners can associate personal data collected by the advertiser directly from you with hashed IDs or device identifiers received from us. We seek to contractually require such advertising partners to obtain your explicit, opt-in consent before doing so where legally required, and in such instances, we take steps to ensure that consent has been provided before processing data from them. 2.5 Marketing We promote our Services to you and others. In addition to advertising our Services, we use Members’ data and content for invitations and communications promoting membership and network growth, engagement and our Services, such as by showing your connections that you have used a feature on our Services. 2.6 Developing Services and Research We develop our Services and conduct research Service Development We use data, including public feedback, to conduct research and development for our Services in order to provide you and others with a better, more intuitive and personalized experience, drive membership growth and engagement on our Services, and help connect professionals to each other and to economic opportunity. Other Research We seek to create economic opportunity for Members of the global workforce and to help them be more productive and successful. We use the personal data available to us to research social, economic and workplace trends, such as jobs availability and skills needed for these jobs and policies that help bridge the gap in various industries and geographic areas. In some cases, we work with trusted third parties to perform this research, under controls that are designed to protect your privacy. We may also make public data available to researchers to enable assessment of the safety and legal compliance of our Services. We publish or allow others to publish economic insights, presented as aggregated data rather than personal data. Surveys Polls and surveys are conducted by us and others through our Services. You are not obligated to respond to polls or surveys, and you have choices about the information you provide. You may opt-out of survey invitations. 2.7 Customer Support We use data to help you and fix problems. We use data (which can include your communications) to investigate, respond to and resolve complaints and for Service issues (e.g., bugs). 2.8 Insights That Do Not Identify You We use data to generate insights that do not identify you. We use your data to perform analytics to produce and share insights that do not identify you. For example, we may use your data to generate statistics about our Members, their profession or industry, to calculate ad impressions served or clicked on (e.g., for basic business reporting to support billing and budget management or, subject to your settings , for reports to advertisers who may use them to inform their advertising campaigns), to show Members' information about engagement with a post or LinkedIn Page , to publish visitor demographics for a Service or create demographic workforce insights, or to understand usage of our services. 2.9 Security and Investigations We use data for security, fraud prevention and investigations. We and our Affiliates, including Microsoft, may use your data (including your communications) for security purposes or to prevent or investigate possible fraud or other violations of the law, our User Agreement and/or attempts to harm our Members, Visitors, company, Affiliates, or others. Key Terms Social Action E.g. like, comment, follow, share Partners Partners include ad networks, exchanges and others 3. How We Share Information 3.1 Our Services Any data that you include on your profile and any content you post or social action (e.g., likes, follows, comments, shares) you take on our Services will be seen by others, consistent with your settings. Profile Your profile is fully visible to all Members and customers of our Services. Subject to your settings , it can also be visible to others on or off of our Services (e.g., Visitors to our Services or users of third-party search tools). As detailed in our Help Center , your settings, degree of connection with the viewing Member, the subscriptions they may have, their usage of our Services , access channels and search types (e.g., by name or by keyword) impact the availability of your profile and whether they can view certain fields in your profile. Posts, Likes, Follows, Comments, Messages Our Services allow viewing and sharing information including through posts, likes, follows and comments. When you share an article or a post (e.g., an update, image, video or article) publicly it can be viewed by everyone and re-shared anywhere (subject to your settings ). Members, Visitors and others will be able to find and see your publicly-shared content, including your name (and photo if you have provided one). In a group , posts are visible to others according to group type. For example, posts in private groups are visible to others in the group and posts in public groups are visible publicly. Your membership in groups is public and part of your profile, but you can change visibility in your settings . Any information you share through companies’ or other organizations’ pages on our Services will be viewable by those organizations and others who view those pages' content. When you follow a person or organization, you are visible to others and that “page owner” as a follower. We let senders know when you act on their message, subject to your settings where applicable. Subject to your settings , we let a Member know when you view their profile. We also give you choices about letting organizations know when you've viewed their Page. When you like or re-share or comment on another’s content (including ads), others will be able to view these “social actions” and associate it with you (e.g., your name, profile and photo if you provided it). Your employer can see how you use Services they provided for your work (e.g. as a recruiter or sales agent) and related information. We will not show them your job searches or personal messages. Enterprise Accounts Your employer may offer you access to our enterprise Services such as Recruiter, Sales Navigator, LinkedIn Learning or our advertising Campaign Manager. Your employer can review and manage your use of such enterprise Services. Depending on the enterprise Service, before you use such Service, we will ask for permission to share with your employer relevant data from your profile or use of our non-enterprise Services. For example, users of Sales Navigator will be asked to share their “social selling index”, a score calculated in part based on their personal account activity. We understand that certain activities such as job hunting and personal messages are sensitive, and so we do not share those with your employer unless you choose to share it with them through our Services (for example, by applying for a new position in the same company or mentioning your job hunting in a message to a co-worker through our Services). Subject to your settings , when you use workplace tools and services (e.g., interactive employee directory tools) certain of your data may also be made available to your employer or be connected with information we receive from your employer to enable these tools and services. 3.2 Communication Archival Regulated Members may need to store communications outside of our Service. Some Members (or their employers) need, for legal or professional compliance, to archive their communications and social media activity, and will use services of others to provide these archival services. We enable archiving of messages by and to those Members outside of our Services. For example, a financial advisor needs to archive communications with her clients through our Services in order to maintain her professional financial advisor license. 3.3 Others’ Services You may link your account with others’ services so that they can look up your contacts’ profiles, post your shares on such platforms, or enable you to start conversations with your connections on such platforms. Excerpts from your profile will also appear on the services of others. Subject to your settings , other services may look up your profile. When you opt to link your account with other services, personal data (e.g., your name, title, and company) will become available to them. The sharing and use of that personal data will be described in, or linked to, a consent screen when you opt to link the accounts. For example, you may link your Twitter or WeChat account to share content from our Services into these other services, or your email provider may give you the option to upload your LinkedIn contacts into its own service. Third-party services have their own privacy policies, and you may be giving them permission to use your data in ways we would not. You may revoke the link with such accounts. The information you make available to others in our Services (e.g., information from your profile, your posts, your engagement with the posts, or message to Pages) may be available to them on other services . For example, search tools, mail and calendar applications, or talent and lead managers may show a user limited profile data (subject to your settings ), and social media management tools or other platforms may display your posts. The information retained on these services may not reflect updates you make on LinkedIn. 3.4 Related Services We share your data across our different Services and LinkedIn affiliated entities. We will share your personal data with our Affiliates to provide and develop our Services. For example, we may refer a query to Bing in some instances, such as where you'd benefit from a more up to date response in a chat experience. Subject to our European Regional Privacy Notice , we may also share with our Affiliates, including Microsoft, your (1) publicly-shared content (such as your public LinkedIn posts) to provide or develop their services and (2) personal data to improve, provide or develop their advertising services. Where allowed , we may combine information internally across the different Services covered by this Privacy Policy to help our Services be more relevant and useful to you and others. For example, we may personalize your feed or job recommendations based on your learning history. 3.5 Service Providers We may use others to help us with our Services. We use others to help us provide our Services (e.g., maintenance, analysis, audit, payments, fraud detection, customer support, marketing and development). They will have access to your information (e.g., the contents of a customer support request) as reasonably necessary to perform these tasks on our behalf and are obligated not to disclose or use it for other purposes. If you purchase a Service from us, we may use a payments service provider who may separately collect information about you (e.g., for fraud prevention or to comply with legal obligations). 3.6 Legal Disclosures We may need to share your data when we believe it’s required by law or to help protect the rights and safety of you, us or others. It is possible that we will need to disclose information about you when required by law, subpoena, or other legal process or if we have a good faith belief that disclosure is reasonably necessary to (1) investigate, prevent or take action regarding suspected or actual illegal activities or to assist government enforcement agencies; (2) enforce our agreements with you; (3) investigate and defend ourselves against any third-party claims or allegations; (4) protect the security or integrity of our Services or the products or services of our Affiliates (such as by sharing with companies facing similar threats); or (5) exercise or protect the rights and safety of LinkedIn, our Members, personnel or others. We attempt to notify Members about legal demands for their personal data when appropriate in our judgment, unless prohibited by law or court order or when the request is an emergency. We may dispute such demands when we believe, in our discretion, that the requests are overbroad, vague or lack proper authority, but we do not promise to challenge every demand. To learn more see our Data Request Guidelines and Transparency Report . 3.7 Change in Control or Sale We may share your data when our business is sold to others, but it must continue to be used in accordance with this Privacy Policy. We can also share your personal data as part of a sale, merger or change in control, or in preparation for any of these events. Any other entity which buys us or part of our business will have the right to continue to use your data, but only in the manner set out in this Privacy Policy unless you agree otherwise. 4. Your Choices & Obligations 4.1 Data Retention We keep most of your personal data for as long as your account is open. We generally retain your personal data as long as you keep your account open or as needed to provide you Services. This includes data you or others provided to us and data generated or inferred from your use of our Services. Even if you only use our Services when looking for a new job every few years, we will retain your information and keep your profile open, unless you close your account. In some cases we choose to retain certain information (e.g., insights about Services use) in a depersonalized or aggregated form. 4.2 Rights to Access and Control Your Personal Data You can access or delete your personal data. You have many choices about how your data is collected, used and shared. We provide many choices about the collection, use and sharing of your data, from deleting or correcting data you include in your profile and controlling the visibility of your posts to advertising opt-outs and communication controls. We offer you settings to control and manage the personal data we have about you. For personal data that we have about you, you can: Delete Data : You can ask us to erase or delete all or some of your personal data (e.g., if it is no longer necessary to provide Services to you). Change or Correct Data : You can edit some of your personal data through your account. You can also ask us to change, update or fix your data in certain cases, particularly if it’s inaccurate. Object to, or Limit or Restrict, Use of Data : You can ask us to stop using all or some of your personal data (e.g., if we have no legal right to keep using it) or to limit our use of it (e.g., if your personal data is inaccurate or unlawfully held). Right to Access and/or Take Your Data : You can ask us for a copy of your personal data and can ask for a copy of personal data you provided in machine readable form. Visitors can learn more about how to make these requests here . You may also contact us using the contact information below, and we will consider your request in accordance with applicable laws. Residents in the Designated Countries and the UK , and other regions , may have additional rights under their laws. 4.3 Account Closure We keep some of your data even after you close your account. If you choose to close your LinkedIn account, your personal data will generally stop being visible to others on our Services within 24 hours. We generally delete closed account information within 30 days of account closure, except as noted below. We retain your personal data even after you have closed your account if reasonably necessary to comply with our legal obligations (including law enforcement requests), meet regulatory requirements, resolve disputes, maintain security, prevent fraud and abuse (e.g., if we have restricted your account for breach of our Professional Community Policies ), enforce our User Agreement, or fulfill your request to "unsubscribe" from further messages from us. We will retain de-personalized information after your account has been closed. Information you have shared with others (e.g., through InMail, updates or group posts) will remain visible after you close your account or delete the information from your own profile or mailbox, and we do not control data that other Members have copied out of our Services. Groups content and ratings or review content associated with closed accounts will show an unknown user as the source. Your profile may continue to be displayed in the services of others (e.g., search tools) until they refresh their cache. 5. Other Important Information 5.1. Security We monitor for and try to prevent security breaches. Please use the security features available through our Services. We implement security safeguards designed to protect your data, such as HTTPS. We regularly monitor our systems for possible vulnerabilities and attacks. However, we cannot warrant the security of any information that you send us. There is no guarantee that data may not be accessed, disclosed, altered, or destroyed by breach of any of our physical, technical, or managerial safeguards. 5.2. Cross-Border Data Transfers We store and use your data outside your country. We process data both inside and outside of the United States and rely on legally-provided mechanisms to lawfully transfer data across borders. Learn more . Countries where we process data may have laws which are different from, and potentially not as protective as, the laws of your own country. 5.3 Lawful Bases for Processing We have lawful bases to collect, use and share data about you. You have choices about our use of your data. At any time, you can withdraw consent you have provided by going to settings. We will only collect and process personal data about you where we have lawful bases. Lawful bases include consent (where you have given consent), contract (where processing is necessary for the performance of a contract with you (e.g., to deliver the LinkedIn Services you have requested) and “legitimate interests.” Learn more . Where we rely on your consent to process personal data, you have the right to withdraw or decline your consent at any time and where we rely on legitimate interests, you have the right to object. Learn More . If you have any questions about the lawful bases upon which we collect and use your personal data, please contact our Data Protection Officer here . If you're located in one of the Designated Countries or the UK, you can learn more about our lawful bases for processing in our European Regional Privacy Notice . 5.4. Direct Marketing and Do Not Track Signals Our statements regarding direct marketing and “do not track” signals. We currently do not share personal data with third parties for their direct marketing purposes without your permission. Learn more about this and about our response to “do not track” signals. 5.5. Contact Information You can contact us or use other options to resolve any complaints. If you have questions or complaints regarding this Policy, please first contact LinkedIn online. You can also reach us by physical mail . If contacting us does not resolve your complaint, you have more options . Residents in the Designated Countries and other regions may also have the right to contact our Data Protection Officer here . If this does not resolve your complaint, Residents in the Designated Countries and other regions may have more options under their laws. Key Terms Consent Where we process data based on consent, we will ask for your explicit consent. You may withdraw your consent at any time, but that will not affect the lawfulness of the processing of your personal data prior to such withdrawal. Where we rely on contract, we will ask that you agree to the processing of personal data that is necessary for entering into or performance of your contract with us. We will rely on legitimate interests as a basis for data processing where the processing of your data is not overridden by your interests or fundamental rights and freedoms. LinkedIn © 2026 About Accessibility User Agreement Privacy Policy Cookie Policy Copyright Policy Brand Policy Guest Controls Community Guidelines العربية (Arabic) বাংলা (Bangla) Čeština (Czech) Dansk (Danish) Deutsch (German) Ελληνικά (Greek) English (English) Español (Spanish) فارسی (Persian) Suomi (Finnish) Français (French) हिंदी (Hindi) Magyar (Hungarian) Bahasa Indonesia (Indonesian) Italiano (Italian) עברית (Hebrew) 日本語 (Japanese) 한국어 (Korean) मराठी (Marathi) Bahasa Malaysia (Malay) Nederlands (Dutch) Norsk (Norwegian) ਪੰਜਾਬੀ (Punjabi) Polski (Polish) Português (Portuguese) Română (Romanian) Русский (Russian) Svenska (Swedish) తెలుగు (Telugu) ภาษาไทย (Thai) Tagalog (Tagalog) Türkçe (Turkish) Українська (Ukrainian) Tiếng Việt (Vietnamese) 简体中文 (Chinese (Simplified)) 正體中文 (Chinese (Traditional)) Language | 2026-01-13T09:30:24 |
http://hackage.haskell.org/package/semigroupoids-4.2/docs/src/Data-Semigroupoid-Ob.html#Ob | src/Data/Semigroupoid/Ob.hs {-# LANGUAGE MultiParamTypeClasses #-} {-# LANGUAGE FlexibleInstances #-} {-# LANGUAGE FlexibleContexts #-} {-# LANGUAGE CPP #-} ----------------------------------------------------------------------------- -- | -- Module : Data.Semigroup.Ob -- Copyright : (C) 2011-2012 Edward Kmett, -- License : BSD-style (see the file LICENSE) -- -- Maintainer : Edward Kmett <ekmett@gmail.com> -- Stability : experimental -- Portability : non-portable (flexible MPTCs) -- ---------------------------------------------------------------------------- module Data . Semigroupoid . Ob where import Data . Semigroupoid import Data . Semigroupoid . Product import Data . Semigroupoid . Coproduct import Data . Functor . Bind import Control . Arrow #ifdef MIN_VERSION_comonad import Data . Functor . Extend import Control . Comonad #endif class Semigroupoid k => Ob k a where semiid :: k a a instance ( Ob l a , Ob r b ) => Ob ( Product l r ) ( a , b ) where semiid = Pair semiid semiid instance ( Ob l a , Semigroupoid r ) => Ob ( Coproduct l r ) ( L a ) where semiid = L semiid instance ( Semigroupoid l , Ob r a ) => Ob ( Coproduct l r ) ( R a ) where semiid = R semiid instance ( Bind m , Monad m ) => Ob ( Kleisli m ) a where semiid = Kleisli return #ifdef MIN_VERSION_comonad instance ( Extend w , Comonad w ) => Ob ( Cokleisli w ) a where semiid = Cokleisli extract #endif instance Ob ( -> ) a where semiid = id | 2026-01-13T09:30:24 |
http://hackage.haskell.org/package/semigroupoids-4.2/docs/src/Data-Semigroupoid.html | src/Data/Semigroupoid.hs {-# LANGUAGE CPP #-} #if defined(__GLASGOW_HASKELL__) && __GLASGOW_HASKELL__ >= 702 #ifdef MIN_VERSION_comonad #if __GLASGOW_HASKELL__ >= 707 && (MIN_VERSION_comonad(3,0,3)) {-# LANGUAGE Safe #-} #else {-# LANGUAGE Trustworthy #-} #endif #else {-# LANGUAGE Trustworthy #-} #endif #endif ----------------------------------------------------------------------------- -- | -- Module : Data.Semigroupoid -- Copyright : (C) 2007-2011 Edward Kmett -- License : BSD-style (see the file LICENSE) -- -- Maintainer : Edward Kmett <ekmett@gmail.com> -- Stability : provisional -- Portability : portable -- -- A semigroupoid satisfies all of the requirements to be a Category except -- for the existence of identity arrows. ---------------------------------------------------------------------------- module Data . Semigroupoid ( Semigroupoid ( .. ) , WrappedCategory ( .. ) , Semi ( .. ) ) where import Control . Arrow import Data . Functor . Bind import Data . Semigroup import Control . Category import Prelude hiding ( id , ( . ) ) #ifdef MIN_VERSION_contravariant import Data . Functor . Contravariant #endif #ifdef MIN_VERSION_comonad import Data . Functor . Extend import Control . Comonad #endif -- | 'Control.Category.Category' sans 'Control.Category.id' class Semigroupoid c where o :: c j k -> c i j -> c i k instance Semigroupoid ( -> ) where o = ( . ) -- | < http://en.wikipedia.org/wiki/Band_(mathematics)#Rectangular_bands > instance Semigroupoid (,) where o ( _ , k ) ( i , _ ) = ( i , k ) instance Bind m => Semigroupoid ( Kleisli m ) where Kleisli g `o` Kleisli f = Kleisli $ \ a -> f a >>- g #ifdef MIN_VERSION_comonad instance Extend w => Semigroupoid ( Cokleisli w ) where Cokleisli f `o` Cokleisli g = Cokleisli $ f . extended g #endif #ifdef MIN_VERSION_contravariant instance Semigroupoid Op where Op f `o` Op g = Op ( g `o` f ) #endif newtype WrappedCategory k a b = WrapCategory { unwrapCategory :: k a b } instance Category k => Semigroupoid ( WrappedCategory k ) where WrapCategory f `o` WrapCategory g = WrapCategory ( f . g ) instance Category k => Category ( WrappedCategory k ) where id = WrapCategory id WrapCategory f . WrapCategory g = WrapCategory ( f . g ) newtype Semi m a b = Semi { getSemi :: m } instance Semigroup m => Semigroupoid ( Semi m ) where Semi m `o` Semi n = Semi ( m <> n ) instance Monoid m => Category ( Semi m ) where id = Semi mempty Semi m . Semi n = Semi ( m `mappend` n ) | 2026-01-13T09:30:24 |
http://hackage.haskell.org/package/semigroupoids-4.2/docs/src/Data-Semigroupoid-Ob.html | src/Data/Semigroupoid/Ob.hs {-# LANGUAGE MultiParamTypeClasses #-} {-# LANGUAGE FlexibleInstances #-} {-# LANGUAGE FlexibleContexts #-} {-# LANGUAGE CPP #-} ----------------------------------------------------------------------------- -- | -- Module : Data.Semigroup.Ob -- Copyright : (C) 2011-2012 Edward Kmett, -- License : BSD-style (see the file LICENSE) -- -- Maintainer : Edward Kmett <ekmett@gmail.com> -- Stability : experimental -- Portability : non-portable (flexible MPTCs) -- ---------------------------------------------------------------------------- module Data . Semigroupoid . Ob where import Data . Semigroupoid import Data . Semigroupoid . Product import Data . Semigroupoid . Coproduct import Data . Functor . Bind import Control . Arrow #ifdef MIN_VERSION_comonad import Data . Functor . Extend import Control . Comonad #endif class Semigroupoid k => Ob k a where semiid :: k a a instance ( Ob l a , Ob r b ) => Ob ( Product l r ) ( a , b ) where semiid = Pair semiid semiid instance ( Ob l a , Semigroupoid r ) => Ob ( Coproduct l r ) ( L a ) where semiid = L semiid instance ( Semigroupoid l , Ob r a ) => Ob ( Coproduct l r ) ( R a ) where semiid = R semiid instance ( Bind m , Monad m ) => Ob ( Kleisli m ) a where semiid = Kleisli return #ifdef MIN_VERSION_comonad instance ( Extend w , Comonad w ) => Ob ( Cokleisli w ) a where semiid = Cokleisli extract #endif instance Ob ( -> ) a where semiid = id | 2026-01-13T09:30:24 |
https://intellij-asciidoc-plugin.ahus1.de/docs/users-guide/index.html | Overview of the IntelliJ AsciiDoc Plugin :: IntelliJ AsciiDoc Plugin IntelliJ AsciiDoc Plugin Quick-Start User’s Guide Contributor’s Guide FAQ User’s Guide Overview Quick Start Installing the plugin Setup for technical writing Installing IntelliJ Starting IntelliJ Opening a project Editing an AsciiDoc file Navigating in a project Searching in a project Learning AsciiDoc syntax Using tables in AsciiDoc Collaborate using Git Preparing a repository Using Antora with IntelliJ Recommended Plugins Getting help Decisions around Antora Structuring Antora repositories Generated content and attachments Configuring the plugin Plugin’s Features Editing Content Using Hotkeys Searching content Previewing content Diagrams in the preview JavaFX Preview JCEF Preview Highlighting source code Advanced Asciidoclet Asciidoctor Config File Asciidoctor Extensions Conditional Rendering Custom stylesheets Creating DOCX Creating HTML Creating PDF Front matter Checking the Grammar Live Templates Multi-module Projects Validation in the IDE Validation in CI/CD PDFs with non-latin fonts Privacy for users Reformatting Content Spring REST Docs Working with Antora Working with Hugo Frequently asked questions Indent missing when pasting Proxy issues JCEF preview JavaFX initialization stuck Validation of files JavaFX blurry preview Error Message ENOENT Troubleshooting MPS Problems with Diagrams in PDFs Could not render diagrams with external helpers User’s Guide default Contributor’s Guide default User’s Guide default User’s Guide Overview Edit this Page Overview of the IntelliJ AsciiDoc Plugin Write documentation without leaving your IDE. Preview your docs locally before publishing them. Collaborate using a version control system. Publish with confidence using automated builds. Writing technical documentation When writing technical documentation, it needs a team effort where everyone contributes and collaborates. For the content you write, you want to be able to publish for different audiences in different target formats like static HTML pages, in-line help or PDFs. Why to use AsciiDoc and IntelliJ The AsciiDoc format allows you to write your content once and automate its publishing using standard build automation tools. The IntelliJ family of IDEs like IntelliJ IDEA, GoLand, WebStorm or PyCharm allows you to efficiently navigate and edit your content. It allows you to collaborate with other developers writers using version control systems like Git. How this plugin helps writers and developers This plugin adds AsciiDoc functionality to your IDE to make your productive when writing your technical documentation. It provides the writer with…​ a context-sensitive editor, a configurable preview and integrations to the AsciiDoc ecosystem. Where to go from here To continue the journey with one of the following: Visit the (short) Quick Start guide or the (in depth) Setup for technical writing guide. Read about the Features of the IntelliJ AsciiDoc plugin . Use the navigation on the left to learn about a specific topic you are interested in. If you got questions, please raise them as a new GitHub issue . Quick Start This page was built using Antora - © 2013-2021 Julien Viet, Erik Pragt, Alexander Schwartz and the individual contributors. Released under the Apache License, Version 2.0 - GitHub - Imprint - Privacy × | 2026-01-13T09:30:24 |
http://hackage.haskell.org/package/semigroupoids-4.2/docs/src/Data-Semigroupoid-Ob.html#semiid | src/Data/Semigroupoid/Ob.hs {-# LANGUAGE MultiParamTypeClasses #-} {-# LANGUAGE FlexibleInstances #-} {-# LANGUAGE FlexibleContexts #-} {-# LANGUAGE CPP #-} ----------------------------------------------------------------------------- -- | -- Module : Data.Semigroup.Ob -- Copyright : (C) 2011-2012 Edward Kmett, -- License : BSD-style (see the file LICENSE) -- -- Maintainer : Edward Kmett <ekmett@gmail.com> -- Stability : experimental -- Portability : non-portable (flexible MPTCs) -- ---------------------------------------------------------------------------- module Data . Semigroupoid . Ob where import Data . Semigroupoid import Data . Semigroupoid . Product import Data . Semigroupoid . Coproduct import Data . Functor . Bind import Control . Arrow #ifdef MIN_VERSION_comonad import Data . Functor . Extend import Control . Comonad #endif class Semigroupoid k => Ob k a where semiid :: k a a instance ( Ob l a , Ob r b ) => Ob ( Product l r ) ( a , b ) where semiid = Pair semiid semiid instance ( Ob l a , Semigroupoid r ) => Ob ( Coproduct l r ) ( L a ) where semiid = L semiid instance ( Semigroupoid l , Ob r a ) => Ob ( Coproduct l r ) ( R a ) where semiid = R semiid instance ( Bind m , Monad m ) => Ob ( Kleisli m ) a where semiid = Kleisli return #ifdef MIN_VERSION_comonad instance ( Extend w , Comonad w ) => Ob ( Cokleisli w ) a where semiid = Cokleisli extract #endif instance Ob ( -> ) a where semiid = id | 2026-01-13T09:30:24 |
http://hackage.haskell.org/package/base-4.6.0.1/docs/Data-Maybe.html#t:Maybe | Data.Maybe Source Contents Index base-4.6.0.1: Basic libraries Portability portable Stability stable Maintainer libraries@haskell.org Safe Haskell Trustworthy Data.Maybe Description The Maybe type, and associated operations. Synopsis data Maybe a = Nothing | Just a maybe :: b -> (a -> b) -> Maybe a -> b isJust :: Maybe a -> Bool isNothing :: Maybe a -> Bool fromJust :: Maybe a -> a fromMaybe :: a -> Maybe a -> a listToMaybe :: [a] -> Maybe a maybeToList :: Maybe a -> [a] catMaybes :: [ Maybe a] -> [a] mapMaybe :: (a -> Maybe b) -> [a] -> [b] Documentation data Maybe a Source The Maybe type encapsulates an optional value. A value of type Maybe a either contains a value of type a (represented as Just a ), or it is empty (represented as Nothing ). Using Maybe is a good way to deal with errors or exceptional cases without resorting to drastic measures such as error . The Maybe type is also a monad. It is a simple kind of error monad, where all errors are represented by Nothing . A richer error monad can be built using the Either type. Constructors Nothing Just a Instances Monad Maybe Functor Maybe Typeable1 Maybe MonadFix Maybe MonadPlus Maybe Applicative Maybe Foldable Maybe Traversable Maybe Generic1 Maybe Alternative Maybe Eq a => Eq ( Maybe a) Data a => Data ( Maybe a) Ord a => Ord ( Maybe a) Read a => Read ( Maybe a) Show a => Show ( Maybe a) Generic ( Maybe a) Monoid a => Monoid ( Maybe a) Lift a semigroup into Maybe forming a Monoid according to http://en.wikipedia.org/wiki/Monoid : "Any semigroup S may be turned into a monoid simply by adjoining an element e not in S and defining e*e = e and e*s = s = s*e for all s ∈ S ." Since there is no "Semigroup" typeclass providing just mappend , we use Monoid instead. maybe :: b -> (a -> b) -> Maybe a -> b Source The maybe function takes a default value, a function, and a Maybe value. If the Maybe value is Nothing , the function returns the default value. Otherwise, it applies the function to the value inside the Just and returns the result. isJust :: Maybe a -> Bool Source The isJust function returns True iff its argument is of the form Just _ . isNothing :: Maybe a -> Bool Source The isNothing function returns True iff its argument is Nothing . fromJust :: Maybe a -> a Source The fromJust function extracts the element out of a Just and throws an error if its argument is Nothing . fromMaybe :: a -> Maybe a -> a Source The fromMaybe function takes a default value and and Maybe value. If the Maybe is Nothing , it returns the default values; otherwise, it returns the value contained in the Maybe . listToMaybe :: [a] -> Maybe a Source The listToMaybe function returns Nothing on an empty list or Just a where a is the first element of the list. maybeToList :: Maybe a -> [a] Source The maybeToList function returns an empty list when given Nothing or a singleton list when not given Nothing . catMaybes :: [ Maybe a] -> [a] Source The catMaybes function takes a list of Maybe s and returns a list of all the Just values. mapMaybe :: (a -> Maybe b) -> [a] -> [b] Source The mapMaybe function is a version of map which can throw out elements. In particular, the functional argument returns something of type Maybe b . If this is Nothing , no element is added on to the result list. If it just Just b , then b is included in the result list. Produced by Haddock version 2.13.2 | 2026-01-13T09:30:24 |
http://hackage.haskell.org/package/transformers-0.4.1.0/docs/Control-Monad-Trans-Class.html#t:MonadTrans | Control.Monad.Trans.Class Source Contents Index transformers-0.4.1.0: Concrete functor and monad transformers Portability portable Stability experimental Maintainer ross@soi.city.ac.uk Safe Haskell Safe-Inferred Control.Monad.Trans.Class Contents Transformer class Conventions Strict monads Examples Parsing Parsing and counting Interpreter monad Description The class of monad transformers. A monad transformer makes a new monad out of an existing monad, such that computations of the old monad may be embedded in the new one. To construct a monad with a desired set of features, one typically starts with a base monad, such as Identity , [] or IO , and applies a sequence of monad transformers. Synopsis class MonadTrans t where lift :: Monad m => m a -> t m a Transformer class class MonadTrans t where Source The class of monad transformers. Instances should satisfy the following laws, which state that lift is a monad transformation: lift . return = return lift (m >>= f) = lift m >>= ( lift . f) Methods lift :: Monad m => m a -> t m a Source Lift a computation from the argument monad to the constructed monad. Instances MonadTrans IdentityT MonadTrans ListT MonadTrans MaybeT MonadTrans ( ContT r) MonadTrans ( ReaderT r) MonadTrans ( StateT s) MonadTrans ( StateT s) MonadTrans ( ExceptT e) Error e => MonadTrans ( ErrorT e) Monoid w => MonadTrans ( WriterT w) Monoid w => MonadTrans ( WriterT w) Monoid w => MonadTrans ( RWST r w s) Monoid w => MonadTrans ( RWST r w s) Conventions Most monad transformer modules include the special case of applying the transformer to Identity . For example, State s is an abbreviation for StateT s Identity . Each monad transformer also comes with an operation run XXX T to unwrap the transformer, exposing a computation of the inner monad. (Currently these functions are defined as field labels, but in the next major release they will be separate functions.) All of the monad transformers except ContT are functors on the category of monads: in addition to defining a mapping of monads, they also define a mapping from transformations between base monads to transformations between transformed monads, called map XXX T . Thus given a monad transformation t :: M a -> N a , the combinator mapStateT constructs a monad transformation mapStateT t :: StateT s M a -> StateT s N a Each of the monad transformers introduces relevant operations. In a sequence of monad transformers, most of these operations.can be lifted through other transformers using lift or the map XXX T combinator, but a few with more complex type signatures require specialized lifting combinators, called lift Op . Strict monads A monad is said to be strict if its >>= operation is strict in its first argument. The base monads Maybe , [] and IO are strict: >>> undefined >> return 2 :: Maybe Integer *** Exception: Prelude.undefined However the monad Identity is not: >>> runIdentity (undefined >> return 2) 2 In a strict monad you know when each action is executed, but the monad is not necessarily strict in the return value, or in other components of the monad, such as a state. However you can use seq to create an action that is strict in the component you want evaluated. Examples Parsing One might define a parsing monad by adding a state (the String remaining to be parsed) to the [] monad, which provides non-determinism: import Control.Monad.Trans.State type Parser = StateT String [] Then Parser is an instance of MonadPlus : monadic sequencing implements concatenation of parsers, while mplus provides choice. To use parsers, we need a primitive to run a constructed parser on an input string: runParser :: Parser a -> String -> [a] runParser p s = [x | (x, "") <- runStateT p s] Finally, we need a primitive parser that matches a single character, from which arbitrarily complex parsers may be constructed: item :: Parser Char item = do c:cs <- get put cs return c In this example we use the operations get and put from Control.Monad.Trans.State , which are defined only for monads that are applications of StateT . Alternatively one could use monad classes from the mtl package or similar, which contain methods get and put with types generalized over all suitable monads. Parsing and counting We can define a parser that also counts by adding a WriterT transformer: import Control.Monad.Trans.Class import Control.Monad.Trans.State import Control.Monad.Trans.Writer import Data.Monoid type Parser = WriterT (Sum Int) (StateT String []) The function that applies a parser must now unwrap each of the monad transformers in turn: runParser :: Parser a -> String -> [(a, Int)] runParser p s = [(x, n) | ((x, Sum n), "") <- runStateT (runWriterT p) s] To define the item parser, we need to lift the StateT operations through the WriterT transformer. item :: Parser Char item = do c:cs <- lift get lift (put cs) return c In this case, we were able to do this with lift , but operations with more complex types require special lifting functions, which are provided by monad transformers for which they can be implemented. If you use the monad classes of the mtl package or similar, this lifting is handled automatically by the instances of the classes, and you need only use the generalized methods get and put . We can also define a primitive using the Writer: tick :: Parser () tick = tell (Sum 1) Then the parser will keep track of how many tick s it executes. Interpreter monad This example is a cut-down version of the one in "Monad Transformers and Modular Interpreters", by Sheng Liang, Paul Hudak and Mark Jones in POPL'95 ( http://web.cecs.pdx.edu/~mpj/pubs/modinterp.html ). Suppose we want to define an interpreter that can do I/O and has exceptions, an environment and a modifiable store. We can define a monad that supports all these things as a stack of monad transformers: import Control.Monad.Trans.Class import Control.Monad.Trans.State import qualified Control.Monad.Trans.Reader as R import qualified Control.Monad.Trans.Except as E type InterpM = StateT Store (R.ReaderT Env (E.ExceptT Err [])) for suitable types Store , Env and Err . Now we would like to be able to use the operations associated with each of those monad transformers on InterpM actions. Since the uppermost monad transformer of InterpM is StateT , it already has the state operations get and set . The first of the ReaderT operations, ask , is a simple action, so we can lift it through StateT to InterpM using lift : ask :: InterpM Env ask = lift R.ask The other ReaderT operation, local , has a suitable type for lifting using mapStateT : local :: (Env -> Env) -> InterpM a -> InterpM a local f = mapStateT (R.local f) We also wish to lift the operations of ExceptT through both ReaderT and StateT . For the operation throwE , we know throwE e is a simple action, so we can lift it through the two monad transformers to InterpM with two lift s: throwE :: Err -> InterpM a throwE e = lift (lift (E.throwE e)) The catchE operation has a more complex type, so we need to use the special-purpose lifting function liftCatch provided by most monad transformers. Here we use the ReaderT version followed by the StateT version: catchE :: InterpM a -> (Err -> InterpM a) -> InterpM a catchE = liftCatch (R.liftCatch E.catchE) We could lift IO actions to InterpM using three lift s, but InterpM is automatically an instance of MonadIO , so we can use liftIO instead: putStr :: String -> InterpM () putStr s = liftIO (Prelude.putStr s) Produced by Haddock version 2.13.2 | 2026-01-13T09:30:24 |
https://github.com/tnir | tnir (Takuya N) · GitHub Skip to content Navigation Menu Toggle navigation Sign in Appearance settings Platform AI CODE CREATION GitHub Copilot Write better code with AI GitHub Spark Build and deploy intelligent apps GitHub Models Manage and compare prompts MCP Registry New Integrate external tools DEVELOPER WORKFLOWS Actions Automate any workflow Codespaces Instant dev environments Issues Plan and track work Code Review Manage code changes APPLICATION SECURITY GitHub Advanced Security Find and fix vulnerabilities Code security Secure your code as you build Secret protection Stop leaks before they start EXPLORE Why GitHub Documentation Blog Changelog Marketplace View all features Solutions BY COMPANY SIZE Enterprises Small and medium teams Startups Nonprofits BY USE CASE App Modernization DevSecOps DevOps CI/CD View all use cases BY INDUSTRY Healthcare Financial services Manufacturing Government View all industries View all solutions Resources EXPLORE BY TOPIC AI Software Development DevOps Security View all topics EXPLORE BY TYPE Customer stories Events & webinars Ebooks & reports Business insights GitHub Skills SUPPORT & SERVICES Documentation Customer support Community forum Trust center Partners Open Source COMMUNITY GitHub Sponsors Fund open source developers PROGRAMS Security Lab Maintainer Community Accelerator Archive Program REPOSITORIES Topics Trending Collections Enterprise ENTERPRISE SOLUTIONS Enterprise platform AI-powered developer platform AVAILABLE ADD-ONS GitHub Advanced Security Enterprise-grade security features Copilot for Business Enterprise-grade AI features Premium Support Enterprise-grade 24/7 support Pricing Search or jump to... Search code, repositories, users, issues, pull requests... --> Search Clear Search syntax tips Provide feedback --> We read every piece of feedback, and take your input very seriously. Include my email address so I can be contacted Cancel Submit feedback Saved searches Use saved searches to filter your results more quickly --> Name Query To see all available qualifiers, see our documentation . Cancel Create saved search Sign in Sign up Appearance settings Resetting focus You signed in with another tab or window. Reload to refresh your session. You signed out in another tab or window. Reload to refresh your session. You switched accounts on another tab or window. Reload to refresh your session. Dismiss alert {{ message }} tnir Follow Overview Repositories 229 Projects 0 Packages 1 Stars 21 More Overview Repositories Projects Packages Stars tnir Follow 🍎 DX/DevOps/SecOps/GitLab/GitHub Takuya N tnir 🍎 DX/DevOps/SecOps/GitLab/GitHub Follow Sponsor Cloud Native Ambassador ( @cncf ) / @gitlabhq Core, omnibus-gitlab, pandas, @docker Machine, Gunicorn, Celery flower, @django , unbound Docker 154 followers · 0 following #maintainermonth @gitlab-tokyo Tokyo / Japan / Earth https://tnir.gitlab.io/ Achievements x3 x3 Achievements x3 x3 Highlights Developer Program Member Organizations Block or Report Block or report tnir --> Block user Prevent this user from interacting with your repositories and sending you notifications. Learn more about blocking users . You must be logged in to block users. Add an optional note Maximum 250 characters. Please don't include any personal information such as legal names or email addresses. Markdown supported. This note will be visible to only you. Block user Report abuse Contact GitHub support about this user’s behavior. Learn more about reporting abuse . Report abuse Overview Repositories 229 Projects 0 Packages 1 Stars 21 More Overview Repositories Projects Packages Stars Pinned Loading gitlabhq/ gitlabhq gitlabhq/gitlabhq Public GitLab CE Mirror | Please open new issues in our issue tracker on GitLab.com Ruby 24.2k 5.8k django/ django django/django Public The Web framework for perfectionists with deadlines. Python 86.5k 33.5k pandas-dev/ pandas pandas-dev/pandas Public Flexible and powerful data analysis / manipulation library for Python, providing labeled data structures similar to R data.frame objects, statistical functions, and much more Python 47.6k 19.5k DefinitelyTyped/ DefinitelyTyped DefinitelyTyped/DefinitelyTyped Public The repository for high quality TypeScript type definitions. TypeScript 50.8k 30.5k nodejs/ node nodejs/node Public Node.js JavaScript runtime ✨🐢🚀✨ JavaScript 115k 34.4k mysqlclient mysqlclient Public the mysqlclient Docker image (based on python:3.8.5-alpine3.12) https://github.com/PyMySQL/mysqlclient-python Dockerfile 21 3 Something went wrong, please refresh the page to try again. If the problem persists, check the GitHub status page or contact support . Uh oh! There was an error while loading. Please reload this page . Footer © 2026 GitHub, Inc. Footer navigation Terms Privacy Security Status Community Docs Contact Manage cookies Do not share my personal information You can’t perform that action at this time. | 2026-01-13T09:30:24 |
https://heisenbug.blogspot.com/2009/05/ketchup-problem.html | don't count on finding me: Ketchup Problem skip to main | skip to sidebar don't count on finding me Wednesday, May 27, 2009 Ketchup Problem In Chapter 6 (page 16) Jeremy Gibbons describes a datatype that models all secure operations that can be applied to a (partially filled) ketchup bottle . I believe that this is the example that Jeremy has shown me at ICFP'07 in Freiburg (when I have introduced him to my thrist concept), and I have been unable to find it ever since. Now, I guess I can add it to the bibliography section of my paper. That is, if I ever get around updating the draft again... PS: a bibtex-able conference paper is here . Posted by heisenbug at 6:43 AM Labels: thrist No comments: Post a Comment Newer Post Older Post Home Subscribe to: Post Comments (Atom) Blog Archive ►  2022 (1) ►  February (1) ►  2014 (5) ►  November (1) ►  October (1) ►  August (1) ►  July (1) ►  January (1) ►  2013 (5) ►  September (1) ►  August (3) ►  February (1) ►  2012 (2) ►  December (1) ►  September (1) ►  2011 (7) ►  December (1) ►  November (1) ►  October (1) ►  September (1) ►  August (1) ►  February (1) ►  January (1) ►  2010 (19) ►  December (5) ►  November (6) ►  October (1) ►  August (1) ►  July (2) ►  June (4) ▼  2009 (12) ►  November (2) ►  October (1) ►  August (1) ►  June (1) ▼  May (1) Ketchup Problem ►  March (4) ►  January (2) ►  2008 (22) ►  October (1) ►  September (3) ►  August (6) ►  July (3) ►  June (2) ►  May (1) ►  April (3) ►  March (1) ►  February (1) ►  January (1) ►  2007 (20) ►  December (2) ►  November (1) ►  October (1) ►  September (1) ►  August (1) ►  July (14) About Me heisenbug I am here and there. You may encounter me if you try, but no guarantees. Just a hint: I am mostly with my family. View my complete profile   | 2026-01-13T09:30:24 |
http://zenhabits.net/discomfort/ | Discomfort Zone: How to Master the Universe - Zen Habits Website zen habits mastery coaching youtube podcast books about archives breathe Discomfort Zone: How to Master the Universe ‘The only thing I can’t stand is discomfort.’ ~Gloria Steinem By Leo Babauta Of all the skills I’ve learned in the past 7 years of changing my life, one skill stands out: Learning to be comfortable with discomfort. If you learn this skill, you can master pretty much anything. You can beat procrastination, start exercising, make your diet healthier, learn a new language, make it through challenges and physically grueling events, explore new things, speak on a stage, let go of all that you know, and become a minimalist. And that’s just the start. Unfortunately, most people avoid discomfort. I mean, they really avoid it -- at the first sign of discomfort, they’ll run as fast as possible in the other direction. This is perhaps the biggest limiting factor for most people, and it’s why you can’t change your habits. Think about this: many people don’t eat vegetables because they don’t like the taste. We’re not talking about soul-wrenching pain here, not Guantanamo torture, but a taste that’s just not something you’re used to. And so they eat what they already like, which is sweets and fried stuff and meats and cheeses and salty things and lots of processed flour. The simple act of learning to get used to something that tastes different -- not really that hard in the grand scheme of life -- makes people unhealthy, often overweight. I know, because this was me for so many years. I became fat and sedentary and a smoker and deeply in debt with lots of clutter and procrastination, because I didn’t like things that were uncomfortable. And so I created a life that was deeply uncomfortable as a result. The beautiful thing is: I learned that a little discomfort isn’t a bad thing. In fact, it can be something you enjoy, with a little training. When I learned this, I was able to change everything, and am still pretty good at changing because of this one skill. Master your fear of discomfort, and you can master the universe. Avoidance of Discomfort When people are stressed, they often turn to cigarettes, food, shopping, alcohol, drugs … anything to get rid of the disomfort of the thing that’s stressing them out. And yet, if you take a deeper look at the stress, it’s really an unfounded fear that’s causing it (usually the fear that we’re not good enough), and if we examined it and gave it some light of day, it would start to go away. When people start to exercise after being sedentary, they are uncomfortable. It’s hard! It can make you sore. It’s not as easy as not exercising. It’s not something you’re used to doing, and you fear doing it wrong or looking stupid. And so you stop after awhile, because it’s uncomfortable, when really it’s not horrible to be uncomfortable for a little while. We’re not talking about incredible pain, but just discomfort. When people try a healthier diet, they often don’t like it -- eating veggies and raw nuts and flaxseeds and fruits and tofu or tempeh or black beans isn’t as thrilling as eating fried, fatty, salty or sweet foods. It’s a form of discomfort to change your taste buds, but the truth is, it can easily happen if you just get through a little discomfort. Discomfort isn’t bad. It’s just not what we’re used to. And so we avoid it, but at the cost of not being able to change things, not being healthy, not being open to adventure and the chaos of raw life. Mastering Discomfort The way to master discomfort is to do it comfortably. That might sound contradictory, but it’s not. If you are afraid of discomfort, and you try to beat discomfort with a really gruelling activity, you will probably give up and fail, and go back to comfort. So do it in small doses. Pick something that’s not hard . Take meditation as an example. It’s not really that hard -- you just sit down and pay attention to your body and breath, in the present moment. You don’t have to empty your mind (just notice your thoughts), you don’t have to chant anything weird, you just sit and pay attention. If you don’t like meditation, try a new healthy food, like kale or raw almonds or quinoa. Or a fairly easy exercise if you’re sedentary, like walking or jogging. Just do a little . You don’t have to start by doing 30 minutes of something you’re not used to doing. Just do a few minutes. Just start. Push out of your comfort zone, a little . My friend and Zen priest Susan O’Connell has a favorite meditation instruction that you can use for any activity actually: when you’re meditating and you feel like getting up, don’t; then when you feel the urge to get up a second time, don’t; and when you feel the urge to get up a third time, then get up. So you sit through the urge, the discomfort, twice before finally giving in the third time. This is a nice balance, so that you’re pushing your comfort zone a little. You can do this in exercise and many other activities -- push a little. Watch the discomfort . Watch yourself as you get a bit uncomfortable -- are you starting to complain (internally)? Are you looking for ways to avoid it? Where do you turn to? What happens if you stay with it, and don’t do anything? Smile . This is not trivial advice. If you can smile while being uncomfortable, you can learn to be happy with discomfort, with practice. When I did the Goruck Challenge in 2011, it was 13 hours of discomfort -- raw and bloody knees, sand in my shoes as a hiked and ran with 60+ pounds on my back, carrying teammates and logs, doing pushups and crabwalks and other exercises, needing the bathroom and being tired and hungry and cold. And yet, I practiced something simple: I tried to mantain a smile through all this discomfort. It’s an important practice. Repeat this practice daily. It will be strange, perhaps difficult, at first, but soon your comfort zone will expand. If you practice it enough, with different activities, your comfort zone will expand to include discomfort. And then you can master the universe. What You Can Now Master If you master discomfort, what can you now master as a result? Just about anything: Procrastination . We procrastinate to avoid something that’s not comfortable, but if you can learn to stay with that task, even if it’s not comfortable. The discomfort isn’t bad. Those of you going through the Procrastination module in my Sea Change Program are learning about dealing with the discomfort of staying with your important task. Exercise . We avoid exercise because it’s not comfortable, but if we expand the comfort zone a little at a time, we can make exercise something we’re comfortable with, after a little repetition. Writing . If you want to write but always seem to put it off, that’s because writing is often difficult, or less comfortable than checking email or social networks (for example). Stay with the discomfort, and you’ll write more than ever. Eating healthy . It’s amazing how much our taste buds can change over time, if we gradually get used to healthier foods. That means going through small periods of discomfort, but it’s not that bad in little doses. Meditation . We avoid the disomfort of sitting and doing nothing, of focusing on the present. But it’s not that hard -- just a little uncomfortable. Waking early . Waking early means being a little tired for a little while, but that’s not a horrible thing. Read more about rising early . Learning a language/instrument . Want to learn something new? That means doing something you’re not used to, by definition, and so we often quit before we master this new skill, simply because (you guessed it) it makes us uncomfortable. Stay with the discomfort, and before long you’ll enjoy learning this new skill. Clutter . Clutter is just another form of procrastination. You don’t put things away, or you let a pile of things you don’t need build up, because it’s not comfortable dealing with it right now (as compared to, say, browsing the Internet or watching TV). But dealing with something right now isn’t that hard once you get past the discomfort. Reading novels . We tend to avoid simply sitting with a book, because we are pulled towards something more comfortable (again, Internet browsing as an example). If we can just sit with the book and a little discomfort, we can read more. Empty email inbox . Another form of procrastination -- you get some emails, maybe look at them, but put off dealing with them right now because it’s easier not to. Debt . This is a series of things we have to deal with that are uncomfortable -- listing out our debts and bills, making a simple budget, doing things that are free instead of shopping, etc. But I got out of debt by finally facing all of these things, and it was wonderful. New adventures . Many people stay with places they’re comfortable with, which means missing out on new experiences that might be a little uncomfortable. Even when they travel, many people stick with the tourist sights and food that they’re used to, rather than finding strange but more authentic experiences in a new land. We avoid meeting new people, speaking on stage, letting go of what we know, being open to new things … to avoid discomfort. And that’s just the start. Within each of these areas there’s many things you can work on over the coming years now that you’re not afraid of discomfort, and there are many other areas of exploration now open to you. Discomfort can be the joyful key that opens up everything for you. ‘Discomfort is very much part of my master plan.’ ~Jonathan Lethem Previous post: The Most Successful Techniques for Rising Early Next post: The Power of Habit Investments Life-changing training programs and experiences Get Zen Habits in Your Inbox Weekly articles, videos, and offerings to take your life to the next level. Free Training from Leo Habits, purpose, and impact for a more fulfilling, fearless life. Create the Life You Want Immerse in Zen Habits Teachings Craft Your Life With Intention YouTube Instagram Threads BlueSky LinkedIn | 2026-01-13T09:30:24 |
http://hackage.haskell.org/package/semigroupoids-4.2/docs/src/Data-Semigroupoid-Product.html | src/Data/Semigroupoid/Product.hs {-# LANGUAGE GADTs #-} module Data . Semigroupoid . Product ( Product ( .. ) , distributeDualProduct , factorDualProduct ) where import Data . Semigroupoid import Data . Semigroupoid . Dual import Data . Groupoid data Product j k a b where Pair :: j a b -> k a' b' -> Product j k ( a , a' ) ( b , b' ) instance ( Semigroupoid j , Semigroupoid k ) => Semigroupoid ( Product j k ) where Pair w x `o` Pair y z = Pair ( w `o` y ) ( x `o` z ) instance ( Groupoid j , Groupoid k ) => Groupoid ( Product j k ) where inv ( Pair w x ) = Pair ( inv w ) ( inv x ) distributeDualProduct :: Dual ( Product j k ) a b -> Product ( Dual j ) ( Dual k ) a b distributeDualProduct ( Dual ( Pair l r ) ) = Pair ( Dual l ) ( Dual r ) factorDualProduct :: Product ( Dual j ) ( Dual k ) a b -> Dual ( Product j k ) a b factorDualProduct ( Pair ( Dual l ) ( Dual r ) ) = Dual ( Pair l r ) | 2026-01-13T09:30:24 |
https://www.unicode.org/faq/private_use.html#noncharacters | FAQ - Private-Use Characters, Noncharacters, and Sentinels Tech Site | Site Map | Search Frequently Asked Questions Private-Use Characters, Noncharacters & Sentinels FAQ Private-Use Characters Q: What are private-use characters? Private-use characters are code points whose interpretation is not specified by a character encoding standard and whose use and interpretation may be determined by private agreement among cooperating users. Private-use characters are sometimes also referred to as user-defined characters (UDC) or vendor-defined characters (VDC). Q: What are the ranges for private-use characters in Unicode? There are three ranges of private-use characters in the standard. The main range in the BMP is U+E000..U+F8FF, containing 6,400 private-use characters. That range is often referred to as the Private Use Area ( PUA ). But there are also two large ranges of supplementary private-use characters, consisting of most of the code points on Planes 15 and 16: U+F0000..U+FFFFD and U+100000..U+10FFFD. Together those ranges allocate another 131,068 private-use characters. Altogether, then, there are 137,468 private-use characters in Unicode. Q: Why are there so many private-use characters in Unicode? Unicode is a very large and inclusive character set , containing many more standardized characters than any of the legacy character encodings. Most users have little need for private-use characters , because the characters they need are already present in the standard. However, some implementations, particularly those interoperating with East Asian legacy data, originally anticipated needing large numbers of private-use characters to enable round-trip conversion to private-use definitions in that data. In most cases, 6,400 private-use characters is more than enough, but there can be occasions when 6,400 does not suffice. Allocating a large number of private-use characters has the additional benefit of allowing implementations to choose ranges for their private-use characters that are less likely to conflict with ranges used by others. The allocation of two entire additional planes full of private-use characters ensures that even the most extravagant implementation of private-use character definitions can be fully accomodated by Unicode. Q: Will the number of private-use characters in Unicode ever change? No. The set of private-use characters is formally immutable. This is guaranteed by a Unicode Stability Policy . Q: What legacy character encodings also have private-use characters? Private-use characters are most commonly used in East Asia, particularly in Japan, China, and Korea, to extend the available characters in various standards and vendor character sets . Typically, such characters have been used to add Han characters not included in the standard repertoire of the character set. Such non-standard Han character extensions are often referred to as "gaiji" in Japanese contexts. Q: What is the purpose of private-use characters? Private-use characters are used for interoperability with legacy CJK encodings. They can also be used for characters that may never get standard encodings, such as characters in a constructed artificial script (ConScript) which has no general community of use. Or a particular implementation may need to use private-use characters for specific internal purposes. Private-use characters are also useful for testing implementations of scripts or other sets of characters which may be proposed for encoding in a future version of Unicode Q: How can private-use characters be input? Some input method editors ( IME ) allow customizations whereby an input sequence and resulting private-use character can be added to their internal dictionaries. Q: How are private-use characters displayed? With common font technologies such as OpenType and AAT, private-use characters can be added to fonts for display. Q: What happens if definitions of private-use characters conflict? The same code points in the PUA may be given different meanings in different contexts, since they are, after all, defined by users and are not standardized. For example, if text comes from a legacy NEC encoding in Japan, the same code point in the PUA may mean something entirely different if interpreted on a legacy Fujitsu machine, even though both systems would share the same private-use code points . For each given interpretation of a private-use character one would have to pick the appropriate IME , user dictionary and fonts to work with it. Q: What about properties for private-use characters? One should not expect the rest of an operating system to override the character properties for private-use characters , since private use characters can have different meanings, depending on how they originated. In terms of line breaking, case conversions, and other textual processes, private-use characters will typically be treated by the operating system as otherwise undistinguished letters (or ideographs ) with no uppercase / lowercase distinctions. Q: What does "private agreement among cooperating parties" mean? A "private agreement" simply refers to the fact that agreement about the interpretation of some set of private-use characters is done privately, outside the context of the standard. The Unicode Standard does not specify any particular interpretation for any private-use character. There is no implication that a private agreement necessarily has any contractual or other legal status—it is simply an agreement between two or more parties about how a particular set of private-use characters should be interpreted. Q: How would I define a private agreement? One can share, or even publish, documentation containing particular assignments for private-use characters , their glyphs , and other relevant information about their interpretation. One can then ask others to use those private-use characters as documented. One can create appropriate fonts and IMEs , or request that others do so. Noncharacters Q: What are noncharacters? A " noncharacter " is a code point that is permanently reserved in the Unicode Standard for internal use and that will never be assigned to an abstract character . Q: How did noncharacters get that weird name? Noncharacters are in a sense a kind of private-use character , because they are reserved for internal (private) use. However, that internal use is intended as a "super" private use , not normally interchanged with other users. Their allocation status in Unicode differs from that of ordinary private-use characters. They are considered unassigned to any abstract character , and they share the General_Category value Cn (Unassigned) with unassigned reserved code points in the standard. In this sense they are "less a character" than most characters in Unicode, and the moniker "noncharacter" seemed appropriate to the UTC to express that unique aspect of their identity. In Unicode 1.0 the code points U+FFFE and U+FFFF were annotated in the code charts as "Not character codes" and instead of having actual names were labeled "NOT A CHARACTER". The term "noncharacter" in later versions of the standard evolved from those early annotations and labels. Q: How many noncharacters does Unicode have? Exactly 66. Q: Which code points are noncharacters? The 66 noncharacters are allocated as follows: a contiguous range of 32 noncharacters: U+FDD0..U+FDEF in the BMP the last two code points of the BMP, U+FFFE and U+FFFF the last two code points of each of the 16 supplementary planes : U+1FFFE, U+1FFFF, U+2FFFE, U+2FFFF, ... U+10FFFE, U+10FFFF For convenient reference, the following table summarizes all of the noncharacters, showing their representations in UTF-32 , UTF-16 , and UTF-8 . (In this table, "#" stands for either the hex digit "E" or "F".) UTF-32 UTF-16 UTF-8 0000FDD0 FDD0 EF B7 90 ... 0000FDEF FDEF EF B7 AF 0000FFF# FFF# EF BF B# 0001FFF# D83F DFF# F0 9F BF B# 0002FFF# D87F DFF# F0 AF BF B# 0003FFF# D8BF DFF# F0 BF BF B# 0004FFF# D8FF DFF# F1 8F BF B# ... 000FFFF# DBBF DFF# F3 BF BF B# 0010FFF# DBFF DFF# F4 8F BF B# Q: Why are 32 of the noncharacters located in a block of Arabic characters? The allocation of the range of noncharacters U+FDD0..U+FDEF in the middle of the Arabic Presentation Forms-A block was mostly a matter of efficiency in the use of reserved code points in the rather fully-allocated BMP . The Arabic Presentation Forms-A block had a contiguous range of 32 unassigned code points , but as of 2001, when the need for more BMP noncharacters became apparent, it was already clear to the UTC that the encoding of many more Arabic presentation forms similar to those already in the Arabic Presentation Forms-A block would not be useful to anyone. Rather than designate an entirely new block for noncharacters, the unassigned range U+FDD0..U+FDEF was designated for them, instead. Note that the range U+FDD0..U+FDEF for noncharacters is another example of why it is never safe to simply assume from the name of a block in the Unicode Standard that you know exactly what kinds of characters it contains. The identity of any character is determined by its actual properties in the Unicode Character Database . The noncharacter code points in the range U+FDD0..U+FDEF share none of their properties with other characters in the Arabic Presentation Forms-A block; they certainly are not Arabic script characters, for example. Q: Will the set of noncharacters in Unicode ever change? No. The set of noncharacters is formally immutable. This is guaranteed by a Unicode Stability Policy . Q: Are noncharacters intended for interchange? No. They are intended explicity for internal use. For example, they might be used internally as a particular kind of object placeholder in a string. Or they might be used in a collation tailoring as a target for a weighting that comes between weights for "real" characters of different scripts, thus simplifying the support of "alphabetic index" implementations. Q: Are noncharacters prohibited in interchange? This question has led to some controversy, because the Unicode Standard has been somewhat ambiguous about the status of noncharacters . The formal wording of the definition of "noncharacter" in the standard has always indicated that noncharacters "should never be interchanged." That led some people to assume that the definition actually meant "shall not be interchanged" and that therefore the presence of a noncharacter in any Unicode string immediately rendered that string malformed according to the standard. But the intended use of noncharacters requires the ability to exchange them in a limited context, at least across APIs and even through data files and other means of "interchange", so that they can be processed as intended. The choice of the word "should" in the original definition was deliberate, and indicated that one should not try to interchange noncharacters precisely because their interpretation is strictly internal to whatever implementation uses them, so they have no publicly interchangeable semantics. But other informative wording in the text of the core specification and in the character names list was differently and more strongly worded, leading to contradictory interpretations. Given this ambiguity of intent, in 2013 the UTC issued Corrigendum #9 , which deleted the phrase "and that should never be interchanged" from the definition of noncharacters, to make it clear that prohibition from interchange is not part of the formal definition of noncharacters. Corrigendum #9 has been incorporated into the core specification starting with Unicode 7.0. Q: Are noncharacters invalid in Unicode strings and UTFs? Absolutely not. Noncharacters do not cause a Unicode string to be ill-formed in any UTF . This can be seen explicitly in the table above , where every noncharacter code point has a well-formed representation in UTF-32 , in UTF-16 , and in UTF-8 . An implementation which converts noncharacter code points between one UTF representation and another must preserve these values correctly. The fact that they are called "noncharacters" and are not intended for open interchange does not mean that they are somehow illegal or invalid code points which make strings containing them invalid. Q: So how should libraries and tools handle noncharacters? Library APIs, components, and tool applications (such as low-level text editors) which handle all Unicode strings should also handle noncharacters . Often this means simple pass-through, the same way such an API or tool would handle a reserved unassigned code point . Such APIs and tools would not normally be expected to interpret the semantics of noncharacters, precisely because the intended use of a noncharacter is internal. But an API or tool should also not arbitrarily filter out, convert, or otherwise discard the value of noncharacters, any more than they would do for private-use characters or reserved unassigned code points. Q: If my application makes specific, internal use of a noncharacter, what should I do with input text? In cases where the input text cannot be guaranteed to use the same interpretation for the noncharacter as your program does, and the presence of that noncharacter would cause internal problems, it is best practice to replace that particular noncharacter on input by U+FFFD. Of course, such behavior should be clearly documented, so that external clients know what to expect. Q: What should I do if downstream clients depend on noncharacters being passed through by my module? In such a case, your module may need to use a more complicated mechanism to preserve noncharacters for pass through, while not interfering with their specific internal use. This behavior will prevent your downstream clients from breaking, at the cost of making your processing marginally more complex. However, because of this additional complexity, if you anticipate that a future version of your module may not pass through one or more noncharacters, it is best practice to document the reservation of those values from the start. In that way, any downstream client using your module can have clearly specified expectations regarding which noncharacter values your module may replace. Q: Can failing to replace noncharacters with U+FFFD lead to problems? If your implementation has no conflicting internal definition and use for the particular noncharacter in question, it is usually harmless to just leave noncharacters in the text stream. They definitely will not be displayable and might break up text units or create other "funny" effects in text, but these results are typically the same as could be expected for an uninterpreted private-use character or even a normal assigned character for which no display glyph is available. Q: Can noncharacters simply be deleted from input text? No. Doing so can lead to security problems. For more information, see UTS #39 “Unicode Security Mechanisms , UTS #55 “Unicode Source Code Handling” , and UAX #31 “Unicode Identifiers and Syntax” . Q: Can you summarize the basic differences between private-use characters and noncharacters? Private-use characters do not have any meanings assigned by the Unicode Standard, but are intended to be interchanged among cooperating parties who share conventions about what the private-use characters mean. Typically, sharing those conventions means that there will also be some kind of public documentation about such use: for example, a website listing a table of interpretations for certain ranges of private-use characters. As an example, see the ConScript Unicode Registry — a private group unaffiliated with the Unicode Consortium — which has extensive tables listing private-use character definitions for various unencoded scripts. Or such public documentation might consist of the specification of all the glyphs in a font distributed for the purpose of displaying certain ranges of private-use characters. Of course, a group of cooperating users which have a private agreement about the interpretation of some private-use characters is under no obligation to publish the details of their agreement. Noncharacters also do not have any meanings assigned by the Unicode Standard, but unlike private-use characters, they are intended only for internal use, and are not intended for interchange. Occasionally, there will be no public documentation available about their use in particular instances, and fonts typically do not have glyphs for them. Noncharacters and private-use characters also differ significantly in their default Unicode character property values. Code Point Type Use Type Properties noncharacter private, internal gc=Cn, bc=BN, eaw=N private use private, interchange gc=Co, bc=L, eaw=A Sentinels Q: What is a sentinel? A sentinel is a special numeric value typically used to signal an edge condition of some sort. For text, in particular, sentinels are values stored with text but which are not interpreted as part of the text, and which indicate some special status. For example, a null byte is used as a sentinel in C strings to mark the end of the string. Q: Is it safe to use a noncharacter as an end-of-string sentinel? It is not recommended. The use of any Unicode code point U+0000..U+10FFFF as a sentinel value (such as "end of text" in APIs) can cause problems when that code point actually occurs in the text. It is preferable to use a true out-of-range value, for example -1. This is parallel to the use of -1 as the sentinel end-of-file (EOF) value in the standard C library, and is easy and fast to test for in code with a (result < 0) check. Alternatively, a clearly out-of-range positive value such as 0x7FFFFFFF could also be used as a sentinel value. Q: How about using NULL as an end-of-string sentinel? When using UTF-8 in C strings, implementations follow the same conventions they would for any legacy 8-bit character encoding in C strings. The byte 0x00 marks the end of the string, consistent with the C standard. Because the byte 0x00 in UTF-8 also represents U+0000 NULL, a UTF-8 C string cannot have a NULL in its contents. This is precisely the same issue as for using C strings with ASCII . In fact, an ASCII C string is formally indistinguishable from a UTF-8 C string with the same character content. It is also quite common for implementations which handle both UTF-8 and UTF-16 data to implement 16-bit string handling analogously to C strings, using 0x0000 as a 16-bit sentinel to indicate end of string for a 16-bit Unicode string . The rationale for this approach and the associated problems completely parallel those for UTF-8 C strings. Q: The Unicode Standard talks about U+FEFF BYTE ORDER MARK (BOM) being a signature. Is that the same as a sentinel? No. A signature is a defined sequence of bytes used to identify an object. In the case of Unicode text, certain encoding schemes use specific initial byte sequences to identify the byte order of a Unicode text stream. See the BOM FAQ entries for more details. Q: Why is the byte-swapped BOM (U+FFFE) a noncharacter? U+FFFE was designated as a noncharacter to make it unlikely that normal, interchanged text would begin with U+FFFE. The occurrence of U+FFFE as the initial character as part of text has the potential to confuse applications testing for the two initial signature bytes <FE FF ...> or <FF FE ...> of a byte stream labeled as using the UTF-16 encoding scheme . That can interfere with checking for the presence of a BOM which would indicate big-endian or little-endian order. Q: Are U+FFFE and U+FFFF illegal in Unicode? U+FFFE and U+FFFF are noncharacters just like the other 64 noncharacters in the standard. Implementers should be aware of the fact that all noncharacters in the standard are also valid in Unicode strings , must be converted between UTFs , and may be encountered in Unicode strings. Q: Is it possible to use U+FFFF or U+10FFFF as sentinels? Because U+FFFF and U+10FFFF are noncharacters , nothing would prohibit a privately-defined internal use of either of them as sentinels: both have interesting numerical properties which render them likely choices for internal use as sentinels. However, such use is problematical in the same way that use of any valid character as a sentinel can be problematical. They are valid elements of Unicode strings and they may be encountered in Unicode data—not necessarily used with the same interpretation as for one's own sentinel use. Q: How did the current status of U+FFFE and U+FFFF evolve? In the days of Unicode 1.0 [1991], when the standard was still architected as a pure 16-bit character encoding, before the invention of UTF-16 and supplementary characters , U+FFFE and U+FFFF did have an unusual status. The code charts were printed omitting the last two code points altogether, and in the names list, the code points U+FFFE and U+FFFF were labeled "NOT A CHARACTER". They were also annotated with notes like, "the value FFFF is guaranteed not to be a Unicode character at all". Section 2.3, p. 14 of Unicode 1.0 contains the statement, "U+FFFE and U+FFFE are reserved and should not be transmitted or stored," so it is clear that Unicode 1.0 intended that those values would not occur in Unicode strings . The block description for the Specials Block in Unicode 1.0 contained the following information: U+FFFE. The 16-bit unsigned hexadecimal value U+FFFE is not a Unicode character value, and should be taken as a signal that Unicode characters should be byte-swapped before interpretation. U+FFFE should only be interpreted as an incorrectly byte-swapped version of U+FEFF. U+FFFF. The 16-bit unsigned hexadecimal value U+FFFF is not a Unicode character value, and can be used by an application as a [sic] error code or other non-character value. The specific interpretation of U+FFFF is not defined by the Unicode standard, so it can be viewed as a kind of private-use non-character. It should be apparent that U+FFFF in Unicode 1.0 was the prototype for what later became noncharacters in the standard—both in terms of how it was labeled and how its function was described. Unicode 2.0 [1996] formally changed the architecture of Unicode, as a result of the merger with ISO/IEC 10646-1:1993 and the introduction of UTF-16 and UTF-8 (both dating from Unicode 1.1 times [1993]). However, both Unicode 2.0 and Unicode 3.0 effectively were still 16-bit standards, because no characters had been encoded beyond the BMP , and because implementations were still mostly treating the standard as a de facto fixed-width 16-bit encoding. The conformance wording about U+FFFE and U+FFFF changed somewhat in Unicode 2.0, but these were still the only two code points with this unique status, and there were no other "noncharacters" in the standard. The code charts switched to the current convention of showing what we now know as "noncharacters" with black cells in the code charts, rather than omitting the code points altogether. The names list annotations were unchanged from Unicode 1.0, and the Specials Block description text was essentially unchanged as well. Unicode 3.0 introduced the term "noncharacter" to describe U+FFFE and U+FFFF, not as a formal definition, but simply as a subhead in the text. The Chapter 2 language in Unicode 2.0 dropped the explicit prohibition against transmission or storage of U+FFFE and U+FFFF, but instead added the language, "U+FFFF is reserved for private program use as a sentinel or other signal." That statement effectively blessed existing practice for Unicode 2.0 (and 3.0), where 16-bit implementations were taking advantage of the fact that the very last code point in the BMP was reserved and conveniently could also be interpreted as a (signed) 16-bit value of -1, to use it as a sentinel value in some string processing. Unicode 3.0 [1999] formalized the definition of "transformations", now more widely referred to as UTFs . And there was one very important addition to the text which makes it clear that U+FFFE and U+FFFF still had a special status and were not considered "valid" Unicode characters. Chapter 3, p. 46 included the language: To ensure that round-trip transcoding is possible, a UTF mapping must also map invalid Unicode scalar values to unique code value sequences. These invalid scalar values include FFFE 16 , FFFF 16 , and unpaired surrogates. That initial formulation of UTF mapping was erroneous. A lot of work was done to correct and clarify the concepts of encoding forms and UTF mapping in the versions immediately following Unicode 3.0, to correct various defects in the specification. Unicode 3.1 [2001] was the watershed for the development of noncharacters in the standard. Unicode 3.1 was the first version to add supplementary characters to the standard. As a result, it also had to come to grips with the fact the ISO/IEC 10646-2:2001 had reserved the last two code points for every plane as "not a character", despite the fact that their code point values shared nothing with the rationale for reserving U+FFFE and U+FFFF when the entire codespace was just 16 bits. The Unicode 3.1 text formally defined noncharacters, and also designated the code point range U+FDD0..U+FDEF as noncharacters, resulting in the 66 noncharacters defined in the standard. Unicode 4.0 [2003] finally corrected the statement about mapping noncharacters and surrogate code points : To ensure that the mapping for a Unicode encoding form is one-to-one, all Unicode scalar values, including those corresponding to noncharacter code points and unassigned code points , must be mapped to unique code unit sequences. Note that this requirement does not extend to high-surrogate and low-surrogate code points , which are excluded by definition from the set of Unicode scalar values. That correction results in the current situation for Unicode, where noncharacters are valid Unicode scalar values, are valid in Unicode strings, and must be mapped through UTFs, whereas surrogate code points are not valid Unicode scalar values, are not valid in UTFs, and cannot be mapped through UTFs. Unicode 4.0 also added an entire new informative section about noncharacters, which recommended the use of U+FFFF and U+10FFFF "for internal purposes as sentinels." That new text also stated that "[noncharacters] are forbidden for use in open interchange of Unicode text data," a claim which was stronger than the formal definition. And it made a contrast between noncharacters and "valid character value[s]", implying that noncharacters were not valid. Of course, noncharacters could not be interpreted in open interchange, but the text in this section had not really caught up with the implications of the change of wording in the conformance requirements for UTFs. The text still echoed the sense of "invalid" associated with noncharacters in Unicode 3.0. Because of this complicated history and confusing changes of wording in the standard over the years regarding what are now known as noncharacters, there is still considerable disagreement about their use and whether they should be considered "illegal" or "invalid" in various contexts. Particularly for implementations prior to Unicode 3.1, it should not be surprising to find legacy behavior treating U+FFFE and U+FFFF as invalid in Unicode 16-bit strings. And U+FFFF and U+10FFFF are, indeed, known to be used in various implementations as sentinels. For example, the value FFFF is used for WEOF in Windows implementations. | 2026-01-13T09:30:24 |
http://hackage.haskell.org/package/semigroupoids-4.2/docs/src/Data-Semigroupoid-Product.html#Product | src/Data/Semigroupoid/Product.hs {-# LANGUAGE GADTs #-} module Data . Semigroupoid . Product ( Product ( .. ) , distributeDualProduct , factorDualProduct ) where import Data . Semigroupoid import Data . Semigroupoid . Dual import Data . Groupoid data Product j k a b where Pair :: j a b -> k a' b' -> Product j k ( a , a' ) ( b , b' ) instance ( Semigroupoid j , Semigroupoid k ) => Semigroupoid ( Product j k ) where Pair w x `o` Pair y z = Pair ( w `o` y ) ( x `o` z ) instance ( Groupoid j , Groupoid k ) => Groupoid ( Product j k ) where inv ( Pair w x ) = Pair ( inv w ) ( inv x ) distributeDualProduct :: Dual ( Product j k ) a b -> Product ( Dual j ) ( Dual k ) a b distributeDualProduct ( Dual ( Pair l r ) ) = Pair ( Dual l ) ( Dual r ) factorDualProduct :: Product ( Dual j ) ( Dual k ) a b -> Dual ( Product j k ) a b factorDualProduct ( Pair ( Dual l ) ( Dual r ) ) = Dual ( Pair l r ) | 2026-01-13T09:30:24 |
https://github.com/rubymorillo | rubymorillo (Stephanie Morillo) · GitHub Skip to content Navigation Menu Toggle navigation Sign in Appearance settings Platform AI CODE CREATION GitHub Copilot Write better code with AI GitHub Spark Build and deploy intelligent apps GitHub Models Manage and compare prompts MCP Registry New Integrate external tools DEVELOPER WORKFLOWS Actions Automate any workflow Codespaces Instant dev environments Issues Plan and track work Code Review Manage code changes APPLICATION SECURITY GitHub Advanced Security Find and fix vulnerabilities Code security Secure your code as you build Secret protection Stop leaks before they start EXPLORE Why GitHub Documentation Blog Changelog Marketplace View all features Solutions BY COMPANY SIZE Enterprises Small and medium teams Startups Nonprofits BY USE CASE App Modernization DevSecOps DevOps CI/CD View all use cases BY INDUSTRY Healthcare Financial services Manufacturing Government View all industries View all solutions Resources EXPLORE BY TOPIC AI Software Development DevOps Security View all topics EXPLORE BY TYPE Customer stories Events & webinars Ebooks & reports Business insights GitHub Skills SUPPORT & SERVICES Documentation Customer support Community forum Trust center Partners Open Source COMMUNITY GitHub Sponsors Fund open source developers PROGRAMS Security Lab Maintainer Community Accelerator Archive Program REPOSITORIES Topics Trending Collections Enterprise ENTERPRISE SOLUTIONS Enterprise platform AI-powered developer platform AVAILABLE ADD-ONS GitHub Advanced Security Enterprise-grade security features Copilot for Business Enterprise-grade AI features Premium Support Enterprise-grade 24/7 support Pricing Search or jump to... Search code, repositories, users, issues, pull requests... --> Search Clear Search syntax tips Provide feedback --> We read every piece of feedback, and take your input very seriously. Include my email address so I can be contacted Cancel Submit feedback Saved searches Use saved searches to filter your results more quickly --> Name Query To see all available qualifiers, see our documentation . Cancel Create saved search Sign in Sign up Appearance settings Resetting focus You signed in with another tab or window. Reload to refresh your session. You signed out in another tab or window. Reload to refresh your session. You switched accounts on another tab or window. Reload to refresh your session. Dismiss alert {{ message }} rubymorillo Follow Overview Repositories 8 Projects 0 Packages 0 Stars 11 Sponsoring 0 More Overview Repositories Projects Packages Stars Sponsoring rubymorillo Follow 😃 Stephanie Morillo rubymorillo 😃 Follow Principal Product Manager & Content Strategist who helps developers become better content creators & DevRel teams build robust content programs. 429 followers · 13 following stephaniemorillo.co/links X @radiomorillo Achievements x3 x3 Achievements x3 x3 Block or Report Block or report rubymorillo --> Block user Prevent this user from interacting with your repositories and sending you notifications. Learn more about blocking users . You must be logged in to block users. Add an optional note Maximum 250 characters. Please don't include any personal information such as legal names or email addresses. Markdown supported. This note will be visible to only you. Block user Report abuse Contact GitHub support about this user’s behavior. Learn more about reporting abuse . Report abuse Overview Repositories 8 Projects 0 Packages 0 Stars 11 Sponsoring 0 More Overview Repositories Projects Packages Stars Sponsoring rubymorillo / README .md Hola, I'm Stephanie👋🏽 I'm a Principal PM, Content Strategist, and author. I want to help developers become better content creators and marketers, and I like sharing what I know with the wider developer community. I publish: 📝 Original blog posts full of developer content tips I also publish resource lists called "Pocket Lists" here on GitHub: 📌 The Pocket UX List 📌 The Pocket Data 101 List 📌 The Pocket Scrum Self-Study Guide 📌 The Pocket Technical Writing List 📌 The Pocket Writer Job Board List 🆕 The Pocket Marketing Tech List What I'm Working on Now I delivered a talk called "Marketing Tactics for Software Developers" full of info and tips, which you can watch exclusively on egghead.io. Pinned Loading pocket-ux-list pocket-ux-list Public A small, but formidable, list of UX-related resources for people interested in learning more about UX concepts. 102 9 pocket-data-101-list pocket-data-101-list Public A small, but formidable, list of free learning resources for anyone interested in learning more about SQL, Excel, and data analytics. 42 5 pocket-scrum-self-study-list pocket-scrum-self-study-list Public A small but formidable list of resources to prep for the Professional Scrum Master I certification 35 2 pocket-tech-writing-list pocket-tech-writing-list Public A small but formidable list of technical writing resources for developers 704 54 pocket-writer-job-boards-list pocket-writer-job-boards-list Public A small but formidable list of places where writers can find jobs and career-related resources 15 2 pocket-marketing-tech-list pocket-marketing-tech-list Public A small but formidable list of marketing tools for developers driving their own digital marketing efforts 161 9 Something went wrong, please refresh the page to try again. If the problem persists, check the GitHub status page or contact support . Uh oh! There was an error while loading. Please reload this page . Footer © 2026 GitHub, Inc. Footer navigation Terms Privacy Security Status Community Docs Contact Manage cookies Do not share my personal information You can’t perform that action at this time. | 2026-01-13T09:30:24 |
https://github.com/rack/rack-test | GitHub - rack/rack-test: Rack::Test is a small, simple testing API for Rack apps. Skip to content Navigation Menu Toggle navigation Sign in Appearance settings Platform AI CODE CREATION GitHub Copilot Write better code with AI GitHub Spark Build and deploy intelligent apps GitHub Models Manage and compare prompts MCP Registry New Integrate external tools DEVELOPER WORKFLOWS Actions Automate any workflow Codespaces Instant dev environments Issues Plan and track work Code Review Manage code changes APPLICATION SECURITY GitHub Advanced Security Find and fix vulnerabilities Code security Secure your code as you build Secret protection Stop leaks before they start EXPLORE Why GitHub Documentation Blog Changelog Marketplace View all features Solutions BY COMPANY SIZE Enterprises Small and medium teams Startups Nonprofits BY USE CASE App Modernization DevSecOps DevOps CI/CD View all use cases BY INDUSTRY Healthcare Financial services Manufacturing Government View all industries View all solutions Resources EXPLORE BY TOPIC AI Software Development DevOps Security View all topics EXPLORE BY TYPE Customer stories Events & webinars Ebooks & reports Business insights GitHub Skills SUPPORT & SERVICES Documentation Customer support Community forum Trust center Partners Open Source COMMUNITY GitHub Sponsors Fund open source developers PROGRAMS Security Lab Maintainer Community Accelerator Archive Program REPOSITORIES Topics Trending Collections Enterprise ENTERPRISE SOLUTIONS Enterprise platform AI-powered developer platform AVAILABLE ADD-ONS GitHub Advanced Security Enterprise-grade security features Copilot for Business Enterprise-grade AI features Premium Support Enterprise-grade 24/7 support Pricing Search or jump to... Search code, repositories, users, issues, pull requests... --> Search Clear Search syntax tips Provide feedback --> We read every piece of feedback, and take your input very seriously. Include my email address so I can be contacted Cancel Submit feedback Saved searches Use saved searches to filter your results more quickly --> Name Query To see all available qualifiers, see our documentation . Cancel Create saved search Sign in Sign up Appearance settings Resetting focus You signed in with another tab or window. Reload to refresh your session. You signed out in another tab or window. Reload to refresh your session. You switched accounts on another tab or window. Reload to refresh your session. Dismiss alert {{ message }} rack / rack-test Public Notifications You must be signed in to change notification settings Fork 243 Star 938 Rack::Test is a small, simple testing API for Rack apps. License MIT license 938 stars 243 forks Branches Tags Activity Star Notifications You must be signed in to change notification settings Code Issues 0 Pull requests 1 Discussions Actions Security Uh oh! There was an error while loading. Please reload this page . Insights Additional navigation options Code Issues Pull requests Discussions Actions Security Insights rack/rack-test main Branches Tags Go to file Code Open more actions menu Folders and files Name Name Last commit message Last commit date Latest commit History 550 Commits .github/ workflows .github/ workflows lib/ rack lib/ rack spec spec .document .document .gitignore .gitignore Gemfile Gemfile Gemfile.rack-1.x Gemfile.rack-1.x History.md History.md MIT-LICENSE.txt MIT-LICENSE.txt README.md README.md Rakefile Rakefile rack-test.gemspec rack-test.gemspec View all files Repository files navigation README MIT license Rack::Test Code: https://github.com/rack/rack-test Description Rack::Test is a small, simple testing API for Rack apps. It can be used on its own or as a reusable starting point for Web frameworks and testing libraries to build on. Features Allows for submitting requests and testing responses Maintains a cookie jar across requests Supports request headers used for subsequent requests Follow redirects when requested Examples These examples use test/unit but it's equally possible to use rack-test with other testing frameworks such as minitest or rspec . require "test/unit" require "rack/test" require "json" class HomepageTest < Test :: Unit :: TestCase include Rack :: Test :: Methods def app lambda { | env | [ 200 , { 'content-type' => 'text/plain' } , [ 'All responses are OK' ] ] } end def test_response_is_ok # Optionally set headers used for all requests in this spec: #header 'accept-charset', 'utf-8' # First argument is treated as the path get '/' assert last_response . ok? assert_equal 'All responses are OK' , last_response . body end def delete_with_url_params_and_body # First argument can have a query string # # Second argument is used as the parameters for the request, which will be # included in the request body for non-GET requests. delete '/?foo=bar' , JSON . generate ( 'baz' => 'zot' ) end def post_with_json # Third argument is the rack environment to use for the request. The following # entries in the submitted rack environment are treated specially (in addition # to options supported by `Rack::MockRequest#env_for`: # # :cookie : Set a cookie for the current session before submitting the request. # # :query_params : Set parameters for the query string (as opposed to the body). # Value should be a hash of parameters. # # :xhr : Set HTTP_X_REQUESTED_WITH env key to XMLHttpRequest. post ( uri , JSON . generate ( 'baz' => 'zot' ) , 'CONTENT_TYPE' => 'application/json' ) end end rack-test will test the app returned by the app method. If you are loading middleware in a config.ru file, and want to test that, you should load the Rack app created from the config.ru file: OUTER_APP = Rack :: Builder . parse_file ( "config.ru" ) . first class TestApp < Test :: Unit :: TestCase include Rack :: Test :: Methods def app OUTER_APP end def test_root get "/" assert last_response . ok? end end If your application does not automatically use the Rack::Lint middleware in test mode, and you want to test that requests to and responses from your application are compliant with the Rack specification, you should manually use the Rack::Lint middleware: class TestApp < Test :: Unit :: TestCase include Rack :: Test :: Methods APP = Rack :: Lint . new ( YOUR_APP ) def app APP end end Install To install the latest release as a gem: gem install rack-test Or add to your Gemfile : gem 'rack-test' Contribution Contributions are welcome. Please make sure to: Use a regular forking workflow Write tests for the new or changed behaviour Provide an explanation/motivation in your commit message / PR message Ensure History.md is updated Authors Contributions from Bryan Helmkamp, Jeremy Evans, Simon Rozet, and others Much of the original code was extracted from Merb 1.0's request helper License rack-test is released under the MIT License . Supported platforms Ruby 2.0+ JRuby 9.1+ Releasing Bump VERSION in lib/rack/test/version.rb Ensure History.md is up-to-date, including correct version and date git commit . -m 'Release $VERSION' git push git tag -a -m 'Tag the $VERSION release' $VERSION git push --tags gem build rack-test.gemspec gem push rack-test-$VERSION.gem Add a discussion post for the release About Rack::Test is a small, simple testing API for Rack apps. Topics ruby testing Resources Readme License MIT license Uh oh! There was an error while loading. Please reload this page . Activity Custom properties Stars 938 stars Watchers 26 watching Forks 243 forks Report repository Uh oh! There was an error while loading. Please reload this page . Contributors 79 Uh oh! There was an error while loading. Please reload this page . + 65 contributors Languages Ruby 99.9% Logos 0.1% Footer © 2026 GitHub, Inc. Footer navigation Terms Privacy Security Status Community Docs Contact Manage cookies Do not share my personal information You can’t perform that action at this time. | 2026-01-13T09:30:24 |
http://hackage.haskell.org/package/semigroupoids-4.2/docs/src/Data-Semifunctor-Braided.html#Braided | src/Data/Semifunctor/Braided.hs {-# LANGUAGE GADTs #-} {-# LANGUAGE MultiParamTypeClasses #-} {-# LANGUAGE FlexibleContexts #-} {-# LANGUAGE FlexibleInstances #-} {-# LANGUAGE CPP #-} #if defined(__GLASGOW_HASKELL__) && __GLASGOW_HASKELL__ >= 702 #ifdef MIN_VERSION_comonad #if MIN_VERSION_comonad(3,0,3) {-# LANGUAGE Safe #-} #else {-# LANGUAGE Trustworthy #-} #endif #else {-# LANGUAGE Trustworthy #-} #endif #endif ----------------------------------------------------------------------------- -- | -- Module : Data.Semifunctor.Braided -- Copyright : (C) 2011-2012 Edward Kmett, -- License : BSD-style (see the file LICENSE) -- -- Maintainer : Edward Kmett <ekmett@gmail.com> -- Stability : experimental -- Portability : MPTCs, GADTs -- ---------------------------------------------------------------------------- module Data . Semifunctor . Braided ( Braided ( .. ) , kleisliBraid #ifdef MIN_VERSION_comonad , cokleisliBraid #endif , Symmetric , swap ) where import Prelude hiding ( ( . ) , id ) import Control . Arrow import Data . Functor . Bind import Data . Semifunctor import Data . Semifunctor . Associative -- import Data.Semigroupoid.Dual #ifdef MIN_VERSION_comonad import Control . Comonad import Data . Functor . Extend #endif class Associative k p => Braided k p where braid :: k ( p ( a , b ) ) ( p ( b , a ) ) -- instance Braided k p => Braided (Dual k) p where braid = Dual braid instance Braided ( -> ) ( Bi Either ) where braid ( Bi ( Left a ) ) = Bi ( Right a ) braid ( Bi ( Right a ) ) = Bi ( Left a ) instance Braided ( -> ) ( Bi (,) ) where braid ( Bi ( a , b ) ) = Bi ( b , a ) kleisliBraid :: ( Monad m , Semifunctor p ( Product ( Kleisli m ) ( Kleisli m ) ) ( Kleisli m ) , Braided ( -> ) p ) => Kleisli m ( p ( a , b ) ) ( p ( b , a ) ) kleisliBraid = Kleisli ( return . braid ) instance ( Bind m , Monad m ) => Braided ( Kleisli m ) ( Bi Either ) where braid = kleisliBraid instance ( Bind m , Monad m ) => Braided ( Kleisli m ) ( Bi (,) ) where braid = kleisliBraid #ifdef MIN_VERSION_comonad cokleisliBraid :: ( Extend w , Comonad w , Semifunctor p ( Product ( Cokleisli w ) ( Cokleisli w ) ) ( Cokleisli w ) , Braided ( -> ) p ) => Cokleisli w ( p ( a , b ) ) ( p ( b , a ) ) cokleisliBraid = Cokleisli ( braid . extract ) instance ( Extend w , Comonad w ) => Braided ( Cokleisli w ) ( Bi (,) ) where braid = cokleisliBraid -- instance Comonad w => Braided (Cokleisli w) (Bi Either) where braid = cokleisliBraid #endif class Braided k p => Symmetric k p instance Symmetric ( -> ) ( Bi Either ) instance Symmetric ( -> ) ( Bi (,) ) instance ( Bind m , Monad m ) => Symmetric ( Kleisli m ) ( Bi Either ) instance ( Bind m , Monad m ) => Symmetric ( Kleisli m ) ( Bi (,) ) #ifdef MIN_VERSION_comonad instance ( Extend w , Comonad w ) => Symmetric ( Cokleisli w ) ( Bi (,) ) -- instance Comonad w => Symmetric (Cokleisli w) (Bi Either) #endif swap :: Symmetric k p => k ( p ( a , b ) ) ( p ( b , a ) ) swap = braid | 2026-01-13T09:30:24 |
http://hackage.haskell.org/package/semigroupoids-4.2/docs/src/Data-Semifunctor-Braided.html | src/Data/Semifunctor/Braided.hs {-# LANGUAGE GADTs #-} {-# LANGUAGE MultiParamTypeClasses #-} {-# LANGUAGE FlexibleContexts #-} {-# LANGUAGE FlexibleInstances #-} {-# LANGUAGE CPP #-} #if defined(__GLASGOW_HASKELL__) && __GLASGOW_HASKELL__ >= 702 #ifdef MIN_VERSION_comonad #if MIN_VERSION_comonad(3,0,3) {-# LANGUAGE Safe #-} #else {-# LANGUAGE Trustworthy #-} #endif #else {-# LANGUAGE Trustworthy #-} #endif #endif ----------------------------------------------------------------------------- -- | -- Module : Data.Semifunctor.Braided -- Copyright : (C) 2011-2012 Edward Kmett, -- License : BSD-style (see the file LICENSE) -- -- Maintainer : Edward Kmett <ekmett@gmail.com> -- Stability : experimental -- Portability : MPTCs, GADTs -- ---------------------------------------------------------------------------- module Data . Semifunctor . Braided ( Braided ( .. ) , kleisliBraid #ifdef MIN_VERSION_comonad , cokleisliBraid #endif , Symmetric , swap ) where import Prelude hiding ( ( . ) , id ) import Control . Arrow import Data . Functor . Bind import Data . Semifunctor import Data . Semifunctor . Associative -- import Data.Semigroupoid.Dual #ifdef MIN_VERSION_comonad import Control . Comonad import Data . Functor . Extend #endif class Associative k p => Braided k p where braid :: k ( p ( a , b ) ) ( p ( b , a ) ) -- instance Braided k p => Braided (Dual k) p where braid = Dual braid instance Braided ( -> ) ( Bi Either ) where braid ( Bi ( Left a ) ) = Bi ( Right a ) braid ( Bi ( Right a ) ) = Bi ( Left a ) instance Braided ( -> ) ( Bi (,) ) where braid ( Bi ( a , b ) ) = Bi ( b , a ) kleisliBraid :: ( Monad m , Semifunctor p ( Product ( Kleisli m ) ( Kleisli m ) ) ( Kleisli m ) , Braided ( -> ) p ) => Kleisli m ( p ( a , b ) ) ( p ( b , a ) ) kleisliBraid = Kleisli ( return . braid ) instance ( Bind m , Monad m ) => Braided ( Kleisli m ) ( Bi Either ) where braid = kleisliBraid instance ( Bind m , Monad m ) => Braided ( Kleisli m ) ( Bi (,) ) where braid = kleisliBraid #ifdef MIN_VERSION_comonad cokleisliBraid :: ( Extend w , Comonad w , Semifunctor p ( Product ( Cokleisli w ) ( Cokleisli w ) ) ( Cokleisli w ) , Braided ( -> ) p ) => Cokleisli w ( p ( a , b ) ) ( p ( b , a ) ) cokleisliBraid = Cokleisli ( braid . extract ) instance ( Extend w , Comonad w ) => Braided ( Cokleisli w ) ( Bi (,) ) where braid = cokleisliBraid -- instance Comonad w => Braided (Cokleisli w) (Bi Either) where braid = cokleisliBraid #endif class Braided k p => Symmetric k p instance Symmetric ( -> ) ( Bi Either ) instance Symmetric ( -> ) ( Bi (,) ) instance ( Bind m , Monad m ) => Symmetric ( Kleisli m ) ( Bi Either ) instance ( Bind m , Monad m ) => Symmetric ( Kleisli m ) ( Bi (,) ) #ifdef MIN_VERSION_comonad instance ( Extend w , Comonad w ) => Symmetric ( Cokleisli w ) ( Bi (,) ) -- instance Comonad w => Symmetric (Cokleisli w) (Bi Either) #endif swap :: Symmetric k p => k ( p ( a , b ) ) ( p ( b , a ) ) swap = braid | 2026-01-13T09:30:24 |
http://hackage.haskell.org/package/base-4.6.0.1/docs/Control-Exception.html#t:Handler | Control.Exception Source Contents Index base-4.6.0.1: Basic libraries Portability non-portable (extended exceptions) Stability experimental Maintainer libraries@haskell.org Safe Haskell Trustworthy Control.Exception Contents The Exception type Throwing exceptions Catching Exceptions Catching all exceptions The catch functions The handle functions The try functions The evaluate function The mapException function Asynchronous Exceptions Asynchronous exception control (deprecated) Asynchronous exception control Applying mask to an exception handler Interruptible operations Assertions Utilities Description This module provides support for raising and catching both built-in and user-defined exceptions. In addition to exceptions thrown by IO operations, exceptions may be thrown by pure code (imprecise exceptions) or by external events (asynchronous exceptions), but may only be caught in the IO monad. For more details, see: A semantics for imprecise exceptions , by Simon Peyton Jones, Alastair Reid, Tony Hoare, Simon Marlow, Fergus Henderson, in PLDI'99 . Asynchronous exceptions in Haskell , by Simon Marlow, Simon Peyton Jones, Andy Moran and John Reppy, in PLDI'01 . An Extensible Dynamically-Typed Hierarchy of Exceptions , by Simon Marlow, in Haskell '06 . Synopsis data SomeException = forall e . Exception e => SomeException e class ( Typeable e, Show e) => Exception e where toException :: e -> SomeException fromException :: SomeException -> Maybe e data IOException data ArithException = Overflow | Underflow | LossOfPrecision | DivideByZero | Denormal | RatioZeroDenominator data ArrayException = IndexOutOfBounds String | UndefinedElement String data AssertionFailed = AssertionFailed String data AsyncException = StackOverflow | HeapOverflow | ThreadKilled | UserInterrupt data NonTermination = NonTermination data NestedAtomically = NestedAtomically data BlockedIndefinitelyOnMVar = BlockedIndefinitelyOnMVar data BlockedIndefinitelyOnSTM = BlockedIndefinitelyOnSTM data Deadlock = Deadlock data NoMethodError = NoMethodError String data PatternMatchFail = PatternMatchFail String data RecConError = RecConError String data RecSelError = RecSelError String data RecUpdError = RecUpdError String data ErrorCall = ErrorCall String throw :: Exception e => e -> a throwIO :: Exception e => e -> IO a ioError :: IOError -> IO a throwTo :: Exception e => ThreadId -> e -> IO () catch :: Exception e => IO a -> (e -> IO a) -> IO a catches :: IO a -> [ Handler a] -> IO a data Handler a = forall e . Exception e => Handler (e -> IO a) catchJust :: Exception e => (e -> Maybe b) -> IO a -> (b -> IO a) -> IO a handle :: Exception e => (e -> IO a) -> IO a -> IO a handleJust :: Exception e => (e -> Maybe b) -> (b -> IO a) -> IO a -> IO a try :: Exception e => IO a -> IO ( Either e a) tryJust :: Exception e => (e -> Maybe b) -> IO a -> IO ( Either b a) evaluate :: a -> IO a mapException :: ( Exception e1, Exception e2) => (e1 -> e2) -> a -> a mask :: (( forall a. IO a -> IO a) -> IO b) -> IO b mask_ :: IO a -> IO a uninterruptibleMask :: (( forall a. IO a -> IO a) -> IO b) -> IO b uninterruptibleMask_ :: IO a -> IO a data MaskingState = Unmasked | MaskedInterruptible | MaskedUninterruptible getMaskingState :: IO MaskingState allowInterrupt :: IO () block :: IO a -> IO a unblock :: IO a -> IO a blocked :: IO Bool assert :: Bool -> a -> a bracket :: IO a -> (a -> IO b) -> (a -> IO c) -> IO c bracket_ :: IO a -> IO b -> IO c -> IO c bracketOnError :: IO a -> (a -> IO b) -> (a -> IO c) -> IO c finally :: IO a -> IO b -> IO a onException :: IO a -> IO b -> IO a The Exception type data SomeException Source The SomeException type is the root of the exception type hierarchy. When an exception of type e is thrown, behind the scenes it is encapsulated in a SomeException . Constructors forall e . Exception e => SomeException e Instances Show SomeException Typeable SomeException Exception SomeException class ( Typeable e, Show e) => Exception e where Source Any type that you wish to throw or catch as an exception must be an instance of the Exception class. The simplest case is a new exception type directly below the root: data MyException = ThisException | ThatException deriving (Show, Typeable) instance Exception MyException The default method definitions in the Exception class do what we need in this case. You can now throw and catch ThisException and ThatException as exceptions: *Main> throw ThisException `catch` \e -> putStrLn ("Caught " ++ show (e :: MyException)) Caught ThisException In more complicated examples, you may wish to define a whole hierarchy of exceptions: --------------------------------------------------------------------- -- Make the root exception type for all the exceptions in a compiler data SomeCompilerException = forall e . Exception e => SomeCompilerException e deriving Typeable instance Show SomeCompilerException where show (SomeCompilerException e) = show e instance Exception SomeCompilerException compilerExceptionToException :: Exception e => e -> SomeException compilerExceptionToException = toException . SomeCompilerException compilerExceptionFromException :: Exception e => SomeException -> Maybe e compilerExceptionFromException x = do SomeCompilerException a <- fromException x cast a --------------------------------------------------------------------- -- Make a subhierarchy for exceptions in the frontend of the compiler data SomeFrontendException = forall e . Exception e => SomeFrontendException e deriving Typeable instance Show SomeFrontendException where show (SomeFrontendException e) = show e instance Exception SomeFrontendException where toException = compilerExceptionToException fromException = compilerExceptionFromException frontendExceptionToException :: Exception e => e -> SomeException frontendExceptionToException = toException . SomeFrontendException frontendExceptionFromException :: Exception e => SomeException -> Maybe e frontendExceptionFromException x = do SomeFrontendException a <- fromException x cast a --------------------------------------------------------------------- -- Make an exception type for a particular frontend compiler exception data MismatchedParentheses = MismatchedParentheses deriving (Typeable, Show) instance Exception MismatchedParentheses where toException = frontendExceptionToException fromException = frontendExceptionFromException We can now catch a MismatchedParentheses exception as MismatchedParentheses , SomeFrontendException or SomeCompilerException , but not other types, e.g. IOException : *Main> throw MismatchedParentheses catch e -> putStrLn ("Caught " ++ show (e :: MismatchedParentheses)) Caught MismatchedParentheses *Main> throw MismatchedParentheses catch e -> putStrLn ("Caught " ++ show (e :: SomeFrontendException)) Caught MismatchedParentheses *Main> throw MismatchedParentheses catch e -> putStrLn ("Caught " ++ show (e :: SomeCompilerException)) Caught MismatchedParentheses *Main> throw MismatchedParentheses catch e -> putStrLn ("Caught " ++ show (e :: IOException)) *** Exception: MismatchedParentheses Methods toException :: e -> SomeException Source fromException :: SomeException -> Maybe e Source Instances Exception ArithException Exception ErrorCall Exception SomeException Exception IOException Exception Dynamic Exception ExitCode Exception ArrayException Exception AsyncException Exception AssertionFailed Exception Deadlock Exception BlockedIndefinitelyOnSTM Exception BlockedIndefinitelyOnMVar Exception NestedAtomically Exception NonTermination Exception NoMethodError Exception RecUpdError Exception RecConError Exception RecSelError Exception PatternMatchFail data IOException Source Exceptions that occur in the IO monad. An IOException records a more specific error type, a descriptive string and maybe the handle that was used when the error was flagged. Instances Eq IOException Show IOException Typeable IOException Exception IOException data ArithException Source Arithmetic exceptions. Constructors Overflow Underflow LossOfPrecision DivideByZero Denormal RatioZeroDenominator Instances Eq ArithException Ord ArithException Show ArithException Typeable ArithException Exception ArithException data ArrayException Source Exceptions generated by array operations Constructors IndexOutOfBounds String An attempt was made to index an array outside its declared bounds. UndefinedElement String An attempt was made to evaluate an element of an array that had not been initialized. Instances Eq ArrayException Ord ArrayException Show ArrayException Typeable ArrayException Exception ArrayException data AssertionFailed Source assert was applied to False . Constructors AssertionFailed String Instances Show AssertionFailed Typeable AssertionFailed Exception AssertionFailed data AsyncException Source Asynchronous exceptions. Constructors StackOverflow The current thread's stack exceeded its limit. Since an exception has been raised, the thread's stack will certainly be below its limit again, but the programmer should take remedial action immediately. HeapOverflow The program's heap is reaching its limit, and the program should take action to reduce the amount of live data it has. Notes: It is undefined which thread receives this exception. GHC currently does not throw HeapOverflow exceptions. ThreadKilled This exception is raised by another thread calling killThread , or by the system if it needs to terminate the thread for some reason. UserInterrupt This exception is raised by default in the main thread of the program when the user requests to terminate the program via the usual mechanism(s) (e.g. Control-C in the console). Instances Eq AsyncException Ord AsyncException Show AsyncException Typeable AsyncException Exception AsyncException data NonTermination Source Thrown when the runtime system detects that the computation is guaranteed not to terminate. Note that there is no guarantee that the runtime system will notice whether any given computation is guaranteed to terminate or not. Constructors NonTermination Instances Show NonTermination Typeable NonTermination Exception NonTermination data NestedAtomically Source Thrown when the program attempts to call atomically , from the stm package, inside another call to atomically . Constructors NestedAtomically Instances Show NestedAtomically Typeable NestedAtomically Exception NestedAtomically data BlockedIndefinitelyOnMVar Source The thread is blocked on an MVar , but there are no other references to the MVar so it can't ever continue. Constructors BlockedIndefinitelyOnMVar Instances Show BlockedIndefinitelyOnMVar Typeable BlockedIndefinitelyOnMVar Exception BlockedIndefinitelyOnMVar data BlockedIndefinitelyOnSTM Source The thread is waiting to retry an STM transaction, but there are no other references to any TVar s involved, so it can't ever continue. Constructors BlockedIndefinitelyOnSTM Instances Show BlockedIndefinitelyOnSTM Typeable BlockedIndefinitelyOnSTM Exception BlockedIndefinitelyOnSTM data Deadlock Source There are no runnable threads, so the program is deadlocked. The Deadlock exception is raised in the main thread only. Constructors Deadlock Instances Show Deadlock Typeable Deadlock Exception Deadlock data NoMethodError Source A class method without a definition (neither a default definition, nor a definition in the appropriate instance) was called. The String gives information about which method it was. Constructors NoMethodError String Instances Show NoMethodError Typeable NoMethodError Exception NoMethodError data PatternMatchFail Source A pattern match failed. The String gives information about the source location of the pattern. Constructors PatternMatchFail String Instances Show PatternMatchFail Typeable PatternMatchFail Exception PatternMatchFail data RecConError Source An uninitialised record field was used. The String gives information about the source location where the record was constructed. Constructors RecConError String Instances Show RecConError Typeable RecConError Exception RecConError data RecSelError Source A record selector was applied to a constructor without the appropriate field. This can only happen with a datatype with multiple constructors, where some fields are in one constructor but not another. The String gives information about the source location of the record selector. Constructors RecSelError String Instances Show RecSelError Typeable RecSelError Exception RecSelError data RecUpdError Source A record update was performed on a constructor without the appropriate field. This can only happen with a datatype with multiple constructors, where some fields are in one constructor but not another. The String gives information about the source location of the record update. Constructors RecUpdError String Instances Show RecUpdError Typeable RecUpdError Exception RecUpdError data ErrorCall Source This is thrown when the user calls error . The String is the argument given to error . Constructors ErrorCall String Instances Show ErrorCall Typeable ErrorCall Exception ErrorCall Throwing exceptions throw :: Exception e => e -> a Source Throw an exception. Exceptions may be thrown from purely functional code, but may only be caught within the IO monad. throwIO :: Exception e => e -> IO a Source A variant of throw that can only be used within the IO monad. Although throwIO has a type that is an instance of the type of throw , the two functions are subtly different: throw e `seq` x ===> throw e throwIO e `seq` x ===> x The first example will cause the exception e to be raised, whereas the second one won't. In fact, throwIO will only cause an exception to be raised when it is used within the IO monad. The throwIO variant should be used in preference to throw to raise an exception within the IO monad because it guarantees ordering with respect to other IO operations, whereas throw does not. ioError :: IOError -> IO a Source Raise an IOError in the IO monad. throwTo :: Exception e => ThreadId -> e -> IO () Source throwTo raises an arbitrary exception in the target thread (GHC only). throwTo does not return until the exception has been raised in the target thread. The calling thread can thus be certain that the target thread has received the exception. This is a useful property to know when dealing with race conditions: eg. if there are two threads that can kill each other, it is guaranteed that only one of the threads will get to kill the other. Whatever work the target thread was doing when the exception was raised is not lost: the computation is suspended until required by another thread. If the target thread is currently making a foreign call, then the exception will not be raised (and hence throwTo will not return) until the call has completed. This is the case regardless of whether the call is inside a mask or not. However, in GHC a foreign call can be annotated as interruptible , in which case a throwTo will cause the RTS to attempt to cause the call to return; see the GHC documentation for more details. Important note: the behaviour of throwTo differs from that described in the paper "Asynchronous exceptions in Haskell" ( http://research.microsoft.com/~simonpj/Papers/asynch-exns.htm ). In the paper, throwTo is non-blocking; but the library implementation adopts a more synchronous design in which throwTo does not return until the exception is received by the target thread. The trade-off is discussed in Section 9 of the paper. Like any blocking operation, throwTo is therefore interruptible (see Section 5.3 of the paper). Unlike other interruptible operations, however, throwTo is always interruptible, even if it does not actually block. There is no guarantee that the exception will be delivered promptly, although the runtime will endeavour to ensure that arbitrary delays don't occur. In GHC, an exception can only be raised when a thread reaches a safe point , where a safe point is where memory allocation occurs. Some loops do not perform any memory allocation inside the loop and therefore cannot be interrupted by a throwTo . If the target of throwTo is the calling thread, then the behaviour is the same as throwIO , except that the exception is thrown as an asynchronous exception. This means that if there is an enclosing pure computation, which would be the case if the current IO operation is inside unsafePerformIO or unsafeInterleaveIO , that computation is not permanently replaced by the exception, but is suspended as if it had received an asynchronous exception. Note that if throwTo is called with the current thread as the target, the exception will be thrown even if the thread is currently inside mask or uninterruptibleMask . Catching Exceptions There are several functions for catching and examining exceptions; all of them may only be used from within the IO monad. Here's a rule of thumb for deciding which catch-style function to use: If you want to do some cleanup in the event that an exception is raised, use finally , bracket or onException . To recover after an exception and do something else, the best choice is to use one of the try family. ... unless you are recovering from an asynchronous exception, in which case use catch or catchJust . The difference between using try and catch for recovery is that in catch the handler is inside an implicit block (see "Asynchronous Exceptions") which is important when catching asynchronous exceptions, but when catching other kinds of exception it is unnecessary. Furthermore it is possible to accidentally stay inside the implicit block by tail-calling rather than returning from the handler, which is why we recommend using try rather than catch for ordinary exception recovery. A typical use of tryJust for recovery looks like this: do r <- tryJust (guard . isDoesNotExistError) $ getEnv "HOME" case r of Left e -> ... Right home -> ... Catching all exceptions It is possible to catch all exceptions, by using the type SomeException : catch f (\e -> ... (e :: SomeException) ...) HOWEVER, this is normally not what you want to do! For example, suppose you want to read a file, but if it doesn't exist then continue as if it contained "". You might be tempted to just catch all exceptions and return "" in the handler. However, this has all sorts of undesirable consequences. For example, if the user presses control-C at just the right moment then the UserInterrupt exception will be caught, and the program will continue running under the belief that the file contains "". Similarly, if another thread tries to kill the thread reading the file then the ThreadKilled exception will be ignored. Instead, you should only catch exactly the exceptions that you really want. In this case, this would likely be more specific than even "any IO exception"; a permissions error would likely also want to be handled differently. Instead, you would probably want something like: e <- tryJust (guard . isDoesNotExistError) (readFile f) let str = either (const "") id e There are occassions when you really do need to catch any sort of exception. However, in most cases this is just so you can do some cleaning up; you aren't actually interested in the exception itself. For example, if you open a file then you want to close it again, whether processing the file executes normally or throws an exception. However, in these cases you can use functions like bracket , finally and onException , which never actually pass you the exception, but just call the cleanup functions at the appropriate points. But sometimes you really do need to catch any exception, and actually see what the exception is. One example is at the very top-level of a program, you may wish to catch any exception, print it to a logfile or the screen, and then exit gracefully. For these cases, you can use catch (or one of the other exception-catching functions) with the SomeException type. The catch functions catch Source Arguments :: Exception e => IO a The computation to run -> (e -> IO a) Handler to invoke if an exception is raised -> IO a This is the simplest of the exception-catching functions. It takes a single argument, runs it, and if an exception is raised the "handler" is executed, with the value of the exception passed as an argument. Otherwise, the result is returned as normal. For example: catch (readFile f) (\e -> do let err = show (e :: IOException) hPutStr stderr ("Warning: Couldn't open " ++ f ++ ": " ++ err) return "") Note that we have to give a type signature to e , or the program will not typecheck as the type is ambiguous. While it is possible to catch exceptions of any type, see the section "Catching all exceptions" (in Control.Exception ) for an explanation of the problems with doing so. For catching exceptions in pure (non- IO ) expressions, see the function evaluate . Note that due to Haskell's unspecified evaluation order, an expression may throw one of several possible exceptions: consider the expression (error "urk") + (1 `div` 0) . Does the expression throw ErrorCall "urk" , or DivideByZero ? The answer is "it might throw either"; the choice is non-deterministic. If you are catching any type of exception then you might catch either. If you are calling catch with type IO Int -> (ArithException -> IO Int) -> IO Int then the handler may get run with DivideByZero as an argument, or an ErrorCall "urk" exception may be propogated further up. If you call it again, you might get a the opposite behaviour. This is ok, because catch is an IO computation. catches :: IO a -> [ Handler a] -> IO a Source Sometimes you want to catch two different sorts of exception. You could do something like f = expr `catch` \ (ex :: ArithException) -> handleArith ex `catch` \ (ex :: IOException) -> handleIO ex However, there are a couple of problems with this approach. The first is that having two exception handlers is inefficient. However, the more serious issue is that the second exception handler will catch exceptions in the first, e.g. in the example above, if handleArith throws an IOException then the second exception handler will catch it. Instead, we provide a function catches , which would be used thus: f = expr `catches` [Handler (\ (ex :: ArithException) -> handleArith ex), Handler (\ (ex :: IOException) -> handleIO ex)] data Handler a Source You need this when using catches . Constructors forall e . Exception e => Handler (e -> IO a) Instances Functor Handler catchJust Source Arguments :: Exception e => (e -> Maybe b) Predicate to select exceptions -> IO a Computation to run -> (b -> IO a) Handler -> IO a The function catchJust is like catch , but it takes an extra argument which is an exception predicate , a function which selects which type of exceptions we're interested in. catchJust (\e -> if isDoesNotExistErrorType (ioeGetErrorType e) then Just () else Nothing) (readFile f) (\_ -> do hPutStrLn stderr ("No such file: " ++ show f) return "") Any other exceptions which are not matched by the predicate are re-raised, and may be caught by an enclosing catch , catchJust , etc. The handle functions handle :: Exception e => (e -> IO a) -> IO a -> IO a Source A version of catch with the arguments swapped around; useful in situations where the code for the handler is shorter. For example: do handle (\NonTermination -> exitWith (ExitFailure 1)) $ ... handleJust :: Exception e => (e -> Maybe b) -> (b -> IO a) -> IO a -> IO a Source A version of catchJust with the arguments swapped around (see handle ). The try functions try :: Exception e => IO a -> IO ( Either e a) Source Similar to catch , but returns an Either result which is ( Right a) if no exception of type e was raised, or ( Left ex) if an exception of type e was raised and its value is ex . If any other type of exception is raised than it will be propogated up to the next enclosing exception handler. try a = catch (Right `liftM` a) (return . Left) Note that System.IO.Error also exports a function called try with a similar type to try , except that it catches only the IO and user families of exceptions (as required by the Haskell 98 IO module). tryJust :: Exception e => (e -> Maybe b) -> IO a -> IO ( Either b a) Source A variant of try that takes an exception predicate to select which exceptions are caught (c.f. catchJust ). If the exception does not match the predicate, it is re-thrown. The evaluate function evaluate :: a -> IO a Source Forces its argument to be evaluated to weak head normal form when the resultant IO action is executed. It can be used to order evaluation with respect to other IO operations; its semantics are given by evaluate x `seq` y ==> y evaluate x `catch` f ==> (return $! x) `catch` f evaluate x >>= f ==> (return $! x) >>= f Note: the first equation implies that (evaluate x) is not the same as (return $! x) . A correct definition is evaluate x = (return $! x) >>= return The mapException function mapException :: ( Exception e1, Exception e2) => (e1 -> e2) -> a -> a Source This function maps one exception into another as proposed in the paper "A semantics for imprecise exceptions". Asynchronous Exceptions Asynchronous exceptions are so-called because they arise due to external influences, and can be raised at any point during execution. StackOverflow and HeapOverflow are two examples of system-generated asynchronous exceptions. The primary source of asynchronous exceptions, however, is throwTo : throwTo :: ThreadId -> Exception -> IO () throwTo (also killThread ) allows one running thread to raise an arbitrary exception in another thread. The exception is therefore asynchronous with respect to the target thread, which could be doing anything at the time it receives the exception. Great care should be taken with asynchronous exceptions; it is all too easy to introduce race conditions by the over zealous use of throwTo . Asynchronous exception control The following functions allow a thread to control delivery of asynchronous exceptions during a critical region. mask :: (( forall a. IO a -> IO a) -> IO b) -> IO b Source Executes an IO computation with asynchronous exceptions masked . That is, any thread which attempts to raise an exception in the current thread with throwTo will be blocked until asynchronous exceptions are unmasked again. The argument passed to mask is a function that takes as its argument another function, which can be used to restore the prevailing masking state within the context of the masked computation. For example, a common way to use mask is to protect the acquisition of a resource: mask $ \restore -> do x <- acquire restore (do_something_with x) `onException` release release This code guarantees that acquire is paired with release , by masking asynchronous exceptions for the critical parts. (Rather than write this code yourself, it would be better to use bracket which abstracts the general pattern). Note that the restore action passed to the argument to mask does not necessarily unmask asynchronous exceptions, it just restores the masking state to that of the enclosing context. Thus if asynchronous exceptions are already masked, mask cannot be used to unmask exceptions again. This is so that if you call a library function with exceptions masked, you can be sure that the library call will not be able to unmask exceptions again. If you are writing library code and need to use asynchronous exceptions, the only way is to create a new thread; see forkIOWithUnmask . Asynchronous exceptions may still be received while in the masked state if the masked thread blocks in certain ways; see Control.Exception . Threads created by forkIO inherit the masked state from the parent; that is, to start a thread in blocked mode, use mask_ $ forkIO ... . This is particularly useful if you need to establish an exception handler in the forked thread before any asynchronous exceptions are received. To create a a new thread in an unmasked state use forkIOUnmasked . mask_ :: IO a -> IO a Source Like mask , but does not pass a restore action to the argument. uninterruptibleMask :: (( forall a. IO a -> IO a) -> IO b) -> IO b Source Like mask , but the masked computation is not interruptible (see Control.Exception ). THIS SHOULD BE USED WITH GREAT CARE, because if a thread executing in uninterruptibleMask blocks for any reason, then the thread (and possibly the program, if this is the main thread) will be unresponsive and unkillable. This function should only be necessary if you need to mask exceptions around an interruptible operation, and you can guarantee that the interruptible operation will only block for a short period of time. uninterruptibleMask_ :: IO a -> IO a Source Like uninterruptibleMask , but does not pass a restore action to the argument. data MaskingState Source Describes the behaviour of a thread when an asynchronous exception is received. Constructors Unmasked asynchronous exceptions are unmasked (the normal state) MaskedInterruptible the state during mask : asynchronous exceptions are masked, but blocking operations may still be interrupted MaskedUninterruptible the state during uninterruptibleMask : asynchronous exceptions are masked, and blocking operations may not be interrupted Instances Eq MaskingState Show MaskingState getMaskingState :: IO MaskingState Source Returns the MaskingState for the current thread. allowInterrupt :: IO () Source When invoked inside mask , this function allows a blocked asynchronous exception to be raised, if one exists. It is equivalent to performing an interruptible operation (see ), but does not involve any actual blocking. When called outside mask , or inside uninterruptibleMask , this function has no effect. (deprecated) Asynchronous exception control block :: IO a -> IO a Source Deprecated: use Control.Exception.mask instead Note: this function is deprecated, please use mask instead. Applying block to a computation will execute that computation with asynchronous exceptions blocked . That is, any thread which attempts to raise an exception in the current thread with throwTo will be blocked until asynchronous exceptions are unblocked again. There's no need to worry about re-enabling asynchronous exceptions; that is done automatically on exiting the scope of block . Threads created by forkIO inherit the blocked state from the parent; that is, to start a thread in blocked mode, use block $ forkIO ... . This is particularly useful if you need to establish an exception handler in the forked thread before any asynchronous exceptions are received. unblock :: IO a -> IO a Source Deprecated: use Control.Exception.mask instead Note: this function is deprecated, please use mask instead. To re-enable asynchronous exceptions inside the scope of block , unblock can be used. It scopes in exactly the same way, so on exit from unblock asynchronous exception delivery will be disabled again. blocked :: IO Bool Source Deprecated: use Control.Exception.getMaskingState instead returns True if asynchronous exceptions are blocked in the current thread. Applying mask to an exception handler There's an implied mask around every exception handler in a call to one of the catch family of functions. This is because that is what you want most of the time - it eliminates a common race condition in starting an exception handler, because there may be no exception handler on the stack to handle another exception if one arrives immediately. If asynchronous exceptions are masked on entering the handler, though, we have time to install a new exception handler before being interrupted. If this weren't the default, one would have to write something like mask $ \restore -> catch (restore (...)) (\e -> handler) If you need to unblock asynchronous exceptions again in the exception handler, restore can be used there too. Note that try and friends do not have a similar default, because there is no exception handler in this case. Don't use try for recovering from an asynchronous exception. Interruptible operations Some operations are interruptible , which means that they can receive asynchronous exceptions even in the scope of a mask . Any function which may itself block is defined as interruptible; this includes takeMVar (but not tryTakeMVar ), and most operations which perform some I/O with the outside world. The reason for having interruptible operations is so that we can write things like mask $ \restore -> do a <- takeMVar m catch (restore (...)) (\e -> ...) if the takeMVar was not interruptible, then this particular combination could lead to deadlock, because the thread itself would be blocked in a state where it can't receive any asynchronous exceptions. With takeMVar interruptible, however, we can be safe in the knowledge that the thread can receive exceptions right up until the point when the takeMVar succeeds. Similar arguments apply for other interruptible operations like openFile . It is useful to think of mask not as a way to completely prevent asynchronous exceptions, but as a way to switch from asynchronous mode to polling mode. The main difficulty with asynchronous exceptions is that they normally can occur anywhere, but within a mask an asynchronous exception is only raised by operations that are interruptible (or call other interruptible operations). In many cases these operations may themselves raise exceptions, such as I/O errors, so the caller will usually be prepared to handle exceptions arising from the operation anyway. To perfom an explicit poll for asynchronous exceptions inside mask , use allowInterrupt . Sometimes it is too onerous to handle exceptions in the middle of a critical piece of stateful code. There are three ways to handle this kind of situation: Use STM. Since a transaction is always either completely executed or not at all, transactions are a good way to maintain invariants over state in the presence of asynchronous (and indeed synchronous) exceptions. Use mask , and avoid interruptible operations. In order to do this, we have to know which operations are interruptible. It is impossible to know for any given library function whether it might invoke an interruptible operation internally; so instead we give a list of guaranteed-not-to-be-interruptible operations below. Use uninterruptibleMask . This is generally not recommended, unless you can guarantee that any interruptible operations invoked during the scope of uninterruptibleMask can only ever block for a short time. Otherwise, uninterruptibleMask is a good way to make your program deadlock and be unresponsive to user interrupts. The following operations are guaranteed not to be interruptible: operations on IORef from Data.IORef * STM transactions that do not use retry * everything from the Foreign modules * everything from Control.Exception * tryTakeMVar , tryPutMVar , isEmptyMVar * takeMVar if the MVar is definitely full, and conversely putMVar if the MVar is definitely empty * newEmptyMVar , newMVar * forkIO , forkIOUnmasked , myThreadId Assertions assert :: Bool -> a -> a Source If the first argument evaluates to True , then the result is the second argument. Otherwise an AssertionFailed exception is raised, containing a String with the source file and line number of the call to assert . Assertions can normally be turned on or off with a compiler flag (for GHC, assertions are normally on unless optimisation is turned on with -O or the -fignore-asserts option is given). When assertions are turned off, the first argument to assert is ignored, and the second argument is returned as the result. Utilities bracket Source Arguments :: IO a computation to run first ("acquire resource") -> (a -> IO b) computation to run last ("release resource") -> (a -> IO c) computation to run in-between -> IO c When you want to acquire a resource, do some work with it, and then release the resource, it is a good idea to use bracket , because bracket will install the necessary exception handler to release the resource in the event that an exception is raised during the computation. If an exception is raised, then bracket will re-raise the exception (after performing the release). A common example is opening a file: bracket (openFile "filename" ReadMode) (hClose) (\fileHandle -> do { ... }) The arguments to bracket are in this order so that we can partially apply it, e.g.: withFile name mode = bracket (openFile name mode) hClose bracket_ :: IO a -> IO b -> IO c -> IO c Source A variant of bracket where the return value from the first computation is not required. bracketOnError Source Arguments :: IO a computation to run first ("acquire resource") -> (a -> IO b) computation to run last ("release resource") -> (a -> IO c) computation to run in-between -> IO c Like bracket , but only performs the final action if there was an exception raised by the in-between computation. finally Source Arguments :: IO a computation to run first -> IO b computation to run afterward (even if an exception was raised) -> IO a A specialised variant of bracket with just a computation to run afterward. onException :: IO a -> IO b -> IO a Source Like finally , but only performs the final action if there was an exception raised by the computation. Produced by Haddock version 2.13.2 | 2026-01-13T09:30:24 |
http://hackage.haskell.org/package/comonad-4.2.2/docs/Data-Functor-Coproduct.html#t:Coproduct | Data.Functor.Coproduct Source Contents Index comonad-4.2.2: Comonads Portability portable Stability provisional Maintainer Edward Kmett <ekmett@gmail.com> Safe Haskell Trustworthy Data.Functor.Coproduct Description Documentation newtype Coproduct f g a Source Constructors Coproduct Fields getCoproduct :: Either (f a) (g a) Instances ( Functor f, Functor g) => Functor ( Coproduct f g) ( Foldable f, Foldable g) => Foldable ( Coproduct f g) ( Traversable f, Traversable g) => Traversable ( Coproduct f g) ( Contravariant f, Contravariant g) => Contravariant ( Coproduct f g) ( Comonad f, Comonad g) => Comonad ( Coproduct f g) ( Eq (f a), Eq (g a)) => Eq ( Coproduct f g a) ( Ord (f a), Ord (g a)) => Ord ( Coproduct f g a) ( Read (f a), Read (g a)) => Read ( Coproduct f g a) ( Show (f a), Show (g a)) => Show ( Coproduct f g a) left :: f a -> Coproduct f g a Source right :: g a -> Coproduct f g a Source coproduct :: (f a -> b) -> (g a -> b) -> Coproduct f g a -> b Source Produced by Haddock version 2.13.2 | 2026-01-13T09:30:24 |
http://hackage.haskell.org/package/base-4.6.0.1/docs/Data-Either.html#t:Either | Data.Either Source Contents Index base-4.6.0.1: Basic libraries Portability portable Stability experimental Maintainer libraries@haskell.org Safe Haskell Trustworthy Data.Either Description The Either type, and associated operations. Synopsis data Either a b = Left a | Right b either :: (a -> c) -> (b -> c) -> Either a b -> c lefts :: [ Either a b] -> [a] rights :: [ Either a b] -> [b] partitionEithers :: [ Either a b] -> ([a], [b]) Documentation data Either a b Source The Either type represents values with two possibilities: a value of type Either a b is either Left a or Right b . The Either type is sometimes used to represent a value which is either correct or an error; by convention, the Left constructor is used to hold an error value and the Right constructor is used to hold a correct value (mnemonic: "right" also means "correct"). Constructors Left a Right b Instances Typeable2 Either Monad ( Either e) Functor ( Either a) MonadFix ( Either e) Applicative ( Either e) Generic1 ( Either a) ( Eq a, Eq b) => Eq ( Either a b) ( Data a, Data b) => Data ( Either a b) ( Ord a, Ord b) => Ord ( Either a b) ( Read a, Read b) => Read ( Either a b) ( Show a, Show b) => Show ( Either a b) Generic ( Either a b) either :: (a -> c) -> (b -> c) -> Either a b -> c Source Case analysis for the Either type. If the value is Left a , apply the first function to a ; if it is Right b , apply the second function to b . lefts :: [ Either a b] -> [a] Source Extracts from a list of Either all the Left elements All the Left elements are extracted in order. rights :: [ Either a b] -> [b] Source Extracts from a list of Either all the Right elements All the Right elements are extracted in order. partitionEithers :: [ Either a b] -> ([a], [b]) Source Partitions a list of Either into two lists All the Left elements are extracted, in order, to the first component of the output. Similarly the Right elements are extracted to the second component of the output. Produced by Haddock version 2.13.2 | 2026-01-13T09:30:24 |
http://hackage.haskell.org/package/transformers-0.4.1.0/docs/Data-Functor-Product.html#t:Product | Data.Functor.Product Source Contents Index transformers-0.4.1.0: Concrete functor and monad transformers Portability portable Stability experimental Maintainer ross@soi.city.ac.uk Safe Haskell Safe-Inferred Data.Functor.Product Description Products, lifted to functors. Synopsis data Product f g a = Pair (f a) (g a) Documentation data Product f g a Source Lifted product of functors. Constructors Pair (f a) (g a) Instances ( Monad f, Monad g) => Monad ( Product f g) ( Functor f, Functor g) => Functor ( Product f g) ( MonadFix f, MonadFix g) => MonadFix ( Product f g) ( MonadPlus f, MonadPlus g) => MonadPlus ( Product f g) ( Applicative f, Applicative g) => Applicative ( Product f g) ( Foldable f, Foldable g) => Foldable ( Product f g) ( Traversable f, Traversable g) => Traversable ( Product f g) ( Alternative f, Alternative g) => Alternative ( Product f g) ( Show1 f, Show1 g) => Show1 ( Product f g) ( Read1 f, Read1 g) => Read1 ( Product f g) ( Ord1 f, Ord1 g) => Ord1 ( Product f g) ( Eq1 f, Eq1 g) => Eq1 ( Product f g) ( Eq1 f, Eq1 g, Eq a) => Eq ( Product f g a) ( Ord1 f, Ord1 g, Ord a) => Ord ( Product f g a) ( Read1 f, Read1 g, Read a) => Read ( Product f g a) ( Show1 f, Show1 g, Show a) => Show ( Product f g a) Produced by Haddock version 2.13.2 | 2026-01-13T09:30:24 |
http://hackage.haskell.org/package/semigroupoids-4.2/docs/src/Data-Semigroup-Foldable.html#sequenceA1_ | src/Data/Semigroup/Foldable.hs {-# LANGUAGE CPP #-} ----------------------------------------------------------------------------- -- | -- Module : Data.Semigroup.Foldable -- Copyright : (C) 2011 Edward Kmett -- License : BSD-style (see the file LICENSE) -- -- Maintainer : Edward Kmett <ekmett@gmail.com> -- Stability : provisional -- Portability : portable -- ---------------------------------------------------------------------------- module Data . Semigroup . Foldable ( Foldable1 ( .. ) , traverse1_ , for1_ , sequenceA1_ , foldMapDefault1 ) where import Control . Monad . Trans . Identity import Data . Foldable import Data . Functor . Identity import Data . Functor . Apply import Data . Functor . Product import Data . Functor . Compose import Data . List . NonEmpty ( NonEmpty ( .. ) ) import Data . Traversable . Instances () import Data . Semigroup hiding ( Product ) import Prelude hiding ( foldr ) #ifdef MIN_VERSION_containers import Data . Tree #endif #ifdef MIN_VERSION_comonad import Data . Functor . Coproduct #endif class Foldable t => Foldable1 t where fold1 :: Semigroup m => t m -> m foldMap1 :: Semigroup m => ( a -> m ) -> t a -> m foldMap1 f = maybe ( error "foldMap1" ) id . getOption . foldMap ( Option . Just . f ) fold1 = foldMap1 id #ifdef MIN_VERSION_containers instance Foldable1 Tree where foldMap1 f ( Node a [] ) = f a foldMap1 f ( Node a ( x : xs ) ) = f a <> foldMap1 ( foldMap1 f ) ( x :| xs ) #endif instance Foldable1 Identity where foldMap1 f = f . runIdentity instance Foldable1 m => Foldable1 ( IdentityT m ) where foldMap1 f = foldMap1 f . runIdentityT instance ( Foldable1 f , Foldable1 g ) => Foldable1 ( Compose f g ) where foldMap1 f = foldMap1 ( foldMap1 f ) . getCompose instance ( Foldable1 f , Foldable1 g ) => Foldable1 ( Product f g ) where foldMap1 f ( Pair a b ) = foldMap1 f a <> foldMap1 f b #ifdef MIN_VERSION_comonad instance ( Foldable1 f , Foldable1 g ) => Foldable1 ( Coproduct f g ) where foldMap1 f = coproduct ( foldMap1 f ) ( foldMap1 f ) #endif instance Foldable1 NonEmpty where foldMap1 f ( a :| [] ) = f a foldMap1 f ( a :| b : bs ) = f a <> foldMap1 f ( b :| bs ) instance Foldable1 ( (,) a ) where foldMap1 f ( _ , x ) = f x newtype Act f a = Act { getAct :: f a } instance Apply f => Semigroup ( Act f a ) where Act a <> Act b = Act ( a .> b ) instance Functor f => Functor ( Act f ) where fmap f ( Act a ) = Act ( f <$> a ) b <$ Act a = Act ( b <$ a ) traverse1_ :: ( Foldable1 t , Apply f ) => ( a -> f b ) -> t a -> f () traverse1_ f t = () <$ getAct ( foldMap1 ( Act . f ) t ) {-# INLINE traverse1_ #-} for1_ :: ( Foldable1 t , Apply f ) => t a -> ( a -> f b ) -> f () for1_ = flip traverse1_ {-# INLINE for1_ #-} sequenceA1_ :: ( Foldable1 t , Apply f ) => t ( f a ) -> f () sequenceA1_ t = () <$ getAct ( foldMap1 Act t ) {-# INLINE sequenceA1_ #-} -- | Usable default for foldMap, but only if you define foldMap1 yourself foldMapDefault1 :: ( Foldable1 t , Monoid m ) => ( a -> m ) -> t a -> m foldMapDefault1 f = unwrapMonoid . foldMap ( WrapMonoid . f ) {-# INLINE foldMapDefault1 #-} -- toStream :: Foldable1 t => t a -> Stream a -- concat1 :: Foldable1 t => t (Stream a) -> Stream a -- concatMap1 :: Foldable1 t => (a -> Stream b) -> t a -> Stream b | 2026-01-13T09:30:24 |
http://hackage.haskell.org/packages/search | Browse and search packages | Hackage Hackage :: [Package] Search Browse What's new Upload User accounts Browse and search packages To view all packages, submit the form with an empty search query. Sort direction: ascending descending Sort column: default name number of downloads rating description tags date of last upload maintainers Search query (leave empty to show all non-deprecated packages): Page number (zero-indexed): Please disregard the following form, it only works with JavaScript. ▸ Advanced options Also show deprecated packages Last uploaded version younger than Only show packages with tag Rating greater than, or equal to 2 Usage Apart from just writing words to search everywhere in package metadata, you can also use filters in the search query string input field above. Filters are surrounded by parentheses. All filters have to pass for every package shown in the result, that is, it is a logical conjunction . (downloads > 1000) Only show packages with more than 1000 downloads within the last 30 days. The download count is inexact because Hackage uses a content delivery network . (lastUpload < 2021-10-29) Only show packages for which the last upload was before (i.e. excluding) the given UTC date in the 'complete date' format as specified using ISO 8601 . (lastUpload = 2021-10-29) Only show packages for which the last upload was within the 24 hours of the given UTC date. (maintainer:SimonMarlow) Only show packages for which the maintainers list includes the user name SimonMarlow . (tag:bsd3) Only show packages with the bsd3 tag. (not tag:network) Do not show packages with the network tag. The not operator can also be used with other filters. (ageOfLastUpload > 5d) Only show packages uploaded more than five days ago. (ageOfLastUpload > 4w) Only show packages uploaded more than four weeks ago. A week has seven days. (ageOfLastUpload < 1m) Only show packages last uploaded less than one month ago. A month is considered to have 30.437 days. (ageOfLastUpload < 2.5y) Only show packages last uploaded less than 2.5 years ago. A year is considered to be 365.25 days. (rating > 2.5) Only show packages with a rating of more than 2.5. The dot is the only accepted decimal separator. (rating /= 0) Only show packages with a rating unequal to zero. (deprecated:any) Do not filter out deprecated packages. This must be explicitly added if desired. (deprecated:true) Only show deprecated packages. (deprecated:false) Only show packages that are not deprecated. If no other deprecation filter is given, this filter is automatically added. (distro:Debian) Only show packages that are available in the Debian distribution. See the full list of available distributions . Name DLs Rating Description Tags Last U/L Reference Version Maintainers Alternatively, if you are looking for a particular function then try Hoogle . | 2026-01-13T09:30:24 |
http://hackage.haskell.org/package/semigroupoids-4.2/docs/src/Data-Semigroup-Foldable.html#traverse1_ | src/Data/Semigroup/Foldable.hs {-# LANGUAGE CPP #-} ----------------------------------------------------------------------------- -- | -- Module : Data.Semigroup.Foldable -- Copyright : (C) 2011 Edward Kmett -- License : BSD-style (see the file LICENSE) -- -- Maintainer : Edward Kmett <ekmett@gmail.com> -- Stability : provisional -- Portability : portable -- ---------------------------------------------------------------------------- module Data . Semigroup . Foldable ( Foldable1 ( .. ) , traverse1_ , for1_ , sequenceA1_ , foldMapDefault1 ) where import Control . Monad . Trans . Identity import Data . Foldable import Data . Functor . Identity import Data . Functor . Apply import Data . Functor . Product import Data . Functor . Compose import Data . List . NonEmpty ( NonEmpty ( .. ) ) import Data . Traversable . Instances () import Data . Semigroup hiding ( Product ) import Prelude hiding ( foldr ) #ifdef MIN_VERSION_containers import Data . Tree #endif #ifdef MIN_VERSION_comonad import Data . Functor . Coproduct #endif class Foldable t => Foldable1 t where fold1 :: Semigroup m => t m -> m foldMap1 :: Semigroup m => ( a -> m ) -> t a -> m foldMap1 f = maybe ( error "foldMap1" ) id . getOption . foldMap ( Option . Just . f ) fold1 = foldMap1 id #ifdef MIN_VERSION_containers instance Foldable1 Tree where foldMap1 f ( Node a [] ) = f a foldMap1 f ( Node a ( x : xs ) ) = f a <> foldMap1 ( foldMap1 f ) ( x :| xs ) #endif instance Foldable1 Identity where foldMap1 f = f . runIdentity instance Foldable1 m => Foldable1 ( IdentityT m ) where foldMap1 f = foldMap1 f . runIdentityT instance ( Foldable1 f , Foldable1 g ) => Foldable1 ( Compose f g ) where foldMap1 f = foldMap1 ( foldMap1 f ) . getCompose instance ( Foldable1 f , Foldable1 g ) => Foldable1 ( Product f g ) where foldMap1 f ( Pair a b ) = foldMap1 f a <> foldMap1 f b #ifdef MIN_VERSION_comonad instance ( Foldable1 f , Foldable1 g ) => Foldable1 ( Coproduct f g ) where foldMap1 f = coproduct ( foldMap1 f ) ( foldMap1 f ) #endif instance Foldable1 NonEmpty where foldMap1 f ( a :| [] ) = f a foldMap1 f ( a :| b : bs ) = f a <> foldMap1 f ( b :| bs ) instance Foldable1 ( (,) a ) where foldMap1 f ( _ , x ) = f x newtype Act f a = Act { getAct :: f a } instance Apply f => Semigroup ( Act f a ) where Act a <> Act b = Act ( a .> b ) instance Functor f => Functor ( Act f ) where fmap f ( Act a ) = Act ( f <$> a ) b <$ Act a = Act ( b <$ a ) traverse1_ :: ( Foldable1 t , Apply f ) => ( a -> f b ) -> t a -> f () traverse1_ f t = () <$ getAct ( foldMap1 ( Act . f ) t ) {-# INLINE traverse1_ #-} for1_ :: ( Foldable1 t , Apply f ) => t a -> ( a -> f b ) -> f () for1_ = flip traverse1_ {-# INLINE for1_ #-} sequenceA1_ :: ( Foldable1 t , Apply f ) => t ( f a ) -> f () sequenceA1_ t = () <$ getAct ( foldMap1 Act t ) {-# INLINE sequenceA1_ #-} -- | Usable default for foldMap, but only if you define foldMap1 yourself foldMapDefault1 :: ( Foldable1 t , Monoid m ) => ( a -> m ) -> t a -> m foldMapDefault1 f = unwrapMonoid . foldMap ( WrapMonoid . f ) {-# INLINE foldMapDefault1 #-} -- toStream :: Foldable1 t => t a -> Stream a -- concat1 :: Foldable1 t => t (Stream a) -> Stream a -- concatMap1 :: Foldable1 t => (a -> Stream b) -> t a -> Stream b | 2026-01-13T09:30:24 |
http://hackage.haskell.org/package/semigroupoids-4.2/docs/src/Data-Semigroup-Foldable.html#for1_ | src/Data/Semigroup/Foldable.hs {-# LANGUAGE CPP #-} ----------------------------------------------------------------------------- -- | -- Module : Data.Semigroup.Foldable -- Copyright : (C) 2011 Edward Kmett -- License : BSD-style (see the file LICENSE) -- -- Maintainer : Edward Kmett <ekmett@gmail.com> -- Stability : provisional -- Portability : portable -- ---------------------------------------------------------------------------- module Data . Semigroup . Foldable ( Foldable1 ( .. ) , traverse1_ , for1_ , sequenceA1_ , foldMapDefault1 ) where import Control . Monad . Trans . Identity import Data . Foldable import Data . Functor . Identity import Data . Functor . Apply import Data . Functor . Product import Data . Functor . Compose import Data . List . NonEmpty ( NonEmpty ( .. ) ) import Data . Traversable . Instances () import Data . Semigroup hiding ( Product ) import Prelude hiding ( foldr ) #ifdef MIN_VERSION_containers import Data . Tree #endif #ifdef MIN_VERSION_comonad import Data . Functor . Coproduct #endif class Foldable t => Foldable1 t where fold1 :: Semigroup m => t m -> m foldMap1 :: Semigroup m => ( a -> m ) -> t a -> m foldMap1 f = maybe ( error "foldMap1" ) id . getOption . foldMap ( Option . Just . f ) fold1 = foldMap1 id #ifdef MIN_VERSION_containers instance Foldable1 Tree where foldMap1 f ( Node a [] ) = f a foldMap1 f ( Node a ( x : xs ) ) = f a <> foldMap1 ( foldMap1 f ) ( x :| xs ) #endif instance Foldable1 Identity where foldMap1 f = f . runIdentity instance Foldable1 m => Foldable1 ( IdentityT m ) where foldMap1 f = foldMap1 f . runIdentityT instance ( Foldable1 f , Foldable1 g ) => Foldable1 ( Compose f g ) where foldMap1 f = foldMap1 ( foldMap1 f ) . getCompose instance ( Foldable1 f , Foldable1 g ) => Foldable1 ( Product f g ) where foldMap1 f ( Pair a b ) = foldMap1 f a <> foldMap1 f b #ifdef MIN_VERSION_comonad instance ( Foldable1 f , Foldable1 g ) => Foldable1 ( Coproduct f g ) where foldMap1 f = coproduct ( foldMap1 f ) ( foldMap1 f ) #endif instance Foldable1 NonEmpty where foldMap1 f ( a :| [] ) = f a foldMap1 f ( a :| b : bs ) = f a <> foldMap1 f ( b :| bs ) instance Foldable1 ( (,) a ) where foldMap1 f ( _ , x ) = f x newtype Act f a = Act { getAct :: f a } instance Apply f => Semigroup ( Act f a ) where Act a <> Act b = Act ( a .> b ) instance Functor f => Functor ( Act f ) where fmap f ( Act a ) = Act ( f <$> a ) b <$ Act a = Act ( b <$ a ) traverse1_ :: ( Foldable1 t , Apply f ) => ( a -> f b ) -> t a -> f () traverse1_ f t = () <$ getAct ( foldMap1 ( Act . f ) t ) {-# INLINE traverse1_ #-} for1_ :: ( Foldable1 t , Apply f ) => t a -> ( a -> f b ) -> f () for1_ = flip traverse1_ {-# INLINE for1_ #-} sequenceA1_ :: ( Foldable1 t , Apply f ) => t ( f a ) -> f () sequenceA1_ t = () <$ getAct ( foldMap1 Act t ) {-# INLINE sequenceA1_ #-} -- | Usable default for foldMap, but only if you define foldMap1 yourself foldMapDefault1 :: ( Foldable1 t , Monoid m ) => ( a -> m ) -> t a -> m foldMapDefault1 f = unwrapMonoid . foldMap ( WrapMonoid . f ) {-# INLINE foldMapDefault1 #-} -- toStream :: Foldable1 t => t a -> Stream a -- concat1 :: Foldable1 t => t (Stream a) -> Stream a -- concatMap1 :: Foldable1 t => (a -> Stream b) -> t a -> Stream b | 2026-01-13T09:30:24 |
https://rubygems.org/gems/fixture_dependencies | fixture_dependencies | RubyGems.org | your community gem host ⬢ RubyGems nav#focus mousedown->nav#mouseDown click@window->nav#hide"> Navigation menu autocomplete#choose mouseover->autocomplete#highlight"> Search Gems… Releases Blog Gems Guides Sign in Sign up fixture_dependencies 1.11.0 Sequel/ActiveRecord fixture loader that handles dependency graphs Gemfile: = install: = Versions: 1.11.0 June 30, 2022 (15.5 KB) 1.10.0 May 18, 2018 (14.5 KB) 1.9.0 April 07, 2017 (14.5 KB) 1.8.0 April 25, 2016 (14 KB) 1.7.0 February 26, 2016 (14 KB) Show all versions (17 total) Development Dependencies (1): minitest-global_expectations >= 0 Show all transitive dependencies Owners: Pushed by: Authors: Jeremy Evans SHA 256 checksum: = ← Previous version Total downloads 190,587 For this version 18,948 Version Released: June 30, 2022 4:09pm License: MIT Required Ruby Version: >= 1.9.2 Links: Homepage Mailing List Bug Tracker Download Review changes Badge Subscribe RSS Report abuse Reverse dependencies Status Uptime Code Data Stats Contribute About Help API Policies Support Us Security RubyGems.org is the Ruby community’s gem hosting service. Instantly publish your gems and then install them . Use the API to find out more about available gems . Become a contributor and improve the site yourself. The RubyGems.org website and service are maintained and operated by Ruby Central’s Open Source Program and the RubyGems team. It is funded by the greater Ruby community through support from sponsors, members, and infrastructure donations. If you build with Ruby and believe in our mission, you can join us in keeping RubyGems.org, RubyGems, and Bundler secure and sustainable for years to come by contributing here . Operated by Ruby Central Designed by DockYard Hosted by AWS Resolved with DNSimple Monitored by Datadog Gems served by Fastly Monitored by Honeybadger Secured by Mend.io English Nederlands 简体中文 正體中文 Português do Brasil Français Español Deutsch 日本語 | 2026-01-13T09:30:24 |
https://rubygems.org/gems/cicphash | cicphash | RubyGems.org | your community gem host ⬢ RubyGems nav#focus mousedown->nav#mouseDown click@window->nav#hide"> Navigation menu autocomplete#choose mouseover->autocomplete#highlight"> Search Gems… Releases Blog Gems Guides Sign in Sign up cicphash 2.0.0 Case Insensitive Case Preserving Hash Gemfile: = install: = Versions: 2.0.0 December 10, 2021 (11.5 KB) 1.1.0 September 04, 2012 (8 KB) 1.0.0 August 12, 2007 * (7.5 KB) Owners: Pushed by: Authors: Jeremy Evans SHA 256 checksum: = ← Previous version Total downloads 199,821 For this version 53,709 Version Released: December 10, 2021 6:48pm License: MIT Required Ruby Version: >= 0 Links: Homepage Changelog Source Code Mailing List Bug Tracker Download Review changes Badge Subscribe RSS Report abuse Reverse dependencies Status Uptime Code Data Stats Contribute About Help API Policies Support Us Security RubyGems.org is the Ruby community’s gem hosting service. Instantly publish your gems and then install them . Use the API to find out more about available gems . Become a contributor and improve the site yourself. The RubyGems.org website and service are maintained and operated by Ruby Central’s Open Source Program and the RubyGems team. It is funded by the greater Ruby community through support from sponsors, members, and infrastructure donations. If you build with Ruby and believe in our mission, you can join us in keeping RubyGems.org, RubyGems, and Bundler secure and sustainable for years to come by contributing here . Operated by Ruby Central Designed by DockYard Hosted by AWS Resolved with DNSimple Monitored by Datadog Gems served by Fastly Monitored by Honeybadger Secured by Mend.io English Nederlands 简体中文 正體中文 Português do Brasil Français Español Deutsch 日本語 | 2026-01-13T09:30:24 |
http://hackage.haskell.org/package/semigroupoids-4.2/docs/src/Data-Semigroupoid-Static.html | src/Data/Semigroupoid/Static.hs {-# LANGUAGE CPP #-} #if defined(__GLASGOW_HASKELL__) && __GLASGOW_HASKELL__ >= 702 #ifdef MIN_VERSION_comonad #if __GLASGOW_HASKELL__ >= 707 && (MIN_VERSION_comonad(3,0,3)) {-# LANGUAGE Safe #-} #else {-# LANGUAGE Trustworthy #-} #endif #else {-# LANGUAGE Trustworthy #-} #endif #endif module Data . Semigroupoid . Static ( Static ( .. ) ) where import Control . Arrow import Control . Applicative import Control . Category #if defined(__GLASGOW_HASKELL__) && __GLASGOW_HASKELL__ < 707 import Control . Monad . Instances () #endif import Control . Monad ( ap ) import Data . Functor . Apply import Data . Functor . Plus import Data . Functor . Extend import Data . Semigroup import Data . Semigroupoid import Prelude hiding ( ( . ) , id ) #ifdef LANGUAGE_DeriveDataTypeable import Data . Typeable #endif #ifdef MIN_VERSION_comonad import Control . Comonad #endif newtype Static f a b = Static { runStatic :: f ( a -> b ) } #ifdef LANGUAGE_DeriveDataTypeable deriving ( Typeable ) #endif instance Functor f => Functor ( Static f a ) where fmap f = Static . fmap ( f . ) . runStatic instance Apply f => Apply ( Static f a ) where Static f <.> Static g = Static ( ap <$> f <.> g ) instance Alt f => Alt ( Static f a ) where Static f <!> Static g = Static ( f <!> g ) instance Plus f => Plus ( Static f a ) where zero = Static zero instance Applicative f => Applicative ( Static f a ) where pure = Static . pure . const Static f <*> Static g = Static ( ap <$> f <*> g ) instance ( Extend f , Semigroup a ) => Extend ( Static f a ) where extended f = Static . extended ( \ wf m -> f ( Static ( fmap ( . ( <> ) m ) wf ) ) ) . runStatic #ifdef MIN_VERSION_comonad instance ( Comonad f , Monoid a ) => Comonad ( Static f a ) where extend f = Static . extend ( \ wf m -> f ( Static ( fmap ( . mappend m ) wf ) ) ) . runStatic extract ( Static g ) = extract g mempty #endif instance Apply f => Semigroupoid ( Static f ) where Static f `o` Static g = Static ( ( . ) <$> f <.> g ) instance Applicative f => Category ( Static f ) where id = Static ( pure id ) Static f . Static g = Static ( ( . ) <$> f <*> g ) instance Applicative f => Arrow ( Static f ) where arr = Static . pure first ( Static g ) = Static ( first <$> g ) second ( Static g ) = Static ( second <$> g ) Static g *** Static h = Static ( ( *** ) <$> g <*> h ) Static g &&& Static h = Static ( ( &&& ) <$> g <*> h ) instance Alternative f => ArrowZero ( Static f ) where zeroArrow = Static empty instance Alternative f => ArrowPlus ( Static f ) where Static f <+> Static g = Static ( f <|> g ) instance Applicative f => ArrowChoice ( Static f ) where left ( Static g ) = Static ( left <$> g ) right ( Static g ) = Static ( right <$> g ) Static g +++ Static h = Static ( ( +++ ) <$> g <*> h ) Static g ||| Static h = Static ( ( ||| ) <$> g <*> h ) | 2026-01-13T09:30:24 |
https://rubygems.org/gems/minitest-global_expectations | minitest-global_expectations | RubyGems.org | your community gem host ⬢ RubyGems nav#focus mousedown->nav#mouseDown click@window->nav#hide"> Navigation menu autocomplete#choose mouseover->autocomplete#highlight"> Search Gems… Releases Blog Gems Guides Sign in Sign up minitest-global_expectations 1.0.2 minitest-global_expectations allows you to keep using simple code in your minitest specs, without having to wrap every single object you are calling an expectation method on with an underscore. Gemfile: = install: = Versions: 1.0.2 December 18, 2025 (6 KB) 1.0.1 September 24, 2019 (6.5 KB) 1.0.0 September 24, 2019 (6.5 KB) Runtime Dependencies (1): minitest > 5 Show all transitive dependencies Owners: Pushed by: Authors: Jeremy Evans SHA 256 checksum: = ← Previous version Total downloads 369,271 For this version 2,849 Version Released: December 18, 2025 5:57pm License: MIT Required Ruby Version: >= 1.8 Links: Homepage Changelog Mailing List Bug Tracker Download Review changes Badge Subscribe RSS Report abuse Reverse dependencies Status Uptime Code Data Stats Contribute About Help API Policies Support Us Security RubyGems.org is the Ruby community’s gem hosting service. Instantly publish your gems and then install them . Use the API to find out more about available gems . Become a contributor and improve the site yourself. The RubyGems.org website and service are maintained and operated by Ruby Central’s Open Source Program and the RubyGems team. It is funded by the greater Ruby community through support from sponsors, members, and infrastructure donations. If you build with Ruby and believe in our mission, you can join us in keeping RubyGems.org, RubyGems, and Bundler secure and sustainable for years to come by contributing here . Operated by Ruby Central Designed by DockYard Hosted by AWS Resolved with DNSimple Monitored by Datadog Gems served by Fastly Monitored by Honeybadger Secured by Mend.io English Nederlands 简体中文 正體中文 Português do Brasil Français Español Deutsch 日本語 | 2026-01-13T09:30:24 |
https://lobste.rs/s/jgl9w2/forcing_sequential_scans_on_postgresql | Forcing Sequential Scans on PostgreSQL Using Large Integers | Lobsters Active Recent Comments Search Login Login 15 Forcing Sequential Scans on PostgreSQL Using Large Integers databases ruby code.jeremyevans.net authored by jeremyevans 3 years ago | caches Archive.org Archive.today Ghostarchive | 12 comments 13 ketralnis edited 3 years ago We hit something similar to this at reddit ages ago. reddit exposes postgres IDs to users encoded as base36 in URLs, so www.reddit.com/details/123abc which it then decodes 123abc->63978744 and then does the obvious SQL query to find the post and its comments. But sometimes broken scrapers would hit something like www.reddit.com/details/wwwredditcomdetails and we'd happily decode wwwredditcomdetails->339490705556535069608646345136 and do the obvious SQL query, but because the giant number is a bigint there's now a cast so the query is now a sequential scan which can never have results but takes a long time and eats up your disk bandwidth. IIRC we didn't discover this from the disk bandwidth but because having those sequential scans all of the time also held a lock on some kinds of writes so we'd have long queues of backlogged INSERTs, pending on all of those sequential scans. (Writing this out it doesn't sound like locking that should happen with postgres' MVCC system so take my hazy memory with a grain of salt.) The fix was of course simple validation which we should have been doing the whole time, but it did surprise me that postgres didn't infer that a value outside of the possible range of the column must not have any results. It seems like when you involve casts all bets are off and it just individually runs the cast for every row to check. We were building these queries through sqlalchemy which may have been involved somehow in exactly how it spells the query it generates, but I don't recall looking too deeply into this aspect vs just adding the validation and moving on. 2 enobayram 3 years ago Writing this out it doesn’t sound like locking that should happen with postgres’ MVCC system so take my hazy memory with a grain of salt. Could it be that you had some other operation that tried to take an exclusive lock on the table, such as a schema migration. Then the exclusive lock would block on the sequential scans and the INSERT s would queue behind the schema migration. 2 ketralnis edited 3 years ago Yeah, though I wouldn't expect these tables to be doing several schema migrations per second :) The details here are probably lost to the sands of time 2 sjamaan 3 years ago Under mitigations, you say One way is using bound variables. What do you mean by this exactly? 3 hobbified 3 years ago Use PQexecParams / PQexecPrepared (or the 'extended query' protocol they rely on). They take a datatype for each parameter, which means you can be explicit about what those types should be, and not have one of your values implicitly upcast to something expensive. The alternative is to use PQexec (the 'simple query' protocol) with parameter-binding handled on the client side as an operation that just outputs an SQL string. 2 sjamaan edited 3 years ago I figured maybe that's what they meant, but that depends a lot on the specifics of how that's done. It'll only work if you explicitly pass in the type, or the driver does not specify types at all (in which case they'll default to unspecified , which is a bit like, but not exactly the same, as putting it in a string literal). Some drivers will automatically detect the type to use from the value you pass in, which leads back to the original problem. For instance, the official Postgres JDBC driver's .setObject method (which adds arguments to a prepared statement) will detect the input value's class and if it's a number other than Long , Int or Double , it will call the .setNumber method which helpfully tells Postgres that the argument type is NUMERIC . In Clojure (and probably also in JRuby), this means that if the input is a bignum it'll behave the same way as if you plugged the large number in the query as a literal. I.e., (jdbc/query db ["SELECT pg_typeof(?)" 9223372036854775808]) returns numeric . If you're using the JDBC driver more directly (eg from Java or Kotlin), you have to call .setLong() for example explicitly, not .setObject() , otherwise you may be affected as well. Although there you more usually have a more explicit type anyway and will not end up with random bignums so easily. 1 jeremyevans 3 years ago Thanks for the information. I was not aware of the JDBC behavior with setObject . I only use JDBC for testing Sequel, I don't have production experience with it. Sequel's pg_auto_parameterize extension always forcible casts integers to integer or bigint based on the value of the integer, so it shouldn't be subject to this issue. Sequel's JDBC adapter always uses setLong for integer bound variables, so it is also not subject to this issue. I also checked Sequel's postgres adapter when using bound variables and it is also not subject to this issue. If you don't forcibly cast when using Sequel's postgres adapter, PostgreSQL will implicitly cast, or raise an error if no implicit cast is possible. For example, SELECT pg_typeof($1) will result in an error because the type cannot be determined. 2 sjamaan 3 years ago Here's how we worked around it in our Clojure codebase. We reject bigints (of both kinds! sometimes you may get a Java BigInteger, like when deserializing JSON) and provide an escape hatch so that one can still decide to serialize bigints when it's really needed on a case-by-case basis. (defn bignum->pgobject "Wrap a BigInt (or BigDecimal) instance in a PGObject so that it can be passed on properly as a query argument. This is necessary because we reject regular BigInts for safety reasons, and we may decide to do the same for BigDecimals later on too." [num] (doto (PGobject.) (.setType "numeric") (.setValue (str num)))) (extend-protocol jdbc/ISQLParameter clojure.lang.BigInt (set-parameter [v ^PreparedStatement _ ^long _] (throw (ex-info "Serializing bigints in queries has been disabled to avoid forced sequential scans by malicious user input; if you know it's safe, use bignum->pgobject" {:value v}))) java.math.BigInteger (set-parameter [v ^PreparedStatement _ ^long _] (throw (ex-info "Serializing bigints in queries has been disabled avoid forced sequential scans by malicious user input; if you know it's safe, use bignum->pgobject" {:value v})))) 1 hobbified 3 years ago Yeah, I think you're right. What it really means is "use this interface, and don't put anything clever between it and the user that could possibly make a bad guess in the same way that the SQL parser does". 1 sjamaan 3 years ago After some experimentation, I've discovered that it's not just with large integers that this happens. Even with a lowly floating-point number it'll fall back to sequential scan behaviour. i.e, if you do SELECT * FROM table_name WHERE id = 0.5 it'll read the 0.5 as NUMERIC . Note that this even happens for integral values in numeric syntax like 2.0 . But even if you explicitly pass in a type of double , it'll fall back to sequentially scanning the table. This should be fun in any JSON API, even if the implementation language doesn't support bignums... 2 jeremyevans 3 years ago This is covered in the post under the "Behavior of Other Numeric Type Comparisons on PostgreSQL" heading. :) 1 sjamaan 3 years ago I should really work on my reading skills ;) About Tags Filter Moderation Log | 2026-01-13T09:30:24 |
https://github.com/jeremyevans/sequel_pg | GitHub - jeremyevans/sequel_pg: Faster SELECTs when using Sequel with pg Skip to content Navigation Menu Toggle navigation Sign in Appearance settings Platform AI CODE CREATION GitHub Copilot Write better code with AI GitHub Spark Build and deploy intelligent apps GitHub Models Manage and compare prompts MCP Registry New Integrate external tools DEVELOPER WORKFLOWS Actions Automate any workflow Codespaces Instant dev environments Issues Plan and track work Code Review Manage code changes APPLICATION SECURITY GitHub Advanced Security Find and fix vulnerabilities Code security Secure your code as you build Secret protection Stop leaks before they start EXPLORE Why GitHub Documentation Blog Changelog Marketplace View all features Solutions BY COMPANY SIZE Enterprises Small and medium teams Startups Nonprofits BY USE CASE App Modernization DevSecOps DevOps CI/CD View all use cases BY INDUSTRY Healthcare Financial services Manufacturing Government View all industries View all solutions Resources EXPLORE BY TOPIC AI Software Development DevOps Security View all topics EXPLORE BY TYPE Customer stories Events & webinars Ebooks & reports Business insights GitHub Skills SUPPORT & SERVICES Documentation Customer support Community forum Trust center Partners Open Source COMMUNITY GitHub Sponsors Fund open source developers PROGRAMS Security Lab Maintainer Community Accelerator Archive Program REPOSITORIES Topics Trending Collections Enterprise ENTERPRISE SOLUTIONS Enterprise platform AI-powered developer platform AVAILABLE ADD-ONS GitHub Advanced Security Enterprise-grade security features Copilot for Business Enterprise-grade AI features Premium Support Enterprise-grade 24/7 support Pricing Search or jump to... Search code, repositories, users, issues, pull requests... --> Search Clear Search syntax tips Provide feedback --> We read every piece of feedback, and take your input very seriously. Include my email address so I can be contacted Cancel Submit feedback Saved searches Use saved searches to filter your results more quickly --> Name Query To see all available qualifiers, see our documentation . Cancel Create saved search Sign in Sign up Appearance settings Resetting focus You signed in with another tab or window. Reload to refresh your session. You signed out in another tab or window. Reload to refresh your session. You switched accounts on another tab or window. Reload to refresh your session. Dismiss alert {{ message }} jeremyevans / sequel_pg Public Notifications You must be signed in to change notification settings Fork 23 Star 269 Faster SELECTs when using Sequel with pg 269 stars 23 forks Branches Tags Activity Star Notifications You must be signed in to change notification settings Code Issues 0 Pull requests 0 Discussions Actions Security Uh oh! There was an error while loading. Please reload this page . Insights Additional navigation options Code Issues Pull requests Discussions Actions Security Insights jeremyevans/sequel_pg master Branches Tags Go to file Code Open more actions menu Folders and files Name Name Last commit message Last commit date Latest commit History 225 Commits .github/ workflows .github/ workflows ext/ sequel_pg ext/ sequel_pg lib lib spec spec .ci.gemfile .ci.gemfile .gitignore .gitignore CHANGELOG CHANGELOG MIT-LICENSE MIT-LICENSE README.rdoc README.rdoc Rakefile Rakefile sequel_pg.gemspec sequel_pg.gemspec View all files Repository files navigation README License sequel_pg sequel_pg overwrites the inner loop of the Sequel postgres adapter row fetching code with a C version. The C version is significantly faster than the pure ruby version that Sequel uses by default. Real world difference The speed up that sequel_pg gives you depends on what you are selecting, but it should be noticeable whenever many rows are selected. Here’s an example that shows the difference it makes on a couple of models: Track . count # => 202261 Album . count # => 7264 Without sequel_pg: puts Benchmark . measure { Track . each {}} # 3.400000 0.290000 3.690000 ( 4.005150) puts Benchmark . measure { 10 . times { Album . each {}}} # 2.180000 0.120000 2.300000 ( 2.479352) With sequel_pg: puts Benchmark . measure { Track . each {}} # 1.660000 0.260000 1.920000 ( 2.287216) puts Benchmark . measure { 10 . times { Album . each {}}} # 0.960000 0.110000 1.070000 ( 1.260913) sequel_pg also speeds up the following Dataset methods: map as_hash/to_hash to_hash_groups select_hash select_hash_groups select_map select_order_map Additionally, in most cases sequel_pg also speeds up the loading of model datasets by optimizing model instance creation. Streaming If you are using PostgreSQL 9.2+ on the client, then sequel_pg should enable streaming support. This allows you to stream returned rows one at a time, instead of collecting the entire result set in memory (which is how PostgreSQL works by default). You can check if streaming is supported by: Sequel :: Postgres . supports_streaming? If streaming is supported, you can load the streaming support into the database: DB . extension ( :pg_streaming ) Then you can call the Dataset#stream method to have the dataset use the streaming support: DB[:table].stream.each{|row| ...} If you want to enable streaming for all of a database’s datasets, you can do the following: DB . stream_all_queries = true Installing the gem gem install sequel_pg Make sure the pg_config binary is in your PATH so the installation can find the PostgreSQL shared library and header files. Alternatively, you can use the POSTGRES_LIB and POSTGRES_INCLUDE environment variables to specify the shared library and header directories. Running the specs sequel_pg is designed to replace a part of Sequel, so it should be tested using Sequel’s specs (the spec_postgres rake task). There is a spec_cov task that assumes you have Sequel checked out at ../sequel, and uses a small spec suite for parts of sequel_pg not covered by Sequel’s specs. It sets the SEQUEL_PG_STREAM environment variable when running Sequel’s specs, make sure that spec/spec_config.rb in Sequel is set to connect to PostgreSQL and use the following additional settings: DB . extension ( :pg_streaming ) DB . stream_all_queries = true Reporting issues/bugs sequel_pg uses GitHub Issues for tracking issues/bugs: http :/ / github . com / jeremyevans / sequel_pg / issues Contributing The source code is on GitHub: http :/ / github . com / jeremyevans / sequel_pg To get a copy: git clone git://github.com/jeremyevans/sequel_pg.git There are only a few requirements, which you should probably have before considering use of the library: Rake Sequel pg libpq headers and library Building To build the library from a git checkout, after installing the requirements: rake build Known Issues You must be using the ISO PostgreSQL date format (which is the default). Using the SQL, POSTGRESQL, or GERMAN date formats will result in incorrect date/timestamp handling. In addition to PostgreSQL defaulting to ISO, Sequel also manually sets the date format to ISO by default, so unless you are overriding that setting (via DB.use_iso_date_format = false), you should be OK. Adding your own type conversion procs only has an effect if those types are not handled by default. You do not need to require the library, the sequel postgres adapter will require it automatically. If you are using bundler, you should add it to your Gemfile like so: gem 'sequel_pg' , require: 'sequel' Using a precompiled pg gem can cause issues in certain cases, since it statically links a libpq that could differ from the system libpq dynamically linked to the sequel_pg gem. You can work around the issue by forcing the ruby platform for the pg gem: # Manual install gem install pg --platform ruby # Gemfile gem 'pg', force_ruby_platform: true sequel_pg currently calls functions defined in the pg gem, which does not work on Windows and does not work in some unix-like operating systems that disallow undefined functions in shared libraries. If RbConfig::CONFIG['LDFLAGS'] contains -Wl,--no-undefined , you’ll probably have issues installing sequel_pg. You should probably fix RbConfig::CONFIG['LDFLAGS'] in that case. Author Jeremy Evans <code@jeremyevans.net> About Faster SELECTs when using Sequel with pg Resources Readme Uh oh! There was an error while loading. Please reload this page . Activity Stars 269 stars Watchers 5 watching Forks 23 forks Report repository Uh oh! There was an error while loading. Please reload this page . Contributors 9 Uh oh! There was an error while loading. Please reload this page . Languages C 78.6% Ruby 21.4% Footer © 2026 GitHub, Inc. Footer navigation Terms Privacy Security Status Community Docs Contact Manage cookies Do not share my personal information You can’t perform that action at this time. | 2026-01-13T09:30:24 |
http://hackage.haskell.org/package/semigroupoids-4.2/docs/src/Data-Semigroup-Foldable.html#fold1 | src/Data/Semigroup/Foldable.hs {-# LANGUAGE CPP #-} ----------------------------------------------------------------------------- -- | -- Module : Data.Semigroup.Foldable -- Copyright : (C) 2011 Edward Kmett -- License : BSD-style (see the file LICENSE) -- -- Maintainer : Edward Kmett <ekmett@gmail.com> -- Stability : provisional -- Portability : portable -- ---------------------------------------------------------------------------- module Data . Semigroup . Foldable ( Foldable1 ( .. ) , traverse1_ , for1_ , sequenceA1_ , foldMapDefault1 ) where import Control . Monad . Trans . Identity import Data . Foldable import Data . Functor . Identity import Data . Functor . Apply import Data . Functor . Product import Data . Functor . Compose import Data . List . NonEmpty ( NonEmpty ( .. ) ) import Data . Traversable . Instances () import Data . Semigroup hiding ( Product ) import Prelude hiding ( foldr ) #ifdef MIN_VERSION_containers import Data . Tree #endif #ifdef MIN_VERSION_comonad import Data . Functor . Coproduct #endif class Foldable t => Foldable1 t where fold1 :: Semigroup m => t m -> m foldMap1 :: Semigroup m => ( a -> m ) -> t a -> m foldMap1 f = maybe ( error "foldMap1" ) id . getOption . foldMap ( Option . Just . f ) fold1 = foldMap1 id #ifdef MIN_VERSION_containers instance Foldable1 Tree where foldMap1 f ( Node a [] ) = f a foldMap1 f ( Node a ( x : xs ) ) = f a <> foldMap1 ( foldMap1 f ) ( x :| xs ) #endif instance Foldable1 Identity where foldMap1 f = f . runIdentity instance Foldable1 m => Foldable1 ( IdentityT m ) where foldMap1 f = foldMap1 f . runIdentityT instance ( Foldable1 f , Foldable1 g ) => Foldable1 ( Compose f g ) where foldMap1 f = foldMap1 ( foldMap1 f ) . getCompose instance ( Foldable1 f , Foldable1 g ) => Foldable1 ( Product f g ) where foldMap1 f ( Pair a b ) = foldMap1 f a <> foldMap1 f b #ifdef MIN_VERSION_comonad instance ( Foldable1 f , Foldable1 g ) => Foldable1 ( Coproduct f g ) where foldMap1 f = coproduct ( foldMap1 f ) ( foldMap1 f ) #endif instance Foldable1 NonEmpty where foldMap1 f ( a :| [] ) = f a foldMap1 f ( a :| b : bs ) = f a <> foldMap1 f ( b :| bs ) instance Foldable1 ( (,) a ) where foldMap1 f ( _ , x ) = f x newtype Act f a = Act { getAct :: f a } instance Apply f => Semigroup ( Act f a ) where Act a <> Act b = Act ( a .> b ) instance Functor f => Functor ( Act f ) where fmap f ( Act a ) = Act ( f <$> a ) b <$ Act a = Act ( b <$ a ) traverse1_ :: ( Foldable1 t , Apply f ) => ( a -> f b ) -> t a -> f () traverse1_ f t = () <$ getAct ( foldMap1 ( Act . f ) t ) {-# INLINE traverse1_ #-} for1_ :: ( Foldable1 t , Apply f ) => t a -> ( a -> f b ) -> f () for1_ = flip traverse1_ {-# INLINE for1_ #-} sequenceA1_ :: ( Foldable1 t , Apply f ) => t ( f a ) -> f () sequenceA1_ t = () <$ getAct ( foldMap1 Act t ) {-# INLINE sequenceA1_ #-} -- | Usable default for foldMap, but only if you define foldMap1 yourself foldMapDefault1 :: ( Foldable1 t , Monoid m ) => ( a -> m ) -> t a -> m foldMapDefault1 f = unwrapMonoid . foldMap ( WrapMonoid . f ) {-# INLINE foldMapDefault1 #-} -- toStream :: Foldable1 t => t a -> Stream a -- concat1 :: Foldable1 t => t (Stream a) -> Stream a -- concatMap1 :: Foldable1 t => (a -> Stream b) -> t a -> Stream b | 2026-01-13T09:30:24 |
http://hackage.haskell.org/package/semigroupoids-4.2/docs/src/Data-Semigroupoid-Static.html#Static | src/Data/Semigroupoid/Static.hs {-# LANGUAGE CPP #-} #if defined(__GLASGOW_HASKELL__) && __GLASGOW_HASKELL__ >= 702 #ifdef MIN_VERSION_comonad #if __GLASGOW_HASKELL__ >= 707 && (MIN_VERSION_comonad(3,0,3)) {-# LANGUAGE Safe #-} #else {-# LANGUAGE Trustworthy #-} #endif #else {-# LANGUAGE Trustworthy #-} #endif #endif module Data . Semigroupoid . Static ( Static ( .. ) ) where import Control . Arrow import Control . Applicative import Control . Category #if defined(__GLASGOW_HASKELL__) && __GLASGOW_HASKELL__ < 707 import Control . Monad . Instances () #endif import Control . Monad ( ap ) import Data . Functor . Apply import Data . Functor . Plus import Data . Functor . Extend import Data . Semigroup import Data . Semigroupoid import Prelude hiding ( ( . ) , id ) #ifdef LANGUAGE_DeriveDataTypeable import Data . Typeable #endif #ifdef MIN_VERSION_comonad import Control . Comonad #endif newtype Static f a b = Static { runStatic :: f ( a -> b ) } #ifdef LANGUAGE_DeriveDataTypeable deriving ( Typeable ) #endif instance Functor f => Functor ( Static f a ) where fmap f = Static . fmap ( f . ) . runStatic instance Apply f => Apply ( Static f a ) where Static f <.> Static g = Static ( ap <$> f <.> g ) instance Alt f => Alt ( Static f a ) where Static f <!> Static g = Static ( f <!> g ) instance Plus f => Plus ( Static f a ) where zero = Static zero instance Applicative f => Applicative ( Static f a ) where pure = Static . pure . const Static f <*> Static g = Static ( ap <$> f <*> g ) instance ( Extend f , Semigroup a ) => Extend ( Static f a ) where extended f = Static . extended ( \ wf m -> f ( Static ( fmap ( . ( <> ) m ) wf ) ) ) . runStatic #ifdef MIN_VERSION_comonad instance ( Comonad f , Monoid a ) => Comonad ( Static f a ) where extend f = Static . extend ( \ wf m -> f ( Static ( fmap ( . mappend m ) wf ) ) ) . runStatic extract ( Static g ) = extract g mempty #endif instance Apply f => Semigroupoid ( Static f ) where Static f `o` Static g = Static ( ( . ) <$> f <.> g ) instance Applicative f => Category ( Static f ) where id = Static ( pure id ) Static f . Static g = Static ( ( . ) <$> f <*> g ) instance Applicative f => Arrow ( Static f ) where arr = Static . pure first ( Static g ) = Static ( first <$> g ) second ( Static g ) = Static ( second <$> g ) Static g *** Static h = Static ( ( *** ) <$> g <*> h ) Static g &&& Static h = Static ( ( &&& ) <$> g <*> h ) instance Alternative f => ArrowZero ( Static f ) where zeroArrow = Static empty instance Alternative f => ArrowPlus ( Static f ) where Static f <+> Static g = Static ( f <|> g ) instance Applicative f => ArrowChoice ( Static f ) where left ( Static g ) = Static ( left <$> g ) right ( Static g ) = Static ( right <$> g ) Static g +++ Static h = Static ( ( +++ ) <$> g <*> h ) Static g ||| Static h = Static ( ( ||| ) <$> g <*> h ) | 2026-01-13T09:30:24 |
http://hackage.haskell.org/package/semigroupoids-4.2/docs/src/Data-Semigroup-Foldable.html | src/Data/Semigroup/Foldable.hs {-# LANGUAGE CPP #-} ----------------------------------------------------------------------------- -- | -- Module : Data.Semigroup.Foldable -- Copyright : (C) 2011 Edward Kmett -- License : BSD-style (see the file LICENSE) -- -- Maintainer : Edward Kmett <ekmett@gmail.com> -- Stability : provisional -- Portability : portable -- ---------------------------------------------------------------------------- module Data . Semigroup . Foldable ( Foldable1 ( .. ) , traverse1_ , for1_ , sequenceA1_ , foldMapDefault1 ) where import Control . Monad . Trans . Identity import Data . Foldable import Data . Functor . Identity import Data . Functor . Apply import Data . Functor . Product import Data . Functor . Compose import Data . List . NonEmpty ( NonEmpty ( .. ) ) import Data . Traversable . Instances () import Data . Semigroup hiding ( Product ) import Prelude hiding ( foldr ) #ifdef MIN_VERSION_containers import Data . Tree #endif #ifdef MIN_VERSION_comonad import Data . Functor . Coproduct #endif class Foldable t => Foldable1 t where fold1 :: Semigroup m => t m -> m foldMap1 :: Semigroup m => ( a -> m ) -> t a -> m foldMap1 f = maybe ( error "foldMap1" ) id . getOption . foldMap ( Option . Just . f ) fold1 = foldMap1 id #ifdef MIN_VERSION_containers instance Foldable1 Tree where foldMap1 f ( Node a [] ) = f a foldMap1 f ( Node a ( x : xs ) ) = f a <> foldMap1 ( foldMap1 f ) ( x :| xs ) #endif instance Foldable1 Identity where foldMap1 f = f . runIdentity instance Foldable1 m => Foldable1 ( IdentityT m ) where foldMap1 f = foldMap1 f . runIdentityT instance ( Foldable1 f , Foldable1 g ) => Foldable1 ( Compose f g ) where foldMap1 f = foldMap1 ( foldMap1 f ) . getCompose instance ( Foldable1 f , Foldable1 g ) => Foldable1 ( Product f g ) where foldMap1 f ( Pair a b ) = foldMap1 f a <> foldMap1 f b #ifdef MIN_VERSION_comonad instance ( Foldable1 f , Foldable1 g ) => Foldable1 ( Coproduct f g ) where foldMap1 f = coproduct ( foldMap1 f ) ( foldMap1 f ) #endif instance Foldable1 NonEmpty where foldMap1 f ( a :| [] ) = f a foldMap1 f ( a :| b : bs ) = f a <> foldMap1 f ( b :| bs ) instance Foldable1 ( (,) a ) where foldMap1 f ( _ , x ) = f x newtype Act f a = Act { getAct :: f a } instance Apply f => Semigroup ( Act f a ) where Act a <> Act b = Act ( a .> b ) instance Functor f => Functor ( Act f ) where fmap f ( Act a ) = Act ( f <$> a ) b <$ Act a = Act ( b <$ a ) traverse1_ :: ( Foldable1 t , Apply f ) => ( a -> f b ) -> t a -> f () traverse1_ f t = () <$ getAct ( foldMap1 ( Act . f ) t ) {-# INLINE traverse1_ #-} for1_ :: ( Foldable1 t , Apply f ) => t a -> ( a -> f b ) -> f () for1_ = flip traverse1_ {-# INLINE for1_ #-} sequenceA1_ :: ( Foldable1 t , Apply f ) => t ( f a ) -> f () sequenceA1_ t = () <$ getAct ( foldMap1 Act t ) {-# INLINE sequenceA1_ #-} -- | Usable default for foldMap, but only if you define foldMap1 yourself foldMapDefault1 :: ( Foldable1 t , Monoid m ) => ( a -> m ) -> t a -> m foldMapDefault1 f = unwrapMonoid . foldMap ( WrapMonoid . f ) {-# INLINE foldMapDefault1 #-} -- toStream :: Foldable1 t => t a -> Stream a -- concat1 :: Foldable1 t => t (Stream a) -> Stream a -- concatMap1 :: Foldable1 t => (a -> Stream b) -> t a -> Stream b | 2026-01-13T09:30:24 |
http://hackage.haskell.org/package/semigroupoids-4.2/docs/src/Data-Semigroup-Foldable.html#foldMap1 | src/Data/Semigroup/Foldable.hs {-# LANGUAGE CPP #-} ----------------------------------------------------------------------------- -- | -- Module : Data.Semigroup.Foldable -- Copyright : (C) 2011 Edward Kmett -- License : BSD-style (see the file LICENSE) -- -- Maintainer : Edward Kmett <ekmett@gmail.com> -- Stability : provisional -- Portability : portable -- ---------------------------------------------------------------------------- module Data . Semigroup . Foldable ( Foldable1 ( .. ) , traverse1_ , for1_ , sequenceA1_ , foldMapDefault1 ) where import Control . Monad . Trans . Identity import Data . Foldable import Data . Functor . Identity import Data . Functor . Apply import Data . Functor . Product import Data . Functor . Compose import Data . List . NonEmpty ( NonEmpty ( .. ) ) import Data . Traversable . Instances () import Data . Semigroup hiding ( Product ) import Prelude hiding ( foldr ) #ifdef MIN_VERSION_containers import Data . Tree #endif #ifdef MIN_VERSION_comonad import Data . Functor . Coproduct #endif class Foldable t => Foldable1 t where fold1 :: Semigroup m => t m -> m foldMap1 :: Semigroup m => ( a -> m ) -> t a -> m foldMap1 f = maybe ( error "foldMap1" ) id . getOption . foldMap ( Option . Just . f ) fold1 = foldMap1 id #ifdef MIN_VERSION_containers instance Foldable1 Tree where foldMap1 f ( Node a [] ) = f a foldMap1 f ( Node a ( x : xs ) ) = f a <> foldMap1 ( foldMap1 f ) ( x :| xs ) #endif instance Foldable1 Identity where foldMap1 f = f . runIdentity instance Foldable1 m => Foldable1 ( IdentityT m ) where foldMap1 f = foldMap1 f . runIdentityT instance ( Foldable1 f , Foldable1 g ) => Foldable1 ( Compose f g ) where foldMap1 f = foldMap1 ( foldMap1 f ) . getCompose instance ( Foldable1 f , Foldable1 g ) => Foldable1 ( Product f g ) where foldMap1 f ( Pair a b ) = foldMap1 f a <> foldMap1 f b #ifdef MIN_VERSION_comonad instance ( Foldable1 f , Foldable1 g ) => Foldable1 ( Coproduct f g ) where foldMap1 f = coproduct ( foldMap1 f ) ( foldMap1 f ) #endif instance Foldable1 NonEmpty where foldMap1 f ( a :| [] ) = f a foldMap1 f ( a :| b : bs ) = f a <> foldMap1 f ( b :| bs ) instance Foldable1 ( (,) a ) where foldMap1 f ( _ , x ) = f x newtype Act f a = Act { getAct :: f a } instance Apply f => Semigroup ( Act f a ) where Act a <> Act b = Act ( a .> b ) instance Functor f => Functor ( Act f ) where fmap f ( Act a ) = Act ( f <$> a ) b <$ Act a = Act ( b <$ a ) traverse1_ :: ( Foldable1 t , Apply f ) => ( a -> f b ) -> t a -> f () traverse1_ f t = () <$ getAct ( foldMap1 ( Act . f ) t ) {-# INLINE traverse1_ #-} for1_ :: ( Foldable1 t , Apply f ) => t a -> ( a -> f b ) -> f () for1_ = flip traverse1_ {-# INLINE for1_ #-} sequenceA1_ :: ( Foldable1 t , Apply f ) => t ( f a ) -> f () sequenceA1_ t = () <$ getAct ( foldMap1 Act t ) {-# INLINE sequenceA1_ #-} -- | Usable default for foldMap, but only if you define foldMap1 yourself foldMapDefault1 :: ( Foldable1 t , Monoid m ) => ( a -> m ) -> t a -> m foldMapDefault1 f = unwrapMonoid . foldMap ( WrapMonoid . f ) {-# INLINE foldMapDefault1 #-} -- toStream :: Foldable1 t => t a -> Stream a -- concat1 :: Foldable1 t => t (Stream a) -> Stream a -- concatMap1 :: Foldable1 t => (a -> Stream b) -> t a -> Stream b | 2026-01-13T09:30:24 |
https://github.com/sailorhg | sailorhg (Amy) · GitHub Skip to content Navigation Menu Toggle navigation Sign in Appearance settings Platform AI CODE CREATION GitHub Copilot Write better code with AI GitHub Spark Build and deploy intelligent apps GitHub Models Manage and compare prompts MCP Registry New Integrate external tools DEVELOPER WORKFLOWS Actions Automate any workflow Codespaces Instant dev environments Issues Plan and track work Code Review Manage code changes APPLICATION SECURITY GitHub Advanced Security Find and fix vulnerabilities Code security Secure your code as you build Secret protection Stop leaks before they start EXPLORE Why GitHub Documentation Blog Changelog Marketplace View all features Solutions BY COMPANY SIZE Enterprises Small and medium teams Startups Nonprofits BY USE CASE App Modernization DevSecOps DevOps CI/CD View all use cases BY INDUSTRY Healthcare Financial services Manufacturing Government View all industries View all solutions Resources EXPLORE BY TOPIC AI Software Development DevOps Security View all topics EXPLORE BY TYPE Customer stories Events & webinars Ebooks & reports Business insights GitHub Skills SUPPORT & SERVICES Documentation Customer support Community forum Trust center Partners Open Source COMMUNITY GitHub Sponsors Fund open source developers PROGRAMS Security Lab Maintainer Community Accelerator Archive Program REPOSITORIES Topics Trending Collections Enterprise ENTERPRISE SOLUTIONS Enterprise platform AI-powered developer platform AVAILABLE ADD-ONS GitHub Advanced Security Enterprise-grade security features Copilot for Business Enterprise-grade AI features Premium Support Enterprise-grade 24/7 support Pricing Search or jump to... Search code, repositories, users, issues, pull requests... --> Search Clear Search syntax tips Provide feedback --> We read every piece of feedback, and take your input very seriously. Include my email address so I can be contacted Cancel Submit feedback Saved searches Use saved searches to filter your results more quickly --> Name Query To see all available qualifiers, see our documentation . Cancel Create saved search Sign in Sign up Appearance settings Resetting focus You signed in with another tab or window. Reload to refresh your session. You signed out in another tab or window. Reload to refresh your session. You switched accounts on another tab or window. Reload to refresh your session. Dismiss alert {{ message }} sailorhg Follow Overview Repositories 13 Projects 0 Packages 0 Stars 3 More Overview Repositories Projects Packages Stars sailorhg Follow Amy sailorhg Follow 276 followers · 0 following Achievements x2 Achievements x2 Highlights Pro Block or Report Block or report sailorhg --> Block user Prevent this user from interacting with your repositories and sending you notifications. Learn more about blocking users . You must be logged in to block users. Add an optional note Maximum 250 characters. Please don't include any personal information such as legal names or email addresses. Markdown supported. This note will be visible to only you. Block user Report abuse Contact GitHub support about this user’s behavior. Learn more about reporting abuse . Report abuse Overview Repositories 13 Projects 0 Packages 0 Stars 3 More Overview Repositories Projects Packages Stars Popular repositories Loading fairyfloss fairyfloss Public fairy floss text editor theme CSS 312 46 pedalpushersweb pedalpushersweb Public HTML 3 knit knit Public Forked from apang42/knit Python 2 scrollme scrollme Public Forked from nckprsn/scrollme A jQuery plugin for adding simple scrolling effects to web pages. JavaScript 2 glitchy glitchy Public 2 jasmine-ajax jasmine-ajax Public Forked from jasmine/jasmine-ajax JavaScript 1 Something went wrong, please refresh the page to try again. If the problem persists, check the GitHub status page or contact support . Uh oh! There was an error while loading. Please reload this page . Footer © 2026 GitHub, Inc. Footer navigation Terms Privacy Security Status Community Docs Contact Manage cookies Do not share my personal information You can’t perform that action at this time. | 2026-01-13T09:30:24 |
https://rubygems.org/gems/asciidoctor/versions/2.0.26?locale=de | asciidoctor | RubyGems.org | Ihre Community des Gem-Hostingservices ⬢ RubyGems nav#focus mousedown->nav#mouseDown click@window->nav#hide"> Navigation menu autocomplete#choose mouseover->autocomplete#highlight"> Suche Gems… Releases Blog Gems Dokumentation Anmelden Registrieren asciidoctor 2.0.26 A fast, open source text processor and publishing toolchain for converting AsciiDoc content to HTML 5, DocBook 5, and other formats. Gemfile: = installieren: = Versionen: 2.0.26 October 24, 2025 (278 KB) 2.0.25 October 16, 2025 (278 KB) 2.0.24 October 13, 2025 (278 KB) 2.0.23 May 17, 2024 (277 KB) 2.0.22 March 08, 2024 (276 KB) Zeige alle Versionen (78 total) Development Abhängigkeiten (9): concurrent-ruby ~> 1.1.0 cucumber ~> 3.1.0 erubi ~> 1.10.0 haml ~> 6.3.0 minitest ~> 5.22.0 nokogiri ~> 1.13.0 rake ~> 12.3.0 slim ~> 4.1.0 tilt ~> 2.0.0 Alle transitiven Abhängigkeiten anzeigen Besitzer: Pushed by: Autoren: Dan Allen, Sarah White, Ryan Waldron, Jason Porter, Nick Hengeveld, Jeremy McAnally SHA 256-Prüfsumme: = ← Previous version Downloads insgesamt 52.497.923 Für diese Version 363.442 Version veröffentlicht: October 24, 2025 1:49am Lizenz: MIT Erforderliche Ruby-Version: >= 0 Links: Homepage Changelog Quellcode Mailingliste Bug Tracker Download Funding Review changes Abzeichen Abonniere RSS Missbrauch melden Reverse dependencies Status Betriebszeit Code Daten Statistiken Beitragen Über uns Hilfe API Policies Support Us Security RubyGems.org ist der Gem-Hosting-Dienst der Ruby-Community. Veröffentlichen Sie Ihre Gems sofort und installieren Sie sie dann . Verwenden Sie die API , um mehr über verfügbare Gems herauszufinden. Werden Sie ein Mitwirkender und verbessern Sie die Website selbst. RubyGems.org wird durch eine Partnerschaft mit der breiteren Ruby-Gemeinschaft ermöglicht. Fastly , der Anbieter von Bandbreite und CDN-Support, Ruby Central , das die Infrastrukturkosten trägt, und die Finanzierung der Entwicklung und Verwaltung der Server übernimmt. Erfahren Sie mehr über unsere Sponsoren und wie sie zusammenarbeiten. Operated by Ruby Central Design von DockYard Gehostet von AWS Aufgelöst mit DNSimple Überwacht von Datadog Gems angeboten von Fastly Überwacht von Honeybadger Secured by Mend.io English Nederlands 简体中文 正體中文 Português do Brasil Français Español Deutsch 日本語 | 2026-01-13T09:30:24 |
http://hackage.haskell.org/package/semigroupoids-4.2/docs/src/Data-Semigroup-Foldable.html#Foldable1 | src/Data/Semigroup/Foldable.hs {-# LANGUAGE CPP #-} ----------------------------------------------------------------------------- -- | -- Module : Data.Semigroup.Foldable -- Copyright : (C) 2011 Edward Kmett -- License : BSD-style (see the file LICENSE) -- -- Maintainer : Edward Kmett <ekmett@gmail.com> -- Stability : provisional -- Portability : portable -- ---------------------------------------------------------------------------- module Data . Semigroup . Foldable ( Foldable1 ( .. ) , traverse1_ , for1_ , sequenceA1_ , foldMapDefault1 ) where import Control . Monad . Trans . Identity import Data . Foldable import Data . Functor . Identity import Data . Functor . Apply import Data . Functor . Product import Data . Functor . Compose import Data . List . NonEmpty ( NonEmpty ( .. ) ) import Data . Traversable . Instances () import Data . Semigroup hiding ( Product ) import Prelude hiding ( foldr ) #ifdef MIN_VERSION_containers import Data . Tree #endif #ifdef MIN_VERSION_comonad import Data . Functor . Coproduct #endif class Foldable t => Foldable1 t where fold1 :: Semigroup m => t m -> m foldMap1 :: Semigroup m => ( a -> m ) -> t a -> m foldMap1 f = maybe ( error "foldMap1" ) id . getOption . foldMap ( Option . Just . f ) fold1 = foldMap1 id #ifdef MIN_VERSION_containers instance Foldable1 Tree where foldMap1 f ( Node a [] ) = f a foldMap1 f ( Node a ( x : xs ) ) = f a <> foldMap1 ( foldMap1 f ) ( x :| xs ) #endif instance Foldable1 Identity where foldMap1 f = f . runIdentity instance Foldable1 m => Foldable1 ( IdentityT m ) where foldMap1 f = foldMap1 f . runIdentityT instance ( Foldable1 f , Foldable1 g ) => Foldable1 ( Compose f g ) where foldMap1 f = foldMap1 ( foldMap1 f ) . getCompose instance ( Foldable1 f , Foldable1 g ) => Foldable1 ( Product f g ) where foldMap1 f ( Pair a b ) = foldMap1 f a <> foldMap1 f b #ifdef MIN_VERSION_comonad instance ( Foldable1 f , Foldable1 g ) => Foldable1 ( Coproduct f g ) where foldMap1 f = coproduct ( foldMap1 f ) ( foldMap1 f ) #endif instance Foldable1 NonEmpty where foldMap1 f ( a :| [] ) = f a foldMap1 f ( a :| b : bs ) = f a <> foldMap1 f ( b :| bs ) instance Foldable1 ( (,) a ) where foldMap1 f ( _ , x ) = f x newtype Act f a = Act { getAct :: f a } instance Apply f => Semigroup ( Act f a ) where Act a <> Act b = Act ( a .> b ) instance Functor f => Functor ( Act f ) where fmap f ( Act a ) = Act ( f <$> a ) b <$ Act a = Act ( b <$ a ) traverse1_ :: ( Foldable1 t , Apply f ) => ( a -> f b ) -> t a -> f () traverse1_ f t = () <$ getAct ( foldMap1 ( Act . f ) t ) {-# INLINE traverse1_ #-} for1_ :: ( Foldable1 t , Apply f ) => t a -> ( a -> f b ) -> f () for1_ = flip traverse1_ {-# INLINE for1_ #-} sequenceA1_ :: ( Foldable1 t , Apply f ) => t ( f a ) -> f () sequenceA1_ t = () <$ getAct ( foldMap1 Act t ) {-# INLINE sequenceA1_ #-} -- | Usable default for foldMap, but only if you define foldMap1 yourself foldMapDefault1 :: ( Foldable1 t , Monoid m ) => ( a -> m ) -> t a -> m foldMapDefault1 f = unwrapMonoid . foldMap ( WrapMonoid . f ) {-# INLINE foldMapDefault1 #-} -- toStream :: Foldable1 t => t a -> Stream a -- concat1 :: Foldable1 t => t (Stream a) -> Stream a -- concatMap1 :: Foldable1 t => (a -> Stream b) -> t a -> Stream b | 2026-01-13T09:30:24 |
http://hackage.haskell.org/package/semigroupoids-4.2/docs/src/Data-Semigroup-Foldable.html#foldMapDefault1 | src/Data/Semigroup/Foldable.hs {-# LANGUAGE CPP #-} ----------------------------------------------------------------------------- -- | -- Module : Data.Semigroup.Foldable -- Copyright : (C) 2011 Edward Kmett -- License : BSD-style (see the file LICENSE) -- -- Maintainer : Edward Kmett <ekmett@gmail.com> -- Stability : provisional -- Portability : portable -- ---------------------------------------------------------------------------- module Data . Semigroup . Foldable ( Foldable1 ( .. ) , traverse1_ , for1_ , sequenceA1_ , foldMapDefault1 ) where import Control . Monad . Trans . Identity import Data . Foldable import Data . Functor . Identity import Data . Functor . Apply import Data . Functor . Product import Data . Functor . Compose import Data . List . NonEmpty ( NonEmpty ( .. ) ) import Data . Traversable . Instances () import Data . Semigroup hiding ( Product ) import Prelude hiding ( foldr ) #ifdef MIN_VERSION_containers import Data . Tree #endif #ifdef MIN_VERSION_comonad import Data . Functor . Coproduct #endif class Foldable t => Foldable1 t where fold1 :: Semigroup m => t m -> m foldMap1 :: Semigroup m => ( a -> m ) -> t a -> m foldMap1 f = maybe ( error "foldMap1" ) id . getOption . foldMap ( Option . Just . f ) fold1 = foldMap1 id #ifdef MIN_VERSION_containers instance Foldable1 Tree where foldMap1 f ( Node a [] ) = f a foldMap1 f ( Node a ( x : xs ) ) = f a <> foldMap1 ( foldMap1 f ) ( x :| xs ) #endif instance Foldable1 Identity where foldMap1 f = f . runIdentity instance Foldable1 m => Foldable1 ( IdentityT m ) where foldMap1 f = foldMap1 f . runIdentityT instance ( Foldable1 f , Foldable1 g ) => Foldable1 ( Compose f g ) where foldMap1 f = foldMap1 ( foldMap1 f ) . getCompose instance ( Foldable1 f , Foldable1 g ) => Foldable1 ( Product f g ) where foldMap1 f ( Pair a b ) = foldMap1 f a <> foldMap1 f b #ifdef MIN_VERSION_comonad instance ( Foldable1 f , Foldable1 g ) => Foldable1 ( Coproduct f g ) where foldMap1 f = coproduct ( foldMap1 f ) ( foldMap1 f ) #endif instance Foldable1 NonEmpty where foldMap1 f ( a :| [] ) = f a foldMap1 f ( a :| b : bs ) = f a <> foldMap1 f ( b :| bs ) instance Foldable1 ( (,) a ) where foldMap1 f ( _ , x ) = f x newtype Act f a = Act { getAct :: f a } instance Apply f => Semigroup ( Act f a ) where Act a <> Act b = Act ( a .> b ) instance Functor f => Functor ( Act f ) where fmap f ( Act a ) = Act ( f <$> a ) b <$ Act a = Act ( b <$ a ) traverse1_ :: ( Foldable1 t , Apply f ) => ( a -> f b ) -> t a -> f () traverse1_ f t = () <$ getAct ( foldMap1 ( Act . f ) t ) {-# INLINE traverse1_ #-} for1_ :: ( Foldable1 t , Apply f ) => t a -> ( a -> f b ) -> f () for1_ = flip traverse1_ {-# INLINE for1_ #-} sequenceA1_ :: ( Foldable1 t , Apply f ) => t ( f a ) -> f () sequenceA1_ t = () <$ getAct ( foldMap1 Act t ) {-# INLINE sequenceA1_ #-} -- | Usable default for foldMap, but only if you define foldMap1 yourself foldMapDefault1 :: ( Foldable1 t , Monoid m ) => ( a -> m ) -> t a -> m foldMapDefault1 f = unwrapMonoid . foldMap ( WrapMonoid . f ) {-# INLINE foldMapDefault1 #-} -- toStream :: Foldable1 t => t a -> Stream a -- concat1 :: Foldable1 t => t (Stream a) -> Stream a -- concatMap1 :: Foldable1 t => (a -> Stream b) -> t a -> Stream b | 2026-01-13T09:30:24 |
https://rubygems.org/gems/asciidoctor/versions/2.0.26?locale=fr | asciidoctor | RubyGems.org | votre communauté d'hébergement des gems ⬢ RubyGems nav#focus mousedown->nav#mouseDown click@window->nav#hide"> Navigation menu autocomplete#choose mouseover->autocomplete#highlight"> Recherche de Gems… Releases Blog Gems Guides Connexion Inscription asciidoctor 2.0.26 A fast, open source text processor and publishing toolchain for converting AsciiDoc content to HTML 5, DocBook 5, and other formats. Gemfile: = installation: = Versions: 2.0.26 October 24, 2025 (278 ko) 2.0.25 October 16, 2025 (278 ko) 2.0.24 October 13, 2025 (278 ko) 2.0.23 May 17, 2024 (277 ko) 2.0.22 March 08, 2024 (276 ko) Voir toutes les versions (78) Dépendances de Development (9): concurrent-ruby ~> 1.1.0 cucumber ~> 3.1.0 erubi ~> 1.10.0 haml ~> 6.3.0 minitest ~> 5.22.0 nokogiri ~> 1.13.0 rake ~> 12.3.0 slim ~> 4.1.0 tilt ~> 2.0.0 Show all transitive dependencies Propriétaires: Pushed by: Auteurs: Dan Allen, Sarah White, Ryan Waldron, Jason Porter, Nick Hengeveld, Jeremy McAnally Total de contrôle SHA 256: = ← Version précédente Total de téléchargements 52 497 923 Pour cette version 363 442 Version publiée: October 24, 2025 1:49am License: MIT Version de Ruby requise: >= 0 Liens: Page d'accueil Changelog Code Source Liste de diffusion Suivi de bugs Télécharger Funding Review changes Badge Abonnement RSS Signaler un abus Reverse dependencies Statut Uptime Code Données Stats Contribuer À propos Aide API Policies Support Us Security RubyGems.org est le service d’hébergement de la communauté Ruby. Publiez vos gems instantanément et utilisez-les. Utilisez l'API pour interagir et trouver des informations sur les gems disponibles. Contribuez et améliorez ce site avec nous ! RubyGems.org est rendu possible grâce à un partenariat avec la communauté Ruby au sens large. Fastly fournisseur de bande passante et du support CDN, Ruby Central qui couvre les frais d'infrastructure, et qui finance le développement et l'administration des serveurs. Apprenez en plus sur nos sponsors et comment ils travaillent entre eux. Operated by Ruby Central Design par DockYard Hébergé par AWS Résolu par DNSimple Monitoring par Datadog Gems mis à disposition par Fastly Monitoring par Honeybadger Secured by Mend.io English Nederlands 简体中文 正體中文 Português do Brasil Français Español Deutsch 日本語 | 2026-01-13T09:30:24 |
https://rubygems.org/gems/enum_csv | enum_csv | RubyGems.org | your community gem host ⬢ RubyGems nav#focus mousedown->nav#mouseDown click@window->nav#hide"> Navigation menu autocomplete#choose mouseover->autocomplete#highlight"> Search Gems… Releases Blog Gems Guides Sign in Sign up enum_csv 1.2.0 EnumCSV exposes a single method, csv, for easily creating CSV output/files from enumerable objects. Gemfile: = install: = Versions: 1.2.0 September 19, 2023 (6.5 KB) 1.1.1 February 01, 2020 (6.5 KB) 1.1.0 January 27, 2015 (7.5 KB) 1.0.0 December 18, 2013 (7.5 KB) Runtime Dependencies (1): csv >= 0 Development Dependencies (2): minitest >= 0 minitest-global_expectations >= 0 Show all transitive dependencies Owners: Pushed by: Authors: Jeremy Evans SHA 256 checksum: = ← Previous version Total downloads 31,269 For this version 7,894 Version Released: September 19, 2023 6:45pm License: MIT Required Ruby Version: >= 2.3 Links: Homepage Changelog Source Code Bug Tracker Download Review changes Badge Subscribe RSS Report abuse Reverse dependencies Status Uptime Code Data Stats Contribute About Help API Policies Support Us Security RubyGems.org is the Ruby community’s gem hosting service. Instantly publish your gems and then install them . Use the API to find out more about available gems . Become a contributor and improve the site yourself. The RubyGems.org website and service are maintained and operated by Ruby Central’s Open Source Program and the RubyGems team. It is funded by the greater Ruby community through support from sponsors, members, and infrastructure donations. If you build with Ruby and believe in our mission, you can join us in keeping RubyGems.org, RubyGems, and Bundler secure and sustainable for years to come by contributing here . Operated by Ruby Central Designed by DockYard Hosted by AWS Resolved with DNSimple Monitored by Datadog Gems served by Fastly Monitored by Honeybadger Secured by Mend.io English Nederlands 简体中文 正體中文 Português do Brasil Français Español Deutsch 日本語 | 2026-01-13T09:30:24 |
https://docs.asciidoctor.org/asciidoctorj/latest/distribution/ | Distribution | Asciidoctor Docs Asciidoctor Docs In this project AsciiDoc Language Syntax Quick Reference Processing Asciidoctor Ruby Asciidoctor.js JavaScript AsciidoctorJ Java Extensions Add-on Converters PDF Ruby EPUB3 Ruby reveal.js Ruby, JavaScript Source Compilers Reducer Ruby, JavaScript Extended Syntax Asciidoctor Diagram Ruby Tooling Build Automation Maven Tools Java Gradle Plugin Java Asciidoclet Java Text Editors / Viewers Browser Extension IntelliJ Plugin Chat List --> Source Tweets AsciidoctorJ Distribution Installation Usage Command Line Interface Convert Documents The Asciidoctor Interface Conversion Options Locate Files Safe Modes Examples Converting to EPUB3 Ruby Runtime Register a Ruby Extension Logs Handling API Read the Document Tree Write a Custom Converter Extensions API AsciidoctorJ Conversion Process Overview Understanding the AST Classes Write an Extension Block Macro Processor Inline Macro Processor Block Processor Include Processor Preprocessor Postprocessor Treeprocessor Docinfo Processor Register Extensions Manually Registering Extensions with javaExtensionRegistry Bulk Extension Registration ( Extension Groups ) Automatically Loading Extensions Logging Syntax Highlighter API Implement a Syntax Highlighter Adapter Lifecycle of a SyntaxHighlighterAdapter Format the Source Block Element Link and Copy External Resources Static Syntax Highlighting During Conversion Invocation Order Automatically Load a Syntax Highlighter Help & Guides Updating to New Releases v3.0.x migration guide Extension Migration: 1.6.x to 2.0.x Extension Migration: 1.5.x to 1.6.x Running in Frameworks Using AsciidoctorJ in an OSGi environment Running AsciidoctorJ on WildFly Running AsciidoctorJ with Spring Boot Accessing the JRuby Instance Loading Ruby Libraries Loading External Gems with GEM_PATH Optimization Using a pre-release version Using a Snapshot Version Development Project Layout Local Development Develop in an IDE Continuous Integration AsciidoctorJ 3.0 AsciiDoc Asciidoctor 2.0 Asciidoctor.js 3.0 2.2 AsciidoctorJ 3.0 2.5 Asciidoctor PDF 2.3 2.2 2.1 2.0 Asciidoctor EPUB3 2.3 Asciidoctor reveal.js 5.0 4.1 Maven Tools 3.2 Gradle Plugin Suite 5.0 4.0 Asciidoclet 2.0 1.5.6 Asciidoctor Diagram 3.0.1 Browser Extension Community AsciidoctorJ Distribution 3.0 3.0 2.5 Edit this Page Distribution AsciidoctorJ is published to Maven Central. The artifact information can be found in the tables below. Artifact information for AsciidoctorJ in Maven Central Group Id Artifact Id Version Download org.asciidoctor asciidoctorj 3.0.0 pom jar javadoc (jar) sources (jar) distribution (zip) org.asciidoctor asciidoctorj-api 3.0.0 pom jar javadoc (jar) sources (jar) org.asciidoctor asciidoctorj-epub3 1.5.1 org.asciidoctor asciidoctorj-pdf 2.3.6 The artifactId changed to asciidoctorj starting in 1.5.0. AsciidoctorJ Installation Asciidoctor Home --> Docs Chat Source List (archive) @asciidoctor Copyright © 2026 Dan Allen, Sarah White, and individual Asciidoctor contributors. Except where noted, the content is licensed under a Creative Commons Attribution 4.0 International (CC BY 4.0) license. The UI for this site is derived from the Antora default UI and is licensed under the MPL-2.0 license. Several icons are imported from Octicons and are licensed under the MIT license. AsciiDoc® and AsciiDoc Language™ are trademarks of the Eclipse Foundation, Inc. Thanks to our backers and contributors for helping to make this project possible. Additional thanks to: Authored in AsciiDoc . Produced by Antora and Asciidoctor . | 2026-01-13T09:30:24 |
https://rubygems.org/gems/asciidoctor/versions/2.0.26 | asciidoctor | RubyGems.org | your community gem host ⬢ RubyGems nav#focus mousedown->nav#mouseDown click@window->nav#hide"> Navigation menu autocomplete#choose mouseover->autocomplete#highlight"> Search Gems… Releases Blog Gems Guides Sign in Sign up asciidoctor 2.0.26 A fast, open source text processor and publishing toolchain for converting AsciiDoc content to HTML 5, DocBook 5, and other formats. Gemfile: = install: = Versions: 2.0.26 October 24, 2025 (278 KB) 2.0.25 October 16, 2025 (278 KB) 2.0.24 October 13, 2025 (278 KB) 2.0.23 May 17, 2024 (277 KB) 2.0.22 March 08, 2024 (276 KB) Show all versions (78 total) Development Dependencies (9): concurrent-ruby ~> 1.1.0 cucumber ~> 3.1.0 erubi ~> 1.10.0 haml ~> 6.3.0 minitest ~> 5.22.0 nokogiri ~> 1.13.0 rake ~> 12.3.0 slim ~> 4.1.0 tilt ~> 2.0.0 Show all transitive dependencies Owners: Pushed by: Authors: Dan Allen, Sarah White, Ryan Waldron, Jason Porter, Nick Hengeveld, Jeremy McAnally SHA 256 checksum: = ← Previous version Total downloads 52,497,923 For this version 363,442 Version Released: October 24, 2025 1:49am License: MIT Required Ruby Version: >= 0 Links: Homepage Changelog Source Code Mailing List Bug Tracker Download Funding Review changes Badge Subscribe RSS Report abuse Reverse dependencies Status Uptime Code Data Stats Contribute About Help API Policies Support Us Security RubyGems.org is the Ruby community’s gem hosting service. Instantly publish your gems and then install them . Use the API to find out more about available gems . Become a contributor and improve the site yourself. The RubyGems.org website and service are maintained and operated by Ruby Central’s Open Source Program and the RubyGems team. It is funded by the greater Ruby community through support from sponsors, members, and infrastructure donations. If you build with Ruby and believe in our mission, you can join us in keeping RubyGems.org, RubyGems, and Bundler secure and sustainable for years to come by contributing here . Operated by Ruby Central Designed by DockYard Hosted by AWS Resolved with DNSimple Monitored by Datadog Gems served by Fastly Monitored by Honeybadger Secured by Mend.io English Nederlands 简体中文 正體中文 Português do Brasil Français Español Deutsch 日本語 | 2026-01-13T09:30:24 |
https://docs.asciidoctor.org/pdf-converter/latest/ | Asciidoctor PDF Documentation | Asciidoctor Docs Asciidoctor Docs In this project AsciiDoc Language Syntax Quick Reference Processing Asciidoctor Ruby Asciidoctor.js JavaScript AsciidoctorJ Java Extensions Add-on Converters PDF Ruby EPUB3 Ruby reveal.js Ruby, JavaScript Source Compilers Reducer Ruby, JavaScript Extended Syntax Asciidoctor Diagram Ruby Tooling Build Automation Maven Tools Java Gradle Plugin Java Asciidoclet Java Text Editors / Viewers Browser Extension IntelliJ Plugin Chat List --> Source Tweets Asciidoctor PDF What’s New Features Install Asciidoctor PDF Upgrade to Asciidoctor PDF 2 Convert AsciiDoc to PDF Images Image Paths and Formats Image Scaling Inline Images Background Images Import PDF Pages Font and Image Icons Interdocument Xrefs Roles Breakable and Unbreakable Blocks Syntax Highlighting Autofit Text STEM Passthrough Content Autowidth Tables Hide Section Titles Title Page TOC PDF Outline Index Catalog Page Numbers AsciiDoc Attributes for PDF Optimize the PDF Theming Create a Theme Apply a Theme Theme Keys Extends Font Page Base Role Abstract Admonition Block Block Image Button Callout List and Number Caption Code Block Codespan Cover Description List Example Footnotes Heading Index Keyboard Link List Mark Menu Prose (Paragraph Text) Quote Quotes Running Content Section Sidebar SVG Table Thematic Break Title Page TOC Verse Theme Language Measurement Units Colors Variables Math Operations Quoted String Block Styles Block Image Styles Table Styles Text Styles Fonts Use Custom Fonts Prepare a Custom Font Fallback Fonts Create a CJK Theme Custom Roles Theme Images Covers Title Page Add Running Content Configure the Page Numbers Print and Prepress Modes Source Highlighting Themes Extend the PDF Converter Create a Converter Use the Converter Use Cases Asciidoctor PDF 2.3 AsciiDoc Asciidoctor 2.0 Asciidoctor.js 3.0 2.2 AsciidoctorJ 3.0 2.5 Asciidoctor PDF 2.3 2.2 2.1 2.0 Asciidoctor EPUB3 2.3 Asciidoctor reveal.js 5.0 4.1 Maven Tools 3.2 Gradle Plugin Suite 5.0 4.0 Asciidoclet 2.0 1.5.6 Asciidoctor Diagram 3.0.1 Browser Extension Community Asciidoctor PDF Introduction 2.3 2.3 2.2 2.1 2.0 Edit this Page Asciidoctor PDF Documentation Asciidoctor PDF is a native PDF converter for AsciiDoc that plugs into the pdf backend. It bypasses the requirement to generate an intermediary format such as DocBook, Apache FO, or LaTeX. Instead, you can use Asciidoctor PDF to convert your documents directly from AsciiDoc to PDF. The aim of this library is to take the pain out of creating PDF documents from AsciiDoc. You’re viewing the documentation for Asciidoctor PDF 2.3. If you’re looking for the documentation for Asciidoctor PDF 1.6, refer to the README in the v1.6.x branch. Asciidoctor PDF < 2 is EOL and is thus no longer being developed. You’re encouraged to migrate to Asciidoctor PDF 2 as soon as possible. Overview Asciidoctor PDF converts an AsciiDoc document directly to a PDF document. The style and layout of the PDF are controlled by a dedicated theme file. To the degree possible, Asciidoctor PDF supports all the features of AsciiDoc that are supported by Asciidoctor. It also provides additional PDF-specific features . However, there are certain limits imposed by the PDF format and the underlying PDF library this extension uses. Asciidoctor PDF uses the Prawn gem and Prawn’s extensions, such as prawn-svg and prawn-table, to generate a PDF document. Prawn is a general purpose PDF generator for Ruby that features high-level APIs for common needs like setting up the page and inserting images and low-level APIs for positioning and rendering text and graphics. What’s New Asciidoctor Home --> Docs Chat Source List (archive) @asciidoctor Copyright © 2026 Dan Allen, Sarah White, and individual Asciidoctor contributors. Except where noted, the content is licensed under a Creative Commons Attribution 4.0 International (CC BY 4.0) license. The UI for this site is derived from the Antora default UI and is licensed under the MPL-2.0 license. Several icons are imported from Octicons and are licensed under the MIT license. AsciiDoc® and AsciiDoc Language™ are trademarks of the Eclipse Foundation, Inc. Thanks to our backers and contributors for helping to make this project possible. Additional thanks to: Authored in AsciiDoc . Produced by Antora and Asciidoctor . | 2026-01-13T09:30:24 |
http://heisenbug.blogspot.com/2010/11/applicative-structures-and-thrists.html#sidebar | don't count on finding me: Applicative Structures and Thrists skip to main | skip to sidebar don't count on finding me Saturday, November 27, 2010 Applicative Structures and Thrists I've been toying with the idea of furnishing the the applicative framework into thrist-like clothing , with early attempts here . Last night I might have gotten it, finally... Here is the idea. Since function application is left-associative, but thrists are right associative, I'll reverse the application's direction to right-to-left, i.e. f a b c will become c b a f . This uglyness is another reason to finally whip up a RevThrist , which would be SNOC-like and left-associative. We need following ingredients: Fun - functions perform the reduction to a new object, Arg - arguments successively saturate the applicable structure to the right, Par - partial application (or parent) initiates the reduction. I'll explain these elements next, but first rewrite the above expression a bit to get a parentesized form (c(b(a f))) , and now with roles marked up in thrist syntax: Cons (Arg c) $ Cons (Arg b) $ Cons (Arg a) $ Cons (Fun f) Nil Looks almost reasonable. Time to define the ingredients mentioned above. Remember, that it must be a two-parameter data type and that the types must match up between Arg c and Arg b , etc., and finally between Arg a and Fun f . This is a pretty hefty requirement! We can attempt passing the effective application type between the ingredients, defining the data structure as data Appli :: * → * → * where Fun :: (a → b) → Appli (a → b) c Arg :: a → Appli b (a → b) This means functions pass their own type to the left (and ignoring what comes from the right), while arguments expect a saturable effective type from the right, store an appropriate value and propagate the remaining type to the left. This should work now: Cons (Arg 'a') $ Cons (Fun ord) Nil , with the type being Thrist Appli Int c . As you can see, no function type gets passed to the left, so you cannot prepend any more arguments. But this all appears useless since we cannot nest things. The Par ingredient will take care of this: Par :: Thrist Appli a c → Appli b (a → b) Par has a double role, it acts just like an argument, but holding a thrist inside, and thus groups a sub-application. The c type variable occurring in Par and Fun troubled me a lot, because it allows building up illegal thrists. Consider Cons (Fun f) $ Cons (Fun f) Nil . This gibberish cannot be assigned any reasonable semantics! Finally it occurred to me to use a phantom type for filling in this breach: data Peg Since Peg is uninhabited, no function signature can include it (unless it is a divergent one). It also ensures that the leftmost ingredient in a thrist is a function, how practial for Par ! Anyway, our Appli is done now: data Appli :: * → * → * where Fun :: (a → b) → Appli (a → b) Peg Arg :: a → Appli b (a → b) Par :: Thrist Appli a Peg → Appli b (a → b) So what brave soul will try this out? Because I must confess, up to this point I've been too lazy to fire up GHC! You might be inclined to say, why this whole circus? An awkward notation for something as simple as function application? Any Haskell implementation can do this with a beautiful syntax! Yes, we can build up applications but can't even compute them. This is a toy at the moment. But try to pull apart an application in Haskell! You can't! Here you can add an evaluator ( foldlThrist ?) and also instrument, trace, debug your evaluation process. Also, there is a reason I say 'Applicative Structures' in the title. Here is a generalization of Appli that is parametrized: data Appli :: ( * → * → * ) → * → * → * where Fun :: (a ~> b) → Appli ( ~> ) (a ~> b) Peg Arg :: a → Appli ( ~> ) b (a ~> b) Par :: Thrist (Appli ( ~> )) a Peg → Appli ( ~> ) b (a ~> b) You are free now to create your own function and value space with attached typing rules and still be able to use Thrist (Appli MySpace) ... The possibilities are endless, e.g. encrypted execution on remote hosts or abstract interpretation, you say it. Have Fun ! Posted by heisenbug at 6:37 AM Labels: applicative , haskell , thrist No comments: Post a Comment Newer Post Older Post Home Subscribe to: Post Comments (Atom) Blog Archive ►  2022 (1) ►  February (1) ►  2014 (5) ►  November (1) ►  October (1) ►  August (1) ►  July (1) ►  January (1) ►  2013 (5) ►  September (1) ►  August (3) ►  February (1) ►  2012 (2) ►  December (1) ►  September (1) ►  2011 (7) ►  December (1) ►  November (1) ►  October (1) ►  September (1) ►  August (1) ►  February (1) ►  January (1) ▼  2010 (19) ►  December (5) ▼  November (6) More on Existentials Applicative Structures and Thrists Type Synonyms Generalized Patterns and Existentials Hats off Cooperation ►  October (1) ►  August (1) ►  July (2) ►  June (4) ►  2009 (12) ►  November (2) ►  October (1) ►  August (1) ►  June (1) ►  May (1) ►  March (4) ►  January (2) ►  2008 (22) ►  October (1) ►  September (3) ►  August (6) ►  July (3) ►  June (2) ►  May (1) ►  April (3) ►  March (1) ►  February (1) ►  January (1) ►  2007 (20) ►  December (2) ►  November (1) ►  October (1) ►  September (1) ►  August (1) ►  July (14) About Me heisenbug I am here and there. You may encounter me if you try, but no guarantees. Just a hint: I am mostly with my family. View my complete profile   | 2026-01-13T09:30:24 |
http://hackage.haskell.org/package/comonad-4.2.2/docs/Control-Comonad.html#t:Cokleisli | Control.Comonad Source Contents Index comonad-4.2.2: Comonads Portability portable Stability provisional Maintainer Edward Kmett <ekmett@gmail.com> Safe Haskell Trustworthy Control.Comonad Contents Comonads Combining Comonads Cokleisli Arrows Functors Description Synopsis class Functor w => Comonad w where extract :: w a -> a duplicate :: w a -> w (w a) extend :: (w a -> b) -> w a -> w b liftW :: Comonad w => (a -> b) -> w a -> w b wfix :: Comonad w => w (w a -> a) -> a cfix :: Comonad w => (w a -> a) -> w a (=>=) :: Comonad w => (w a -> b) -> (w b -> c) -> w a -> c (=<=) :: Comonad w => (w b -> c) -> (w a -> b) -> w a -> c (<<=) :: Comonad w => (w a -> b) -> w a -> w b (=>>) :: Comonad w => w a -> (w a -> b) -> w b class Comonad w => ComonadApply w where (<@>) :: w (a -> b) -> w a -> w b (@>) :: w a -> w b -> w b (<@) :: w a -> w b -> w a (<@@>) :: ComonadApply w => w a -> w (a -> b) -> w b liftW2 :: ComonadApply w => (a -> b -> c) -> w a -> w b -> w c liftW3 :: ComonadApply w => (a -> b -> c -> d) -> w a -> w b -> w c -> w d newtype Cokleisli w a b = Cokleisli { runCokleisli :: w a -> b } class Functor f where fmap :: (a -> b) -> f a -> f b (<$) :: a -> f b -> f a (<$>) :: Functor f => (a -> b) -> f a -> f b ($>) :: Functor f => f a -> b -> f b Comonads class Functor w => Comonad w where Source There are two ways to define a comonad: I. Provide definitions for extract and extend satisfying these laws: extend extract = id extract . extend f = f extend f . extend g = extend (f . extend g) In this case, you may simply set fmap = liftW . These laws are directly analogous to the laws for monads and perhaps can be made clearer by viewing them as laws stating that Cokleisli composition must be associative, and has extract for a unit: f =>= extract = f extract =>= f = f (f =>= g) =>= h = f =>= (g =>= h) II. Alternately, you may choose to provide definitions for fmap , extract , and duplicate satisfying these laws: extract . duplicate = id fmap extract . duplicate = id duplicate . duplicate = fmap duplicate . duplicate In this case you may not rely on the ability to define fmap in terms of liftW . You may of course, choose to define both duplicate and extend . In that case you must also satisfy these laws: extend f = fmap f . duplicate duplicate = extend id fmap f = extend (f . extract ) These are the default definitions of extend and duplicate and the definition of liftW respectively. Methods extract :: w a -> a Source extract . fmap f = f . extract duplicate :: w a -> w (w a) Source duplicate = extend id fmap ( fmap f) . duplicate = duplicate . fmap f extend :: (w a -> b) -> w a -> w b Source extend f = fmap f . duplicate Instances Comonad Tree Comonad NonEmpty Comonad Identity Monoid m => Comonad ((->) m) Comonad ( (,) e) Comonad w => Comonad ( IdentityT w) Comonad ( Tagged * s) Comonad w => Comonad ( EnvT e w) Comonad w => Comonad ( StoreT s w) ( Comonad w, Monoid m) => Comonad ( TracedT m w) ( Comonad f, Comonad g) => Comonad ( Coproduct f g) liftW :: Comonad w => (a -> b) -> w a -> w b Source A suitable default definition for fmap for a Comonad . Promotes a function to a comonad. You can only safely use to define fmap if your Comonad defined extend , not just duplicate , since defining extend in terms of duplicate uses fmap ! fmap f = liftW f = extend (f . extract ) wfix :: Comonad w => w (w a -> a) -> a Source Comonadic fixed point à la Menendez cfix :: Comonad w => (w a -> a) -> w a Source Comonadic fixed point à la Orchard (=>=) :: Comonad w => (w a -> b) -> (w b -> c) -> w a -> c Source Left-to-right Cokleisli composition (=<=) :: Comonad w => (w b -> c) -> (w a -> b) -> w a -> c Source Right-to-left Cokleisli composition (<<=) :: Comonad w => (w a -> b) -> w a -> w b Source extend in operator form (=>>) :: Comonad w => w a -> (w a -> b) -> w b Source extend with the arguments swapped. Dual to >>= for a Monad . Combining Comonads class Comonad w => ComonadApply w where Source ComonadApply is to Comonad like Applicative is to Monad . Mathematically, it is a strong lax symmetric semi-monoidal comonad on the category Hask of Haskell types. That it to say that w is a strong lax symmetric semi-monoidal functor on Hask, where both extract and duplicate are symmetric monoidal natural transformations. Laws: ( . ) <$> u <@> v <@> w = u <@> (v <@> w) extract (p <@> q) = extract p ( extract q) duplicate (p <@> q) = ( <@> ) <$> duplicate p <@> duplicate q If our type is both a ComonadApply and Applicative we further require ( <*> ) = ( <@> ) Finally, if you choose to define ( <@ ) and ( @> ), the results of your definitions should match the following laws: a @> b = const id <$> a <@> b a <@ b = const <$> a <@> b Methods (<@>) :: w (a -> b) -> w a -> w b Source (@>) :: w a -> w b -> w b Source (<@) :: w a -> w b -> w a Source Instances ComonadApply Tree ComonadApply NonEmpty ComonadApply Identity Monoid m => ComonadApply ((->) m) Semigroup m => ComonadApply ( (,) m) ComonadApply w => ComonadApply ( IdentityT w) ( Semigroup e, ComonadApply w) => ComonadApply ( EnvT e w) ( ComonadApply w, Semigroup s) => ComonadApply ( StoreT s w) ( ComonadApply w, Monoid m) => ComonadApply ( TracedT m w) (<@@>) :: ComonadApply w => w a -> w (a -> b) -> w b Source A variant of <@> with the arguments reversed. liftW2 :: ComonadApply w => (a -> b -> c) -> w a -> w b -> w c Source Lift a binary function into a Comonad with zipping liftW3 :: ComonadApply w => (a -> b -> c -> d) -> w a -> w b -> w c -> w d Source Lift a ternary function into a Comonad with zipping Cokleisli Arrows newtype Cokleisli w a b Source The Cokleisli Arrow s of a given Comonad Constructors Cokleisli Fields runCokleisli :: w a -> b Instances Typeable1 w => Typeable2 ( Cokleisli w) Comonad w => Arrow ( Cokleisli w) Comonad w => ArrowChoice ( Cokleisli w) Comonad w => ArrowApply ( Cokleisli w) ComonadApply w => ArrowLoop ( Cokleisli w) Comonad w => Category ( Cokleisli w) Monad ( Cokleisli w a) Functor ( Cokleisli w a) Applicative ( Cokleisli w a) Functors class Functor f where The Functor class is used for types that can be mapped over. Instances of Functor should satisfy the following laws: fmap id == id fmap (f . g) == fmap f . fmap g The instances of Functor for lists, Maybe and IO satisfy these laws. Methods fmap :: (a -> b) -> f a -> f b (<$) :: a -> f b -> f a Replace all locations in the input with the same value. The default definition is fmap . const , but this may be overridden with a more efficient version. Instances Functor [] Functor IO Functor Id Functor ZipList Functor ReadPrec Functor ReadP Functor Maybe Functor Tree Functor Min Functor Max Functor First Functor Last Functor Option Functor NonEmpty Functor Identity Functor ((->) r) Functor ( Either a) Functor ( (,) a) Ix i => Functor ( Array i) Functor (StateL s) Functor (StateR s) Functor ( Const m) Monad m => Functor ( WrappedMonad m) Arrow a => Functor ( ArrowMonad a) Functor m => Functor ( IdentityT m) Arrow a => Functor ( WrappedArrow a b) Functor ( Tagged k s) ( Functor f, Functor g) => Functor ( Compose f g) Functor ( Cokleisli w a) Functor w => Functor ( EnvT e w) Functor w => Functor ( StoreT s w) Functor w => Functor ( TracedT m w) ( Functor f, Functor g) => Functor ( Coproduct f g) (<$>) :: Functor f => (a -> b) -> f a -> f b An infix synonym for fmap . ($>) :: Functor f => f a -> b -> f b Source Replace the contents of a functor uniformly with a constant value. Produced by Haddock version 2.13.2 | 2026-01-13T09:30:24 |
http://heisenbug.blogspot.com/2010/06/burning-iso-cds.html | don't count on finding me: Burning ISO CDs skip to main | skip to sidebar don't count on finding me Tuesday, June 22, 2010 Burning ISO CDs I wasted some hours with trying to burn ISO CDs on the mac. I tried various methods like converting .dmg to .cdr (CD Master) in Disk Utility, but the resulting CD always mounted as HFS+. Finally I googled a nice method: hdiutil makehybrid -iso -o MyImage.iso /Volumes/SomeFolder/ will create an ISO filesystem, which can be burnt with Disk Utility and shows up like that in the Finder. That is - well, I am pretty sure - readable on PCs. Alternatively I may use hdiutil burn MyImage.iso I believe... In retrospect, some of my burn products may have ended up as PC-readable too, since hybrid filesystems may have been created. I'll test them on a PC tomorrow for sure. Posted by heisenbug at 5:24 PM Labels: filesystem , iso No comments: Post a Comment Newer Post Older Post Home Subscribe to: Post Comments (Atom) Blog Archive ►  2022 (1) ►  February (1) ►  2014 (5) ►  November (1) ►  October (1) ►  August (1) ►  July (1) ►  January (1) ►  2013 (5) ►  September (1) ►  August (3) ►  February (1) ►  2012 (2) ►  December (1) ►  September (1) ►  2011 (7) ►  December (1) ►  November (1) ►  October (1) ►  September (1) ►  August (1) ►  February (1) ►  January (1) ▼  2010 (19) ►  December (5) ►  November (6) ►  October (1) ►  August (1) ►  July (2) ▼  June (4) Emacs the Lifesaver Burning ISO CDs Sized types My grief with out-of-tree code ►  2009 (12) ►  November (2) ►  October (1) ►  August (1) ►  June (1) ►  May (1) ►  March (4) ►  January (2) ►  2008 (22) ►  October (1) ►  September (3) ►  August (6) ►  July (3) ►  June (2) ►  May (1) ►  April (3) ►  March (1) ►  February (1) ►  January (1) ►  2007 (20) ►  December (2) ►  November (1) ►  October (1) ►  September (1) ►  August (1) ►  July (14) About Me heisenbug I am here and there. You may encounter me if you try, but no guarantees. Just a hint: I am mostly with my family. View my complete profile   | 2026-01-13T09:30:24 |
https://github.com/hsbt | hsbt (Hiroshi SHIBATA) · GitHub Skip to content Navigation Menu Toggle navigation Sign in Appearance settings Platform AI CODE CREATION GitHub Copilot Write better code with AI GitHub Spark Build and deploy intelligent apps GitHub Models Manage and compare prompts MCP Registry New Integrate external tools DEVELOPER WORKFLOWS Actions Automate any workflow Codespaces Instant dev environments Issues Plan and track work Code Review Manage code changes APPLICATION SECURITY GitHub Advanced Security Find and fix vulnerabilities Code security Secure your code as you build Secret protection Stop leaks before they start EXPLORE Why GitHub Documentation Blog Changelog Marketplace View all features Solutions BY COMPANY SIZE Enterprises Small and medium teams Startups Nonprofits BY USE CASE App Modernization DevSecOps DevOps CI/CD View all use cases BY INDUSTRY Healthcare Financial services Manufacturing Government View all industries View all solutions Resources EXPLORE BY TOPIC AI Software Development DevOps Security View all topics EXPLORE BY TYPE Customer stories Events & webinars Ebooks & reports Business insights GitHub Skills SUPPORT & SERVICES Documentation Customer support Community forum Trust center Partners Open Source COMMUNITY GitHub Sponsors Fund open source developers PROGRAMS Security Lab Maintainer Community Accelerator Archive Program REPOSITORIES Topics Trending Collections Enterprise ENTERPRISE SOLUTIONS Enterprise platform AI-powered developer platform AVAILABLE ADD-ONS GitHub Advanced Security Enterprise-grade security features Copilot for Business Enterprise-grade AI features Premium Support Enterprise-grade 24/7 support Pricing Search or jump to... Search code, repositories, users, issues, pull requests... --> Search Clear Search syntax tips Provide feedback --> We read every piece of feedback, and take your input very seriously. Include my email address so I can be contacted Cancel Submit feedback Saved searches Use saved searches to filter your results more quickly --> Name Query To see all available qualifiers, see our documentation . Cancel Create saved search Sign in Sign up Appearance settings Resetting focus You signed in with another tab or window. Reload to refresh your session. You signed out in another tab or window. Reload to refresh your session. You switched accounts on another tab or window. Reload to refresh your session. Dismiss alert {{ message }} hsbt Follow Overview Repositories 296 Projects 0 Packages 0 Stars 4.2k Sponsoring 0 More Overview Repositories Projects Packages Stars Sponsoring hsbt Follow 🏠 Working from home Hiroshi SHIBATA hsbt 🏠 Working from home Follow Sponsor Full-time OSS developer. I'm a member of Ruby core team, RubyGems team and rbenv and ruby-build maintainer. 1.6k followers · 363 following @ruby @rubygems @rbenv @88labs @andpad-dev Tokyo, Japan 18:30 (UTC +09:00) https://www.hsbt.org/ Mastodon @hsbt@ruby.social X @hsbt Facebook hiroshi.sbt LinkedIn in/hiroshi-shibata-04264122 Sponsors +8 Achievements x2 x3 x3 x4 Achievements x2 x3 x3 x4 Highlights Developer Program Member Organizations Block or Report Block or report hsbt --> Block user Prevent this user from interacting with your repositories and sending you notifications. Learn more about blocking users . You must be logged in to block users. Add an optional note Maximum 250 characters. Please don't include any personal information such as legal names or email addresses. Markdown supported. This note will be visible to only you. Block user Report abuse Contact GitHub support about this user’s behavior. Learn more about reporting abuse . Report abuse Overview Repositories 296 Projects 0 Packages 0 Stars 4.2k Sponsoring 0 More Overview Repositories Projects Packages Stars Sponsoring hsbt / README .md hsbt Profile A member of the Ruby core team. I maintain the following software and toolchains. Ruby RubyGems/Bundler Rake Psych JSON ruby-build docker-images and etc. I also maintain *.ruby-lang.org which is the official web site of the Ruby programming language. www.ruby-lang.org cache.r-l.o docs.ruby-lang.org b.r-l.o rubyci Pinned Loading ruby/ ruby ruby/ruby Public The Ruby Programming Language Ruby 23.3k 5.6k ruby/ rubygems ruby/rubygems Public Library packaging and distribution for Ruby. Ruby 3.9k 1.9k rbenv/ ruby-build rbenv/ruby-build Public A tool to download, compile, and install Ruby on Unix-like systems. Shell 4k 797 ruby/ rake ruby/rake Public A make-like build utility for Ruby. Ruby 2.4k 627 ruby/ psych ruby/psych Public A libyaml wrapper for Ruby Ruby 581 213 ruby/ json ruby/json Public JSON implementation for Ruby Ruby 736 357 Something went wrong, please refresh the page to try again. If the problem persists, check the GitHub status page or contact support . Uh oh! There was an error while loading. Please reload this page . Footer © 2026 GitHub, Inc. Footer navigation Terms Privacy Security Status Community Docs Contact Manage cookies Do not share my personal information You can’t perform that action at this time. | 2026-01-13T09:30:24 |
https://github.com/jeremyevans/ruby-warning | GitHub - jeremyevans/ruby-warning: Add custom processing for warnings Skip to content Navigation Menu Toggle navigation Sign in Appearance settings Platform AI CODE CREATION GitHub Copilot Write better code with AI GitHub Spark Build and deploy intelligent apps GitHub Models Manage and compare prompts MCP Registry New Integrate external tools DEVELOPER WORKFLOWS Actions Automate any workflow Codespaces Instant dev environments Issues Plan and track work Code Review Manage code changes APPLICATION SECURITY GitHub Advanced Security Find and fix vulnerabilities Code security Secure your code as you build Secret protection Stop leaks before they start EXPLORE Why GitHub Documentation Blog Changelog Marketplace View all features Solutions BY COMPANY SIZE Enterprises Small and medium teams Startups Nonprofits BY USE CASE App Modernization DevSecOps DevOps CI/CD View all use cases BY INDUSTRY Healthcare Financial services Manufacturing Government View all industries View all solutions Resources EXPLORE BY TOPIC AI Software Development DevOps Security View all topics EXPLORE BY TYPE Customer stories Events & webinars Ebooks & reports Business insights GitHub Skills SUPPORT & SERVICES Documentation Customer support Community forum Trust center Partners Open Source COMMUNITY GitHub Sponsors Fund open source developers PROGRAMS Security Lab Maintainer Community Accelerator Archive Program REPOSITORIES Topics Trending Collections Enterprise ENTERPRISE SOLUTIONS Enterprise platform AI-powered developer platform AVAILABLE ADD-ONS GitHub Advanced Security Enterprise-grade security features Copilot for Business Enterprise-grade AI features Premium Support Enterprise-grade 24/7 support Pricing Search or jump to... Search code, repositories, users, issues, pull requests... --> Search Clear Search syntax tips Provide feedback --> We read every piece of feedback, and take your input very seriously. Include my email address so I can be contacted Cancel Submit feedback Saved searches Use saved searches to filter your results more quickly --> Name Query To see all available qualifiers, see our documentation . Cancel Create saved search Sign in Sign up Appearance settings Resetting focus You signed in with another tab or window. Reload to refresh your session. You signed out in another tab or window. Reload to refresh your session. You switched accounts on another tab or window. Reload to refresh your session. Dismiss alert {{ message }} jeremyevans / ruby-warning Public Notifications You must be signed in to change notification settings Fork 12 Star 295 Add custom processing for warnings 295 stars 12 forks Branches Tags Activity Star Notifications You must be signed in to change notification settings Code Issues 0 Pull requests 0 Discussions Actions Security Uh oh! There was an error while loading. Please reload this page . Insights Additional navigation options Code Issues Pull requests Discussions Actions Security Insights jeremyevans/ruby-warning master Branches Tags Go to file Code Open more actions menu Folders and files Name Name Last commit message Last commit date Latest commit History 74 Commits .github/ workflows .github/ workflows lib lib test test .ci.gemfile .ci.gemfile .gitignore .gitignore CHANGELOG CHANGELOG MIT-LICENSE MIT-LICENSE README.rdoc README.rdoc Rakefile Rakefile warning.gemspec warning.gemspec View all files Repository files navigation README License ruby-warning ruby-warning adds custom processing for warnings, including the ability to ignore specific warning messages, ignore warnings in specific files/directories, include backtraces with warnings, treat warnings as errors, deduplicate warnings, and add custom handling for all warnings in specific files/directories. ruby-warning requires ruby 2.4+, as previous versions of ruby do not support custom processing of warnings. Installation gem install warning Source Code Source code is available on GitHub at github.com/jeremyevans/ruby-warning Usage By default, requiring the library does not make changes to how ruby processes warnings, it just adds methods that allow you to customize the processing. Warning.ignore takes a regexp and optionally a path prefix, and ignores any warning that matches the regular expression if it starts with the path prefix. It can also take a symbol or an array of symbols, and will use an appropriate regexp. The supported symbols are: :arg_prefix :ambiguous_slash :bignum :default_gem_removal :fixnum :ignored_block :keyword_separation :method_redefined :mismatched_indentations :missing_gvar :missing_ivar :not_reached :safe :shadow :taint :unused_var :useless_operator :void_context Warning.process takes an optional path prefix and a block, and if the warning string starts with the path prefix, it calls the block with the warning string instead of performing the default behavior. You can call Warning.process multiple times and it will operate intelligently, choosing the longest path prefix that the string starts with. Warning.process blocks can return :default to use the default behavior, :backtrace to use the default behavior and also print the backtrace or :raise to raise the warning string as a RuntimeError. Warning.process can also accept a hash of actions instead of a block, with keys being regexps (or symbols supported by Warning.ignore ) and values being callable objects (or :default , :backtrace , or :raise ). Warning.dedup deduplicates warnings, so that if a warning is received that is the same as a warning that has already been processed, the warning is ignored. Note that this should be used with care, since if the application generates an arbitrary number of unique warnings, that can lead to unbounded memory growth. Warning.clear resets the library to its initial state, clearing the current ignored warnings and warning processors, and turning off deduplication. By using path prefixes, it’s fairly easy for a gem to set that specific warnings should be ignored inside the gem’s directory. Note that path prefixes will not correctly handle warnings raised by Kernel#warn , unless the warning message given to Kernel#warn starts with the filename where the warning is used. The Kernel#warn :uplevel option will make sure the warning starts with the filename. Note that many of the warnings this library can ignore are warnings caused during compilation (i.e. when files are loaded via require). You should require this library and setup the appropriate warning handling before loading any code that could cause warnings. Examples # Ignore all uninitialized instance variable warnings Warning . ignore ( /instance variable @\w+ not initialized/ ) # Ignore all uninitialized instance variable warnings in current file Warning . ignore ( /instance variable @\w+ not initialized/ , __FILE__ ) # Ignore all uninitialized instance variable warnings in current file Warning . ignore ( :missing_ivar , __FILE__ ) # Ignore all Fixnum and Bignum warnings in current file Warning . ignore ([ :fixnum , :bignum ], __FILE__ ) # Write warning to LOGGER at level warning Warning . process do | warning | LOGGER . warning ( warning ) end # Write warnings in the current file to LOGGER at level error Warning . process ( __FILE__ ) do | warning | LOGGER . error ( warning ) end # Write warnings in the current file to $stderr, but include backtrace Warning . process ( __FILE__ ) do | warning | :backtrace end # Raise warnings in the current file as RuntimeErrors, with the warning # string as the exception message Warning . process ( __FILE__ ) do | warning | :raise end # Raise keyword argument separation warnings in the current file as # RuntimeErrors, and write ambiguous slash warnings to $stderr, including # the backtrace Warning . process ( __FILE__ , keyword_separation: :raise , ambiguous_slash: :backtrace ) # Deduplicate warnings Warning . dedup # Ignore all warnings in Gem dependencies Gem . path . each do | path | Warning . ignore ( // , path ) end License MIT Author Jeremy Evans <code@jeremyevans.net> About Add custom processing for warnings Resources Readme Uh oh! There was an error while loading. Please reload this page . Activity Stars 295 stars Watchers 7 watching Forks 12 forks Report repository Releases 10 tags Packages 0 No packages published Uh oh! There was an error while loading. Please reload this page . Contributors 7 Uh oh! There was an error while loading. Please reload this page . Languages Ruby 100.0% Footer © 2026 GitHub, Inc. Footer navigation Terms Privacy Security Status Community Docs Contact Manage cookies Do not share my personal information You can’t perform that action at this time. | 2026-01-13T09:30:24 |
http://hackage.haskell.org/package/semigroups-0.15.2/docs/Data-List-NonEmpty.html#t:NonEmpty | Data.List.NonEmpty Source Contents Index semigroups-0.15.2: Anything that associates Portability portable Stability provisional Maintainer Edward Kmett <ekmett@gmail.com> Safe Haskell Trustworthy Data.List.NonEmpty Contents The type of non-empty streams Non-empty stream transformations Basic functions Building streams Extracting sublists Sublist predicates "Set" operations Indexing streams Zipping and unzipping streams Functions on streams of characters Converting to and from a list Description A NonEmpty list forms a monad as per list, but always contains at least one element. Synopsis data NonEmpty a = a :| [a] map :: (a -> b) -> NonEmpty a -> NonEmpty b intersperse :: a -> NonEmpty a -> NonEmpty a scanl :: Foldable f => (b -> a -> b) -> b -> f a -> NonEmpty b scanr :: Foldable f => (a -> b -> b) -> b -> f a -> NonEmpty b scanl1 :: (a -> a -> a) -> NonEmpty a -> NonEmpty a scanr1 :: (a -> a -> a) -> NonEmpty a -> NonEmpty a transpose :: NonEmpty ( NonEmpty a) -> NonEmpty ( NonEmpty a) sortBy :: (a -> a -> Ordering ) -> NonEmpty a -> NonEmpty a sortOn :: Ord o => (a -> o) -> NonEmpty a -> NonEmpty a length :: NonEmpty a -> Int head :: NonEmpty a -> a tail :: NonEmpty a -> [a] last :: NonEmpty a -> a init :: NonEmpty a -> [a] (<|) :: a -> NonEmpty a -> NonEmpty a cons :: a -> NonEmpty a -> NonEmpty a uncons :: NonEmpty a -> (a, Maybe ( NonEmpty a)) unfoldr :: (a -> (b, Maybe a)) -> a -> NonEmpty b sort :: Ord a => NonEmpty a -> NonEmpty a reverse :: NonEmpty a -> NonEmpty a inits :: Foldable f => f a -> NonEmpty [a] tails :: Foldable f => f a -> NonEmpty [a] iterate :: (a -> a) -> a -> NonEmpty a repeat :: a -> NonEmpty a cycle :: NonEmpty a -> NonEmpty a unfold :: (a -> (b, Maybe a)) -> a -> NonEmpty b insert :: ( Foldable f, Ord a) => a -> f a -> NonEmpty a some1 :: Alternative f => f a -> f ( NonEmpty a) take :: Int -> NonEmpty a -> [a] drop :: Int -> NonEmpty a -> [a] splitAt :: Int -> NonEmpty a -> ([a], [a]) takeWhile :: (a -> Bool ) -> NonEmpty a -> [a] dropWhile :: (a -> Bool ) -> NonEmpty a -> [a] span :: (a -> Bool ) -> NonEmpty a -> ([a], [a]) break :: (a -> Bool ) -> NonEmpty a -> ([a], [a]) filter :: (a -> Bool ) -> NonEmpty a -> [a] partition :: (a -> Bool ) -> NonEmpty a -> ([a], [a]) group :: ( Foldable f, Eq a) => f a -> [ NonEmpty a] groupBy :: Foldable f => (a -> a -> Bool ) -> f a -> [ NonEmpty a] group1 :: Eq a => NonEmpty a -> NonEmpty ( NonEmpty a) groupBy1 :: (a -> a -> Bool ) -> NonEmpty a -> NonEmpty ( NonEmpty a) isPrefixOf :: Eq a => [a] -> NonEmpty a -> Bool nub :: Eq a => NonEmpty a -> NonEmpty a nubBy :: (a -> a -> Bool ) -> NonEmpty a -> NonEmpty a (!!) :: NonEmpty a -> Int -> a zip :: NonEmpty a -> NonEmpty b -> NonEmpty (a, b) zipWith :: (a -> b -> c) -> NonEmpty a -> NonEmpty b -> NonEmpty c unzip :: Functor f => f (a, b) -> (f a, f b) words :: NonEmpty Char -> NonEmpty String unwords :: NonEmpty String -> NonEmpty Char lines :: NonEmpty Char -> NonEmpty String unlines :: NonEmpty String -> NonEmpty Char fromList :: [a] -> NonEmpty a toList :: NonEmpty a -> [a] nonEmpty :: [a] -> Maybe ( NonEmpty a) xor :: NonEmpty Bool -> Bool The type of non-empty streams data NonEmpty a Source Constructors a :| [a] Instances Monad NonEmpty Functor NonEmpty Typeable1 NonEmpty Applicative NonEmpty Foldable NonEmpty Traversable NonEmpty Eq a => Eq ( NonEmpty a) Data a => Data ( NonEmpty a) Ord a => Ord ( NonEmpty a) Read a => Read ( NonEmpty a) Show a => Show ( NonEmpty a) Generic ( NonEmpty a) Hashable a => Hashable ( NonEmpty a) Semigroup ( NonEmpty a) Non-empty stream transformations map :: (a -> b) -> NonEmpty a -> NonEmpty b Source Map a function over a NonEmpty stream. intersperse :: a -> NonEmpty a -> NonEmpty a Source 'intersperse x xs' alternates elements of the list with copies of x . intersperse 0 (1 :| [2,3]) == 1 :| [0,2,0,3] scanl :: Foldable f => (b -> a -> b) -> b -> f a -> NonEmpty b Source scanl is similar to foldl , but returns a stream of successive reduced values from the left: scanl f z [x1, x2, ...] == z :| [z `f` x1, (z `f` x1) `f` x2, ...] Note that last (scanl f z xs) == foldl f z xs. scanr :: Foldable f => (a -> b -> b) -> b -> f a -> NonEmpty b Source scanr is the right-to-left dual of scanl . Note that head (scanr f z xs) == foldr f z xs. scanl1 :: (a -> a -> a) -> NonEmpty a -> NonEmpty a Source scanl1 is a variant of scanl that has no starting value argument: scanl1 f [x1, x2, ...] == x1 :| [x1 `f` x2, x1 `f` (x2 `f` x3), ...] scanr1 :: (a -> a -> a) -> NonEmpty a -> NonEmpty a Source scanr1 is a variant of scanr that has no starting value argument. transpose :: NonEmpty ( NonEmpty a) -> NonEmpty ( NonEmpty a) Source sortBy :: (a -> a -> Ordering ) -> NonEmpty a -> NonEmpty a Source sortBy for NonEmpty , behaves the same as sortBy sortOn :: Ord o => (a -> o) -> NonEmpty a -> NonEmpty a Source sortOn for NonEmpty , behaves the same as: sortBy . comparing Basic functions length :: NonEmpty a -> Int Source head :: NonEmpty a -> a Source Extract the first element of the stream. tail :: NonEmpty a -> [a] Source Extract the possibly-empty tail of the stream. last :: NonEmpty a -> a Source Extract the last element of the stream. init :: NonEmpty a -> [a] Source Extract everything except the last element of the stream. (<|) :: a -> NonEmpty a -> NonEmpty a Source Prepend an element to the stream. cons :: a -> NonEmpty a -> NonEmpty a Source Synonym for <| . uncons :: NonEmpty a -> (a, Maybe ( NonEmpty a)) Source uncons produces the first element of the stream, and a stream of the remaining elements, if any. unfoldr :: (a -> (b, Maybe a)) -> a -> NonEmpty b Source sort :: Ord a => NonEmpty a -> NonEmpty a Source Sort a stream. reverse :: NonEmpty a -> NonEmpty a Source reverse a finite NonEmpty stream. inits :: Foldable f => f a -> NonEmpty [a] Source The inits function takes a stream xs and returns all the finite prefixes of xs . tails :: Foldable f => f a -> NonEmpty [a] Source The tails function takes a stream xs and returns all the suffixes of xs . Building streams iterate :: (a -> a) -> a -> NonEmpty a Source iterate f x produces the infinite sequence of repeated applications of f to x . iterate f x = x :| [f x, f (f x), ..] repeat :: a -> NonEmpty a Source repeat x returns a constant stream, where all elements are equal to x . cycle :: NonEmpty a -> NonEmpty a Source cycle xs returns the infinite repetition of xs : cycle [1,2,3] = 1 :| [2,3,1,2,3,...] unfold :: (a -> (b, Maybe a)) -> a -> NonEmpty b Source unfold produces a new stream by repeatedly applying the unfolding function to the seed value to produce an element of type b and a new seed value. When the unfolding function returns Nothing instead of a new seed value, the stream ends. insert :: ( Foldable f, Ord a) => a -> f a -> NonEmpty a Source insert x xs inserts x into the last position in xs where it is still less than or equal to the next element. In particular, if the list is sorted beforehand, the result will also be sorted. some1 :: Alternative f => f a -> f ( NonEmpty a) Source some1 x sequences x one or more times. Extracting sublists take :: Int -> NonEmpty a -> [a] Source take n xs returns the first n elements of xs . drop :: Int -> NonEmpty a -> [a] Source drop n xs drops the first n elements off the front of the sequence xs . splitAt :: Int -> NonEmpty a -> ([a], [a]) Source splitAt n xs returns a pair consisting of the prefix of xs of length n and the remaining stream immediately following this prefix. 'splitAt' n xs == ('take' n xs, 'drop' n xs) xs == ys ++ zs where (ys, zs) = 'splitAt' n xs takeWhile :: (a -> Bool ) -> NonEmpty a -> [a] Source takeWhile p xs returns the longest prefix of the stream xs for which the predicate p holds. dropWhile :: (a -> Bool ) -> NonEmpty a -> [a] Source dropWhile p xs returns the suffix remaining after takeWhile p xs . span :: (a -> Bool ) -> NonEmpty a -> ([a], [a]) Source span p xs returns the longest prefix of xs that satisfies p , together with the remainder of the stream. 'span' p xs == ('takeWhile' p xs, 'dropWhile' p xs) xs == ys ++ zs where (ys, zs) = 'span' p xs break :: (a -> Bool ) -> NonEmpty a -> ([a], [a]) Source The break p function is equivalent to span (not . p) . filter :: (a -> Bool ) -> NonEmpty a -> [a] Source filter p xs removes any elements from xs that do not satisfy p . partition :: (a -> Bool ) -> NonEmpty a -> ([a], [a]) Source The partition function takes a predicate p and a stream xs , and returns a pair of lists. The first list corresponds to the elements of xs for which p holds; the second corresponds to the elements of xs for which p does not hold. 'partition' p xs = ('filter' p xs, 'filter' (not . p) xs) group :: ( Foldable f, Eq a) => f a -> [ NonEmpty a] Source The group function takes a stream and returns a list of streams such that flattening the resulting list is equal to the argument. Moreover, each stream in the resulting list contains only equal elements. For example, in list notation: 'group' $ 'cycle' "Mississippi" = "M" : "i" : "ss" : "i" : "ss" : "i" : "pp" : "i" : "M" : "i" : ... groupBy :: Foldable f => (a -> a -> Bool ) -> f a -> [ NonEmpty a] Source groupBy operates like group , but uses the provided equality predicate instead of == . group1 :: Eq a => NonEmpty a -> NonEmpty ( NonEmpty a) Source group1 operates like group , but uses the knowledge that its input is non-empty to produce guaranteed non-empty output. groupBy1 :: (a -> a -> Bool ) -> NonEmpty a -> NonEmpty ( NonEmpty a) Source groupBy1 is to group1 as groupBy is to group . Sublist predicates isPrefixOf :: Eq a => [a] -> NonEmpty a -> Bool Source The isPrefix function returns True if the first argument is a prefix of the second. "Set" operations nub :: Eq a => NonEmpty a -> NonEmpty a Source The nub function removes duplicate elements from a list. In particular, it keeps only the first occurence of each element. (The name nub means 'essence'.) It is a special case of nubBy , which allows the programmer to supply their own inequality test. nubBy :: (a -> a -> Bool ) -> NonEmpty a -> NonEmpty a Source The nubBy function behaves just like nub , except it uses a user-supplied equality predicate instead of the overloaded == function. Indexing streams (!!) :: NonEmpty a -> Int -> a Source xs !! n returns the element of the stream xs at index n . Note that the head of the stream has index 0. Beware : a negative or out-of-bounds index will cause an error. Zipping and unzipping streams zip :: NonEmpty a -> NonEmpty b -> NonEmpty (a, b) Source The zip function takes two streams and returns a stream of corresponding pairs. zipWith :: (a -> b -> c) -> NonEmpty a -> NonEmpty b -> NonEmpty c Source The zipWith function generalizes zip . Rather than tupling the elements, the elements are combined using the function passed as the first argument. unzip :: Functor f => f (a, b) -> (f a, f b) Source The unzip function is the inverse of the zip function. Functions on streams of characters words :: NonEmpty Char -> NonEmpty String Source The words function breaks a stream of characters into a stream of words, which were delimited by white space. Beware : if the input contains no words (i.e. is entirely whitespace), this will cause an error. unwords :: NonEmpty String -> NonEmpty Char Source The unwords function is an inverse operation to words . It joins words with separating spaces. Beware : the input ("" :| []) will cause an error. lines :: NonEmpty Char -> NonEmpty String Source The lines function breaks a stream of characters into a stream of strings at newline characters. The resulting strings do not contain newlines. unlines :: NonEmpty String -> NonEmpty Char Source The unlines function is an inverse operation to lines . It joins lines, after appending a terminating newline to each. Converting to and from a list fromList :: [a] -> NonEmpty a Source Converts a normal list to a NonEmpty stream. Raises an error if given an empty list. toList :: NonEmpty a -> [a] Source Convert a stream to a normal list efficiently. nonEmpty :: [a] -> Maybe ( NonEmpty a) Source nonEmpty efficiently turns a normal list into a NonEmpty stream, producing Nothing if the input is empty. xor :: NonEmpty Bool -> Bool Source Produced by Haddock version 2.13.2 | 2026-01-13T09:30:25 |
http://heisenbug.blogspot.com/2010/06/emacs-lifesaver.html | don't count on finding me: Emacs the Lifesaver skip to main | skip to sidebar don't count on finding me Thursday, June 24, 2010 Emacs the Lifesaver I was not thrilled of the task in front of me. Refreshing an old mega-patch, revise virtually every hunk to use a different interface, and committing it piecemeal to the repository again. Sounds like a long error prone job of suffering. Fortunately here is where the power tools come in. I re-merged the backed out revision, postponing conflicts; saved the diff away and reverted the repository; wrote a small awk script to massage the hunks in the diff to get a new patch; fired up emacs with the patch and applied each hunk after thorough review (and seldom with minor changes); some hunks are not ready to go in yet as they do not qualify as refactoring, these are kept for later; commit almost every file as a separate revision. I spend the most time in Emacs (the Mac OS X incarnation, Aquamacs is fantastic). It provides me all the comfort and productivity I need: it provides all necessary hunk operations such as apply, reverse, go to original, drop etc. I can transparently work from a remote machine via ssh, including editing, version control and the above diff operations peace of mind, by being rock solid and autosaving stuff. The only inconvenience is the sheer amount of keyboard equivalents, but I am getting used to them too. Thanks Emacs, without you I would probably drop! Posted by heisenbug at 7:55 AM Labels: emacs , llvm No comments: Post a Comment Newer Post Older Post Home Subscribe to: Post Comments (Atom) Blog Archive ►  2022 (1) ►  February (1) ►  2014 (5) ►  November (1) ►  October (1) ►  August (1) ►  July (1) ►  January (1) ►  2013 (5) ►  September (1) ►  August (3) ►  February (1) ►  2012 (2) ►  December (1) ►  September (1) ►  2011 (7) ►  December (1) ►  November (1) ►  October (1) ►  September (1) ►  August (1) ►  February (1) ►  January (1) ▼  2010 (19) ►  December (5) ►  November (6) ►  October (1) ►  August (1) ►  July (2) ▼  June (4) Emacs the Lifesaver Burning ISO CDs Sized types My grief with out-of-tree code ►  2009 (12) ►  November (2) ►  October (1) ►  August (1) ►  June (1) ►  May (1) ►  March (4) ►  January (2) ►  2008 (22) ►  October (1) ►  September (3) ►  August (6) ►  July (3) ►  June (2) ►  May (1) ►  April (3) ►  March (1) ►  February (1) ►  January (1) ►  2007 (20) ►  December (2) ►  November (1) ►  October (1) ►  September (1) ►  August (1) ►  July (14) About Me heisenbug I am here and there. You may encounter me if you try, but no guarantees. Just a hint: I am mostly with my family. View my complete profile   | 2026-01-13T09:30:25 |
https://github.com/jeremyevans/ruby-subset_sum | GitHub - jeremyevans/ruby-subset_sum: Simple Subset Sum Solver with C and Pure Ruby Versions Skip to content Navigation Menu Toggle navigation Sign in Appearance settings Platform AI CODE CREATION GitHub Copilot Write better code with AI GitHub Spark Build and deploy intelligent apps GitHub Models Manage and compare prompts MCP Registry New Integrate external tools DEVELOPER WORKFLOWS Actions Automate any workflow Codespaces Instant dev environments Issues Plan and track work Code Review Manage code changes APPLICATION SECURITY GitHub Advanced Security Find and fix vulnerabilities Code security Secure your code as you build Secret protection Stop leaks before they start EXPLORE Why GitHub Documentation Blog Changelog Marketplace View all features Solutions BY COMPANY SIZE Enterprises Small and medium teams Startups Nonprofits BY USE CASE App Modernization DevSecOps DevOps CI/CD View all use cases BY INDUSTRY Healthcare Financial services Manufacturing Government View all industries View all solutions Resources EXPLORE BY TOPIC AI Software Development DevOps Security View all topics EXPLORE BY TYPE Customer stories Events & webinars Ebooks & reports Business insights GitHub Skills SUPPORT & SERVICES Documentation Customer support Community forum Trust center Partners Open Source COMMUNITY GitHub Sponsors Fund open source developers PROGRAMS Security Lab Maintainer Community Accelerator Archive Program REPOSITORIES Topics Trending Collections Enterprise ENTERPRISE SOLUTIONS Enterprise platform AI-powered developer platform AVAILABLE ADD-ONS GitHub Advanced Security Enterprise-grade security features Copilot for Business Enterprise-grade AI features Premium Support Enterprise-grade 24/7 support Pricing Search or jump to... Search code, repositories, users, issues, pull requests... --> Search Clear Search syntax tips Provide feedback --> We read every piece of feedback, and take your input very seriously. Include my email address so I can be contacted Cancel Submit feedback Saved searches Use saved searches to filter your results more quickly --> Name Query To see all available qualifiers, see our documentation . Cancel Create saved search Sign in Sign up Appearance settings Resetting focus You signed in with another tab or window. Reload to refresh your session. You signed out in another tab or window. Reload to refresh your session. You switched accounts on another tab or window. Reload to refresh your session. Dismiss alert {{ message }} jeremyevans / ruby-subset_sum Public Notifications You must be signed in to change notification settings Fork 3 Star 13 Simple Subset Sum Solver with C and Pure Ruby Versions ruby-subsetsum.jeremyevans.net License View license 13 stars 3 forks Branches Tags Activity Star Notifications You must be signed in to change notification settings Code Issues 0 Pull requests 0 Discussions Actions Security Uh oh! There was an error while loading. Please reload this page . Insights Additional navigation options Code Issues Pull requests Discussions Actions Security Insights jeremyevans/ruby-subset_sum master Branches Tags Go to file Code Open more actions menu Folders and files Name Name Last commit message Last commit date Latest commit History 41 Commits .github/ workflows .github/ workflows spec spec .ci.gemfile .ci.gemfile .gitignore .gitignore CHANGELOG CHANGELOG LICENSE LICENSE Rakefile Rakefile extconf.rb extconf.rb subset_sum.c subset_sum.c subset_sum.gemspec subset_sum.gemspec subset_sum.rb subset_sum.rb View all files Repository files navigation License Copyright (c) 2008-2022 Jeremy Evans Permission is hereby granted, free of charge, to any person obtaining a copy of this software and associated documentation files (the "Software"), to deal in the Software without restriction, including without limitation the rights to use, copy, modify, merge, publish, distribute, sublicense, and/or sell copies of the Software, and to permit persons to whom the Software is furnished to do so, subject to the following conditions: The above copyright notice and this permission notice shall be included in all copies or substantial portions of the Software. THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE. About Simple Subset Sum Solver with C and Pure Ruby Versions ruby-subsetsum.jeremyevans.net License View license Uh oh! There was an error while loading. Please reload this page . Activity Stars 13 stars Watchers 1 watching Forks 3 forks Report repository Releases 3 tags Packages 0 No packages published Uh oh! There was an error while loading. Please reload this page . Languages Ruby 55.7% C 44.3% Footer © 2026 GitHub, Inc. Footer navigation Terms Privacy Security Status Community Docs Contact Manage cookies Do not share my personal information You can’t perform that action at this time. | 2026-01-13T09:30:25 |
https://github.com/jeremyevans/tilt | GitHub - jeremyevans/tilt: Generic interface to multiple Ruby template engines Skip to content Navigation Menu Toggle navigation Sign in Appearance settings Platform AI CODE CREATION GitHub Copilot Write better code with AI GitHub Spark Build and deploy intelligent apps GitHub Models Manage and compare prompts MCP Registry New Integrate external tools DEVELOPER WORKFLOWS Actions Automate any workflow Codespaces Instant dev environments Issues Plan and track work Code Review Manage code changes APPLICATION SECURITY GitHub Advanced Security Find and fix vulnerabilities Code security Secure your code as you build Secret protection Stop leaks before they start EXPLORE Why GitHub Documentation Blog Changelog Marketplace View all features Solutions BY COMPANY SIZE Enterprises Small and medium teams Startups Nonprofits BY USE CASE App Modernization DevSecOps DevOps CI/CD View all use cases BY INDUSTRY Healthcare Financial services Manufacturing Government View all industries View all solutions Resources EXPLORE BY TOPIC AI Software Development DevOps Security View all topics EXPLORE BY TYPE Customer stories Events & webinars Ebooks & reports Business insights GitHub Skills SUPPORT & SERVICES Documentation Customer support Community forum Trust center Partners Open Source COMMUNITY GitHub Sponsors Fund open source developers PROGRAMS Security Lab Maintainer Community Accelerator Archive Program REPOSITORIES Topics Trending Collections Enterprise ENTERPRISE SOLUTIONS Enterprise platform AI-powered developer platform AVAILABLE ADD-ONS GitHub Advanced Security Enterprise-grade security features Copilot for Business Enterprise-grade AI features Premium Support Enterprise-grade 24/7 support Pricing Search or jump to... Search code, repositories, users, issues, pull requests... --> Search Clear Search syntax tips Provide feedback --> We read every piece of feedback, and take your input very seriously. Include my email address so I can be contacted Cancel Submit feedback Saved searches Use saved searches to filter your results more quickly --> Name Query To see all available qualifiers, see our documentation . Cancel Create saved search Sign in Sign up Appearance settings Resetting focus You signed in with another tab or window. Reload to refresh your session. You signed out in another tab or window. Reload to refresh your session. You switched accounts on another tab or window. Reload to refresh your session. Dismiss alert {{ message }} jeremyevans / tilt Public Notifications You must be signed in to change notification settings Fork 11 Star 72 Generic interface to multiple Ruby template engines License MIT license 72 stars 11 forks Branches Tags Activity Star Notifications You must be signed in to change notification settings Code Issues 0 Pull requests 0 Discussions Actions Security Uh oh! There was an error while loading. Please reload this page . Insights Additional navigation options Code Issues Pull requests Discussions Actions Security Insights jeremyevans/tilt master Branches Tags Go to file Code Open more actions menu Folders and files Name Name Last commit message Last commit date Latest commit History 1,026 Commits .github/ workflows .github/ workflows bin bin docs docs lib lib test test .autotest .autotest .ci.gemfile .ci.gemfile .gitignore .gitignore CHANGELOG.md CHANGELOG.md COPYING COPYING README.md README.md Rakefile Rakefile tilt.gemspec tilt.gemspec View all files Repository files navigation README MIT license Tilt Tilt is a thin interface over a bunch of different Ruby template engines in an attempt to make their usage as generic as possible. This is useful for web frameworks, static site generators, and other systems that support multiple template engines but don't want to code for each of them individually. The following features are supported for all template engines (assuming the feature is relevant to the engine): Custom template evaluation scopes / bindings Ability to pass locals to template evaluation Support for passing a block to template evaluation for yield Backtraces with correct filenames and line numbers Template file caching and reloading Fast, method-based template source compilation The primary goal is to get all of the things listed above right for all template engines included in the distribution. Support for these template engines is included with Tilt: Engine File Extensions Required Libraries {Asciidoctor}[rdoc-ref:lib/tilt/asciidoc.rb] .ad, .adoc, .asciidoc asciidoctor {Babel}[rdoc-ref:lib/tilt/babel.rb] .es6, .babel, .jsx babel-transpiler {Builder}[rdoc-ref:lib/tilt/builder.rb] .builder builder {CoffeeScript}[rdoc-ref:lib/tilt/coffee.rb] .coffee coffee-script (+ javascript) {CoffeeScriptLiterate}[rdoc-ref:lib/tilt/coffee.rb] .litcoffee coffee-script (+ javascript) {CommonMarker}[rdoc-ref:lib/tilt/commonmarker.rb] .markdown, .mkd, .md commonmarker {CSV}[rdoc-ref:lib/tilt/csv.rb] .rcsv csv (ruby stdlib) {ERB}[rdoc-ref:lib/tilt/erb.rb] .erb, .rhtml erb (ruby stdlib) {Erubi}[rdoc-ref:lib/tilt/erubi.rb] .erb, .rhtml, .erubi erubi {Etanni}[rdoc-ref:lib/tilt/etanni.rb] .ern, .etanni none {Haml}[rdoc-ref:lib/tilt/haml.rb] .haml haml {Kramdown}[rdoc-ref:lib/tilt/kramdown.rb] .markdown, .mkd, .md kramdown {Liquid}[rdoc-ref:lib/tilt/liquid.rb] .liquid liquid {LiveScript}[rdoc-ref:lib/tilt/livescript.rb] .ls livescript (+ javascript) {Markaby}[rdoc-ref:lib/tilt/markaby.rb] .mab markaby {Nokogiri}[rdoc-ref:lib/tilt/nokogiri.rb] .nokogiri nokogiri {Pandoc}[rdoc-ref:lib/tilt/pandoc.rb] .markdown, .mkd, .md pandoc {Plain}[rdoc-ref:lib/tilt/plain.rb] .html none {Prawn}[rdoc-ref:lib/tilt/prawn.rb] .prawn prawn {Radius}[rdoc-ref:lib/tilt/radius.rb] .radius radius {RDiscount}[rdoc-ref:lib/tilt/rdiscount.rb] .markdown, .mkd, .md rdiscount {RDoc}[rdoc-ref:lib/tilt/rdoc.rb] .rdoc rdoc {Redcarpet}[rdoc-ref:lib/tilt/redcarpet.rb] .markdown, .mkd, .md redcarpet {RedCloth}[rdoc-ref:lib/tilt/redcloth.rb] .textile redcloth {RstPandoc}[rdoc-ref:lib/tilt/rst-pandoc.rb] .rst pandoc {Slim}[rdoc-ref:lib/tilt/slim.rb] .slim slim {Sass}[rdoc-ref:lib/tilt/sass.rb] .sass sass-embedded, sassc, or sass {Scss}[rdoc-ref:lib/tilt/sass.rb] .scss sass-embedded, sassc, or sass {String}[rdoc-ref:lib/tilt/string.rb] .str none {TypeScript}[rdoc-ref:lib/tilt/typescript.rb] .ts typescript (+ javascript) {Yajl}[rdoc-ref:lib/tilt/yajl.rb] .yajl yajl-ruby See https://tilt.jeremyevans.net for formatted documentation for Tilt. Basic Usage Instant gratification: require 'tilt' require 'tilt/erb' template = Tilt . new ( 'templates/foo.erb' ) => #<Tilt::ERBTemplate @file="templates/foo.erb" ...> output = template . render => "Hello world!" It's recommended that calling programs explicitly require the Tilt template engine libraries (like 'tilt/erb' above) at load time, or finalize the mapping (see section below). Tilt attempts to lazy require the template engine library the first time a template is created, but this is prone to error in threaded environments. The Tilt::Template class is an abstract base class that used by all supported template engines. Each template class adheres to the same interface for creation and rendering. In the instant gratification example, we let Tilt determine the template implementation class based on the filename, but Tilt::Template implementations can also be used directly: require 'tilt/haml' template = Tilt :: HamlTemplate . new ( 'templates/foo.haml' ) output = template . render The render method takes an optional evaluation scope and locals hash arguments. Here, the template is evaluated within the context of the Person object with locals x and y : require 'tilt/erb' template = Tilt :: ERBTemplate . new ( 'templates/foo.erb' ) joe = Person . find ( 'joe' ) output = template . render ( joe , :x => 35 , :y => 42 ) If no scope is provided, the template is evaluated within the context of an object created with Object.new . A single Template instance's render method may be called multiple times with different scope and locals arguments. Continuing the previous example, we render the same compiled template but this time in jane's scope: jane = Person . find ( 'jane' ) output = template . render ( jane , :x => 22 , :y => nil ) Blocks can be passed to render for templates that support running arbitrary ruby code (usually with some form of yield ). For instance, assuming the following in foo.erb : Hey <%= yield %>! The block passed to render is called on yield : template = Tilt :: ERBTemplate . new ( 'foo.erb' ) template . render { 'Joe' } # => "Hey Joe!" For template engines that always result in the same output for the same template and do not accept local variables, scope class, or yield, the Tilt::StaticTemplate class should be used instead of Tilt::Template. Fixed Locals By default, Tilt templates that support local variables can be called with any locals, and a separate template method is compiled for each combination of local variable names. This causes multiple issues: It is inefficient, especially for large templates that are called with many combinations of locals. It hides issues if unused local variable names are passed to the template It does not support default values for local variables It does not support required local variables It does not support cases where you want to pass values via a keyword splat It does not support named blocks You can pass the :fixed_locals option when creating the template to fix the local variables. This will only compile a single template method per template (per scope class, see below). The value of the :fixed_locals option is a Ruby method parameter string, which should start and end with parentheses. For example, if the template does not use local variables, you can set it to "()" . This will cause an ArgumentError to be raised if you call the template with locals: template = Tilt :: ERBTemplate . new ( 'templates/foo.erb' , fixed_locals : "()" ) output = template . render ( Object . new ) # No ArgumentError output = template . render ( Object . new , x : 1 ) # ArgumentError If the template must be passed the x local variable to work correctly, and optionally can be provided the y local variable: template = Tilt :: ERBTemplate . new ( 'templates/foo.erb' , fixed_locals : "(x:, y: nil)" ) output = template . render ( Object . new ) # ArgumentError output = template . render ( Object . new , x : 1 ) # No ArgumentError output = template . render ( Object . new , x : 1 , y : 2 ) # No ArgumentError output = template . render ( Object . new , x : 1 , y : 2 , z : 3 ) # ArgumentError If the template wants to accept arbitrary local variables, in order to pass the variables to a method inside the template, you can provide a keyword splat or a single positional argument (with an optional empty hash value if you want to support being called with no local variables): template = Tilt :: ERBTemplate . new ( 'templates/foo.erb' , fixed_locals : "(**args)" ) # or "(args={})" If you would like to name the block passed to the template, so you can pass it to a method inside the template: template = Tilt :: ERBTemplate . new ( 'templates/foo.erb' , fixed_locals : "(&block)" ) Embedded Fixed Locals In many cases, Tilt is used in situations where you do not have direct control over the options passed when creating each separate template. In these cases and others, it can be helpful to embed the fixed locals inside the template using a magic comment. This can be enabled using the :extract_fixed_locals template option. It can also be enabled globally via: Tilt . extract_fixed_locals = true If :extract_fixed_locals option is given, or extraction is globally enabled, and the :fixed_locals option is not provided when creating the template, Tilt will scan the template code looking for a magic comment of the form (whitespace around locals: is optional but recommended): # locals: () In ERB templates, you can use the following comment format: <%# locals: () %> In string templates, it is a little ackward, but still possible (note that the closing } goes on a separate line: #{# locals: () } If Tilt finds the magic comment, it will use it as fixed locals. To disable the scanning for fixed locals even if Tilt.extract_fixed_locals = true is set, pass the fixed_locals: false or extract_fixed_locals: false option. When embedded fixed locals are supported, it can be useful to support a default for fixed locals if they are not specified in the template. This is useful mostly to default templates to not supporting local variables without having to specify that in each template. Tilt support this via the :default_fixed_locals option. To recap, in order of preference, Tilt will use fixed locals from the following sources: :fixed_locals template option embedded fixed locals magic comment (if :extract_fixed_locals template option is given or Tilt.extract_fixed_locals = true ) :default_fixed_locals template option It is expected that embedded fixed locals magic comments will be supported by default in Tilt 3 (i.e. Tilt.extract_fixed_locals will default to true ). :scope_class option You can now specify the :scope_class option when creating the template, which will fix the scope class for the template. By default, Tilt uses the class of the provide scope, and will compile a separate method per scope class. By using the :scope_class option to fix the scope class, and using fixed locals, you can ensure only a single template method is compiled per Tilt::Template instance. Template Mappings The Tilt::Mapping class includes methods for associating template implementation classes with filename patterns and for locating/instantiating template classes based on those associations. The Tilt module has a global instance of Mapping that is populated with the table of template engines above. The Tilt.register method associates a filename pattern with a specific template implementation. To use ERB for files ending in a .bar extension: >> Tilt . register Tilt :: ERBTemplate , 'bar' >> Tilt . new ( 'views/foo.bar' ) => #<Tilt::ERBTemplate @file="views/foo.bar" ...> Retrieving the template class for a file or file extension: >> Tilt [ 'foo.bar' ] => Tilt :: ERBTemplate >> Tilt [ 'haml' ] => Tilt :: HamlTemplate Retrieving a list of template classes for a file: >> Tilt . templates_for ( 'foo.bar' ) => [ Tilt :: ERBTemplate ] >> Tilt . templates_for ( 'foo.haml.bar' ) => [ Tilt :: ERBTemplate , Tilt :: HamlTemplate ] The template class is determined by searching for a series of decreasingly specific name patterns. When creating a new template with Tilt.new('views/foo.html.erb') , we check for the following template mappings: views/foo.html.erb foo.html.erb html.erb erb Template Pipelines In some cases, it is useful to take the output of one template engine, and use it as input to another template engine. This can be useful when a template engine does not support locals or a scope, and you want to customize the output per different locals. For example, let's say you have an scss file that you want to allow customization with erb, such as: .foo { .bar { .<%= hide _ class %> { display : none ; } } } You can do this manually: scss = Tilt . new ( "file.scss.erb" ) . render ( nil , hide_class : 'baz' ) css = Tilt . new ( "scss" ) { scss } . render A more automated way to handle it is to register a template pipeline: Tilt . register_pipeline ( "scss.erb" ) Then Tilt will automatically take the output of the erb engine, and pass it to the scss engine, automating the above code. css = Tilt . new ( "file.scss.erb" ) . render ( nil , hide_class : 'baz' ) Finalizing Mappings By default, Tilt::Mapping instances will lazy load files for template classes, and will allow for registering an unregistering template classes. To make sure this is safe in a multithreaded environment, a mutex is used to synchronize access. To improve performance, and prevent additional lazy loading of template classes, you can finalize mappings. Finalizing a mapping returns a new finalized mapping that is frozen, cannot be modified, and will not lazy load template classes not already loaded. Users of Tilt are encouraged to manually require the template libraries they desire to use, and then freeze the mappings. Tilt.finalize! will replace Tilt's default mapping with a finalized versions, as well as freeze Tilt so that no further changes can be made. require 'tilt/erubi' require 'tilt/string' require 'tilt/sass' Tilt . finalize! Tilt [ 'erb' ] # => Tilt::ErubiTemplate Tilt [ 'str' ] # => Tilt::StringTemplate Tilt [ 'scss' ] # => Tilt::ScssTemplate Tilt [ 'haml' ] # => nil # even if haml is installed Encodings Tilt needs to know the encoding of the template in order to work properly: Tilt will use Encoding.default_external as the encoding when reading external files. If you're mostly working with one encoding (e.g. UTF-8) we highly recommend setting this option. When providing a custom reader block ( Tilt.new { custom_string } ) you'll have ensure the string is properly encoded yourself. Most of the template engines in Tilt also allows you to override the encoding using the :default_encoding -option: tmpl = Tilt . new ( 'hello.erb' , :default_encoding => 'Big5' ) Ultimately it's up to the template engine how to handle the encoding: It might respect :default_encoding , it might always assume it's UTF-8 (like CoffeeScript), or it can do its own encoding detection. Template Compilation Tilt compiles generated Ruby source code produced by template engines and reuses it on subsequent template invocations. Benchmarks show this yields a 5x-10x performance increase over evaluating the Ruby source on each invocation. Template compilation is currently supported for these template engines: StringTemplate, ERB, Erubi, Etanni, Haml, Nokogiri, Builder, CSV, Prawn, and Yajl. LICENSE Tilt is distributed under the MIT license. See the COPYING file for more info. About Generic interface to multiple Ruby template engines Resources Readme License MIT license Uh oh! There was an error while loading. Please reload this page . Activity Stars 72 stars Watchers 6 watching Forks 11 forks Report repository Uh oh! There was an error while loading. Please reload this page . Contributors 97 Uh oh! There was an error while loading. Please reload this page . + 83 contributors Languages Ruby 100.0% Footer © 2026 GitHub, Inc. Footer navigation Terms Privacy Security Status Community Docs Contact Manage cookies Do not share my personal information You can’t perform that action at this time. | 2026-01-13T09:30:25 |
https://docs.asciidoctor.org/asciidoctor.js/2.2/ | Asciidoctor.js Documentation | Asciidoctor Docs Asciidoctor Docs In this project AsciiDoc Language Syntax Quick Reference Processing Asciidoctor Ruby Asciidoctor.js JavaScript AsciidoctorJ Java Extensions Add-on Converters PDF Ruby EPUB3 Ruby reveal.js Ruby, JavaScript Source Compilers Reducer Ruby, JavaScript Extended Syntax Asciidoctor Diagram Ruby Tooling Build Automation Maven Tools Java Gradle Plugin Java Asciidoclet Java Text Editors / Viewers Browser Extension IntelliJ Plugin Chat List --> Source Tweets Asciidoctor.js Install guide A quick tour Runtime Processor API Convert options Extract information from a document Manipulate a document Logging Extend & Customize Stylesheets Extensions Register Extensions Preprocessor Tree Processor Postprocessor Docinfo Processor Block Processor Block Macro Processor Inline Macro Processor Include Processor Compile Ruby Extension Extensions ecosystem Template Converter Custom Converter API Reference Specifications Include directive Processing in the browser Support matrix Policies & Governance Version Lifecycle Policy Asciidoctor.js 2.2 AsciiDoc Asciidoctor 2.0 Asciidoctor.js 3.0 2.2 AsciidoctorJ 3.0 2.5 Asciidoctor PDF 2.3 2.2 2.1 2.0 Asciidoctor EPUB3 2.3 Asciidoctor reveal.js 5.0 4.1 Maven Tools 3.2 Gradle Plugin Suite 5.0 4.0 Asciidoclet 2.0 1.5.6 Asciidoctor Diagram 3.0.1 Browser Extension Community Asciidoctor.js Asciidoctor.js Documentation 2.2 3.0 2.2 Edit this Page Asciidoctor.js Documentation Asciidoctor.js brings AsciiDoc to the JavaScript world! This project uses Opal to transpile Asciidoctor , a modern implementation of AsciiDoc, from Ruby to JavaScript to produce asciidoctor.js . The asciidoctor.js script can be run on any JavaScript platform, including Node.js, GraalVM and, of course, a web browser. Install guide Asciidoctor Home --> Docs Chat Source List (archive) @asciidoctor Copyright © 2026 Dan Allen, Sarah White, and individual Asciidoctor contributors. Except where noted, the content is licensed under a Creative Commons Attribution 4.0 International (CC BY 4.0) license. The UI for this site is derived from the Antora default UI and is licensed under the MPL-2.0 license. Several icons are imported from Octicons and are licensed under the MIT license. AsciiDoc® and AsciiDoc Language™ are trademarks of the Eclipse Foundation, Inc. Thanks to our backers and contributors for helping to make this project possible. Additional thanks to: Authored in AsciiDoc . Produced by Antora and Asciidoctor . | 2026-01-13T09:30:25 |
http://rpm.org/ | rpm.org - Home Home Releases Documentation Community Contribute Roadmap About RPM Package Manager The RPM Package Manager (RPM) is a powerful package management system capable of building computer software from source into easily distributable packages installing, updating and uninstalling packaged software querying detailed information about the packaged software, whether installed or not verifying integrity of packaged software and resulting software installation News RPM 6.0.1 released! (Dec 10 2025) This is a bugfix release addressing a couple of regressions in RPM 6.0.0 and some other issues. See the release notes for details and download information. RPM 6.0.0 released! (Sep 22 2025) See the release notes for details and download information. Highlights include: Support for both RPM v4 and v6 packages (see Compatibility Notes ) Support for multiple OpenPGP signatures per package ( #3385 ) Support for OpenPGP v6 and PQC keys and signatures ( #3363 ) Support for updating previously imported keys ( #2577 ) Support for installing RPM v3 packages has been removed ( #1107 ) RPM defaults to enforcing signature checking ( #1573 ) RPM uses the full key ID or fingerprint to identify OpenPGP keys everywhere ( #2403 ) Man page and other documentation overhaul (#3612, #3669, #3751) Pristine and verifiable release tarballs ( #3565 ) ( #2702 ) RPM 6.0.0 RC1 released! (Sep 22 2025) This is the first release candidate of 6.0, the main changes being miscellanenous bugfixes and man page updates. See the release notes for details and download information. Highlights include: Add man page for rpmuncompress(1) and rpm-version(7) ( #3624 ) Add support for E2K architecture Fix rpm2archive(1) using the same suffix for tar and cpio ( #3922 ) Fix randomly failing dependency generator tests ( #2470 ) Fix a segfault and memory leaks in rpmgraph(1) Fix --hash , --percent and --test not working with --restore ( #3917 ) Fix legacy signature tags getting copied into v6 packages ( #3852 ) Fix 6.0 alpha regression on --restore --all ( #3904 ) Fix 6.0 alpha regression on user queries after --rebuilddb ( #3886 ) Fix 6.0 alpha regression on reading an rpmrc file with a macrofiles directive ( #3901 ) Update gendiff(1) , rpm2archive(1) , rpmbuild(1) , rpmdeps(1) and rpmgraph(1) man pages to the new style ( #3669 ) Update translations Drop support for obsolete --nodirtokens rpmbuild(1) switch ( #3927 ) RPM 6.0.0 BETA2 released! (Aug 27 2025) This is the second beta release of 6.0, the main changes being support for OpenPGP v6 signatures and various bugfixes, especially to package signing. See the release notes for details and download information. Highlights include: Fix fingerprinting regression in 6.0 alpha ( #3762 ) Fix rpmsign possibly adding multiple legacy tags ( #3878 ) Fix rpmsign possibly copying a OpenPGP v6 signature into legacy tag ( #3851 ) Fix regression on signature size reservation not being used ( #3768 ) Fix race condition in brp-strip-comment-note ( #3868 ) Fix segfault on invalid output from multi-mode dependency generator ( #3821 ) Fix Lua rpm.glob() not honoring the c argument ( #3794 ) Fix alternatives mechanism unintentionally kicking in for signatures ( #3872 ) Fix sources and patches stored in reverse order in headers ( #3014 ) Add support for OpenPGP v6 signatures ( #3845 ) ( #3846 ) Add SHA512 payload digest to appease CNSA 2.0 ( #3894 ) Add rpm-manifest(5) man page ( #3650 ) Drop pre-4.6 rpmlib() dependencies from v6 packages RPM 6.0.0 BETA1 released! (Jul 01 2025) This is the first beta release of 6.0 and is mainly about documentation and finalizing the v6 file format. See the release notes for details and download information. Highlights include: Several new man-pages ( #3612 ) Python module isolation support ( RhBug:2327289 ) Signature related fixes and enhancements Scriptlet failures are reflected in transaction return code again ( #2581 ) RPM 6.0.0 ALPHA1 released! (Apr 08 2025) See the release notes for details and download information. Highlights include: RPM defaults to enforcing signature checking ( #1573 ) RPM uses the full key ID or fingerprint to identify OpenPGP keys everywhere ( #2403 ) Support for multiple OpenPGP signatures per package ( #3385 ) Support for updating previously imported keys ( #2577 ) Support for both RPM v4 and v6 packages Support for installing RPM v3 packages has been removed ( #1107 ) By default, RPM no longer verifies obsolete crypto (MD5, SHA1, DSA) ( #1292 ) Man page overhaul (work in progress as of 6.0 alpha) Pristine and verifiable release tarballs ( #3565 ) ( #2702 ) RPM 4.20.1 released! (Feb 19 2025) This is primarily a bugfix release addressing a handful of regressions in RPM 4.20.0 as well as various other issues. See the release notes for details and download information. Highlights include: Support for fully locked user accounts in sysusers.d(5) files Filter Lua deprecation warnings based on the originating RPM version Fix regressions in rpmsign(8) , rpmspec(8) , %debug_package and more Fix unmodified %config (and possibly other) files being removed in case of unpack failure Fix IMA plugin causing transaction failures in rootless containers Fix sqlite rpmdb growing over time RPM 4.20.0 released! (Oct 07 2024) See the release notes for details and download information. Highlights include: Declarative build system support Dynamic spec improvements Guaranteed, RPM-controlled per-build directory Support for spec-local file attributes and generators Support for group membership in sysusers.d(5) files Proper distro-agnostic debuginfo support Sanitized spec comments and indentation syntax Sanitized --build-in-place mode New unshare plugin for scriptlet isolation Plugin API made public RPM 4.20.0 RC2 released! (Sep 10 2024) See the release notes for details and download information. Highlights include: Make %autosetup -C also work with zip/7zip archives Fix a long-standing bug in %transfiletriggerpostun where it only matchedagainst the first listed prefix A handful of other small fixes RPM 4.20.0 RC1 released! (Aug 30 2024) This release is about the finishing touches for the major features and various other fixes. See the release notes for details and download information. Highlights include: Declarative buildsystem fixes Compatibility of --build-in-place with the new build directory layout Debuginfo generation and error reporting fixes RPM 4.20.0 BETA1 released! (Jun 24 2024) This is all about bugs, alpha regressions and spec backwards compatibility, in particular regarding the new debuginfo enablement and %builddir related issues. See the release notes for details and download information. RPM 4.20.0 ALPHA2 released! (May 20 2024) This is another alpha snapshot that addresses a couple of bugs found in the first one and adds two new features. See the release notes for details and download information. Highlights include: Fix faulty interaction between the scriptlet prepend/append options and the BuildSystem tag ( #3024 ) which affected the users test-driving the new Declarative buildsystem feature Add proper, built-in debuginfo enablement logic ( #2204 ) Add support for a timestamp handling policy , exposed via the new %build_mtime_policy macro For older news, head over to the timeline . rpm.org | 2026-01-13T09:30:25 |
https://docs.asciidoctor.org/asciidoctorj/latest/extensions/extensions-introduction/ | Extensions API | Asciidoctor Docs Asciidoctor Docs In this project AsciiDoc Language Syntax Quick Reference Processing Asciidoctor Ruby Asciidoctor.js JavaScript AsciidoctorJ Java Extensions Add-on Converters PDF Ruby EPUB3 Ruby reveal.js Ruby, JavaScript Source Compilers Reducer Ruby, JavaScript Extended Syntax Asciidoctor Diagram Ruby Tooling Build Automation Maven Tools Java Gradle Plugin Java Asciidoclet Java Text Editors / Viewers Browser Extension IntelliJ Plugin Chat List --> Source Tweets AsciidoctorJ Distribution Installation Usage Command Line Interface Convert Documents The Asciidoctor Interface Conversion Options Locate Files Safe Modes Examples Converting to EPUB3 Ruby Runtime Register a Ruby Extension Logs Handling API Read the Document Tree Write a Custom Converter Extensions API AsciidoctorJ Conversion Process Overview Understanding the AST Classes Write an Extension Block Macro Processor Inline Macro Processor Block Processor Include Processor Preprocessor Postprocessor Treeprocessor Docinfo Processor Register Extensions Manually Registering Extensions with javaExtensionRegistry Bulk Extension Registration ( Extension Groups ) Automatically Loading Extensions Logging Syntax Highlighter API Implement a Syntax Highlighter Adapter Lifecycle of a SyntaxHighlighterAdapter Format the Source Block Element Link and Copy External Resources Static Syntax Highlighting During Conversion Invocation Order Automatically Load a Syntax Highlighter Help & Guides Updating to New Releases v3.0.x migration guide Extension Migration: 1.6.x to 2.0.x Extension Migration: 1.5.x to 1.6.x Running in Frameworks Using AsciidoctorJ in an OSGi environment Running AsciidoctorJ on WildFly Running AsciidoctorJ with Spring Boot Accessing the JRuby Instance Loading Ruby Libraries Loading External Gems with GEM_PATH Optimization Using a pre-release version Using a Snapshot Version Development Project Layout Local Development Develop in an IDE Continuous Integration AsciidoctorJ 3.0 AsciiDoc Asciidoctor 2.0 Asciidoctor.js 3.0 2.2 AsciidoctorJ 3.0 2.5 Asciidoctor PDF 2.3 2.2 2.1 2.0 Asciidoctor EPUB3 2.3 Asciidoctor reveal.js 5.0 4.1 Maven Tools 3.2 Gradle Plugin Suite 5.0 4.0 Asciidoclet 2.0 1.5.6 Asciidoctor Diagram 3.0.1 Browser Extension Community AsciidoctorJ Extensions API 3.0 3.0 2.5 Edit this Page Extensions API One of the major improvements to Asciidoctor recently is the extensions API. AsciidoctorJ brings this extension API to the JVM environment allowing us to write extensions in Java instead of Ruby. If you are migrating existing extensions to a newer version, please see the guides: Extension Migration: 1.6.x to 2.0.x Extension Migration: 1.5.x to 1.6.x Writing an extension is as simple as creating a Java class and sub-classing from one of the extension points. However, to explore the full potential it’s recommended to: Have a brief understanding of the AsciidoctorJ conversion process and internal representation of the document. In short, extensions allow you to tap into the conversion process to make modifications to enhance the generated content. Write an extension class. This is as simple as creating a subclass from one of the extension points listed below. Register your class to make AsciidoctorJ converter aware of it. There several options depending on the use case. Asciidoctor provides eight types of extension points. Each extension point has an abstract class in Java that maps to the extension API in Ruby. AsciidoctorJ extension APIs Name Class Description Include Processor org.asciidoctor.extension.IncludeProcessor Intercepts include::[] lines Preprocessor org.asciidoctor.extension.Preprocessor Allows you to modify the asciidoc text before parsing Block Macro Processor org.asciidoctor.extension.BlockMacroProcessor Processes block macros like bibliography::[] Block Processor org.asciidoctor.extension.BlockProcessor Processes an arbitrary block based on it’s style such as [prohibited] -- Do not enter -- Treeprocessor org.asciidoctor.extension.Treeprocessor Modify the AST after parsing. Inline Macro Processor org.asciidoctor.extension.InlineMacroProcessor Processes inline macros like btn:[] . Postprocessor org.asciidoctor.extension.Postprocessor Modifies the backend-specific output document. Docinfo Processor org.asciidoctor.extension.DocinfoProcessor Insert content into the header element or the end of the body element (html), or the info element or at the end of the document (docbook). Write a Custom Converter AsciidoctorJ Conversion Process Overview Asciidoctor Home --> Docs Chat Source List (archive) @asciidoctor Copyright © 2026 Dan Allen, Sarah White, and individual Asciidoctor contributors. Except where noted, the content is licensed under a Creative Commons Attribution 4.0 International (CC BY 4.0) license. The UI for this site is derived from the Antora default UI and is licensed under the MPL-2.0 license. Several icons are imported from Octicons and are licensed under the MIT license. AsciiDoc® and AsciiDoc Language™ are trademarks of the Eclipse Foundation, Inc. Thanks to our backers and contributors for helping to make this project possible. Additional thanks to: Authored in AsciiDoc . Produced by Antora and Asciidoctor . | 2026-01-13T09:30:25 |
https://github.com/jeremyevans/minitest-global_expectations | GitHub - jeremyevans/minitest-global_expectations: Support minitest expectation methods for all objects Skip to content Navigation Menu Toggle navigation Sign in Appearance settings Platform AI CODE CREATION GitHub Copilot Write better code with AI GitHub Spark Build and deploy intelligent apps GitHub Models Manage and compare prompts MCP Registry New Integrate external tools DEVELOPER WORKFLOWS Actions Automate any workflow Codespaces Instant dev environments Issues Plan and track work Code Review Manage code changes APPLICATION SECURITY GitHub Advanced Security Find and fix vulnerabilities Code security Secure your code as you build Secret protection Stop leaks before they start EXPLORE Why GitHub Documentation Blog Changelog Marketplace View all features Solutions BY COMPANY SIZE Enterprises Small and medium teams Startups Nonprofits BY USE CASE App Modernization DevSecOps DevOps CI/CD View all use cases BY INDUSTRY Healthcare Financial services Manufacturing Government View all industries View all solutions Resources EXPLORE BY TOPIC AI Software Development DevOps Security View all topics EXPLORE BY TYPE Customer stories Events & webinars Ebooks & reports Business insights GitHub Skills SUPPORT & SERVICES Documentation Customer support Community forum Trust center Partners Open Source COMMUNITY GitHub Sponsors Fund open source developers PROGRAMS Security Lab Maintainer Community Accelerator Archive Program REPOSITORIES Topics Trending Collections Enterprise ENTERPRISE SOLUTIONS Enterprise platform AI-powered developer platform AVAILABLE ADD-ONS GitHub Advanced Security Enterprise-grade security features Copilot for Business Enterprise-grade AI features Premium Support Enterprise-grade 24/7 support Pricing Search or jump to... Search code, repositories, users, issues, pull requests... --> Search Clear Search syntax tips Provide feedback --> We read every piece of feedback, and take your input very seriously. Include my email address so I can be contacted Cancel Submit feedback Saved searches Use saved searches to filter your results more quickly --> Name Query To see all available qualifiers, see our documentation . Cancel Create saved search Sign in Sign up Appearance settings Resetting focus You signed in with another tab or window. Reload to refresh your session. You signed out in another tab or window. Reload to refresh your session. You switched accounts on another tab or window. Reload to refresh your session. Dismiss alert {{ message }} jeremyevans / minitest-global_expectations Public Notifications You must be signed in to change notification settings Fork 1 Star 6 Support minitest expectation methods for all objects 6 stars 1 fork Branches Tags Activity Star Notifications You must be signed in to change notification settings Code Issues 0 Pull requests 0 Discussions Actions Security Uh oh! There was an error while loading. Please reload this page . Insights Additional navigation options Code Issues Pull requests Discussions Actions Security Insights jeremyevans/minitest-global_expectations master Branches Tags Go to file Code Open more actions menu Folders and files Name Name Last commit message Last commit date Latest commit History 21 Commits .github/ workflows .github/ workflows lib/ minitest lib/ minitest test test .ci.gemfile .ci.gemfile .gitignore .gitignore CHANGELOG CHANGELOG MIT-LICENSE MIT-LICENSE README.rdoc README.rdoc Rakefile Rakefile minitest-global_expectations.gemspec minitest-global_expectations.gemspec View all files Repository files navigation README License minitest-global_expectations minitest-global_expectations allows you to keep using simple code in your minitest specs, without having to wrap every single object you are calling an expectation method on with _ : # You can use: foo . must_equal 1 # instead of: _ ( foo ). must_equal 1 Calling expectation methods on all objects was supported in Minitest <5.12, was deprecated in Minitest 5.12, and is planned to be removed from Minitest 6. Installation gem install minitest - global_expectations Source Code Source code is available on GitHub at github.com/jeremyevans/minitest-global_expectations Usage Just require the library. You can switch requires of minitest/spec to: require 'minitest/global_expectations' Alternatively, if you are requiring minitest/autorun , you can switch to: require 'minitest/global_expectations/autorun' License MIT Author Jeremy Evans <code@jeremyevans.net> About Support minitest expectation methods for all objects Resources Readme Uh oh! There was an error while loading. Please reload this page . Activity Stars 6 stars Watchers 1 watching Forks 1 fork Report repository Releases 3 tags Packages 0 No packages published Uh oh! There was an error while loading. Please reload this page . Languages Ruby 100.0% Footer © 2026 GitHub, Inc. Footer navigation Terms Privacy Security Status Community Docs Contact Manage cookies Do not share my personal information You can’t perform that action at this time. | 2026-01-13T09:30:25 |
https://docs.asciidoctor.org/about/get-help/ | Get Help | Asciidoctor Docs Asciidoctor Docs In this project AsciiDoc Language Syntax Quick Reference Processing Asciidoctor Ruby Asciidoctor.js JavaScript AsciidoctorJ Java Extensions Add-on Converters PDF Ruby EPUB3 Ruby reveal.js Ruby, JavaScript Source Compilers Reducer Ruby, JavaScript Extended Syntax Asciidoctor Diagram Ruby Tooling Build Automation Maven Tools Java Gradle Plugin Java Asciidoclet Java Text Editors / Viewers Browser Extension IntelliJ Plugin Chat List --> Source Tweets Community Code of Conduct Get Help Version and Release Policies History Community AsciiDoc Asciidoctor 2.0 Asciidoctor.js 3.0 2.2 AsciidoctorJ 3.0 2.5 Asciidoctor PDF 2.3 2.2 2.1 2.0 Asciidoctor EPUB3 2.3 Asciidoctor reveal.js 5.0 4.1 Maven Tools 3.2 Gradle Plugin Suite 5.0 4.0 Asciidoclet 2.0 1.5.6 Asciidoctor Diagram 3.0.1 Browser Extension Community Community Get Help Edit this Page Get Help To be successful at writing and publishing AsciiDoc content with Asciidoctor, we encourage you to maintain a dialogue with the project maintainers and other community members. Don’t hesitate to ask questions and discuss any aspects of the project using an appropriate communication channel listed below. Your feedback helps drive the projects forward by providing use cases, ideas, metrics, and motivation. Each project may provide more focused or preferred communication channels. Please refer to the help section for the respective project to find those details. Project chat Platform Zulip URL chat.asciidoctor.org The project chat is the preferred means of communication for all users of Asciidoctor. This policy helps keep the project sustainable. If you want to ask for help, share feedback, or exchange ideas with fellow community members in real time, please do so in the project chat. The chat also serves as the project forum. Like a forum, the chat is partitioned into channels. If you find an ongoing discussion that matches the topic you’re interested in, feel free to join that discussion. Otherwise, please post a new topic in the #users channel ( not the #community channel, please!) Please do not post unrelated questions or comments to an existing topic since that disrupts the discussion and makes answers more difficult to find. Please use the filter or search feature to find existing topics before starting a new one. If you’re starting a new topic that relates to a specific project, check if there’s a channel for that project and post to that channel instead of the #users channel. For example, if you want to ask a question that only applies to AsciidoctorJ, please create the topic in the #users/asciidoctorj channel. If you aren’t sure where to post, please post in the #users channel and a moderator will relocate the topic if necessary. No action is needed on your part. The discussions in the project chat are archived and public. There’s no guarantee those logs will be saved indefinitely, though we plan keep them as long as we’re permitted to do so. Keep in mind that people participate in the project chat voluntarily, so please be respectful of their time and interests. The project chat is not 1-on-1 support. You’re in a public space. Do not @ mention someone when writing a message unless a) the subject matter absolutely requires the attention of that person or b) that person has already replied to the topic and is interacting with you. Using the @ mention to draw attention to your question is not courteous to that person or fair to others. You’re free to post your message to the community at large (no @ mention). If someone has something to share in response, they will do so if and when they have time. You can reference someone without notifying them using the @_ prefix, which is considered acceptable conduct. Issue tracker Platform GitHub URL github.com/asciidoctor/asciidoctor/issues If the issue does not pertain to Asciidoctor core, please file the issue in the issue tracker for the relevant project. For example, to file an issue about AsciidoctorJ, please use the issue tracker at github.com/asciidoctor/asciidoctorj/issues . The issue tracker is the preferred channel for reporting verifiable bugs, regressions, and security vulnerabilities, or for making formal, specific, and well-defined change requests. Please do not ask questions about how to use the software in the issue tracker. The issue tracker is not a support portal. Instead, you may direct questions about usage to the project chat . Please do not comment on closed issues unless you’re adding additional context, such as to report whether the fix worked for you or how you made use of it. If you post an unproductive comment on an open issue, such as “What’s the status of this issue after X years?”, your comment will be deleted. Any significant change or decision about the project’s software is recorded in the issue tracker. The issue tracker is also used for planning releases via milestones and labels. Social media Platform Twitter URL twitter.com/asciidoctor If you want to share your experience with Asciidoctor or help promote it, we encourage you to post about it on social media. When you post about Asciidoctor on Twitter, you can mention the official account for the project, @asciidoctor . You can also use the #asciidoctor hashtag to help others find your post or discover others who are talking about it. Discussion list (archived) Platform Nabble URL discuss.asciidoctor.org In the past, this project used the discussion list for general communication. During that time, community members asked for help, shared feedback, and exchanged ideas with fellow community members over email. Since the successful introduction of the Project chat , this channel of communication has been archived and is now read only. You may continue to use it as a knowledge base. However, all new questions, feedback, announcements, and other general discourse should be directed to the project chat. Please be considerate Please understand that all members of this community are volunteers and support is provided to fellow community members at will and often out of personal interest. When using these communication channels, we expect you to uphold the Code of Conduct . If you’re seeking professional support, you can ask the project maintainers or other community members if they offer any services. Otherwise, keep in mind that people participating in this project do not work for you. Code of Conduct Version and Release Policies Asciidoctor Home --> Docs Chat Source List (archive) @asciidoctor Copyright © 2026 Dan Allen, Sarah White, and individual Asciidoctor contributors. Except where noted, the content is licensed under a Creative Commons Attribution 4.0 International (CC BY 4.0) license. The UI for this site is derived from the Antora default UI and is licensed under the MPL-2.0 license. Several icons are imported from Octicons and are licensed under the MIT license. AsciiDoc® and AsciiDoc Language™ are trademarks of the Eclipse Foundation, Inc. Thanks to our backers and contributors for helping to make this project possible. Additional thanks to: Authored in AsciiDoc . Produced by Antora and Asciidoctor . | 2026-01-13T09:30:25 |
https://github.com/jeremyevans/ape_tag_libs | GitHub - jeremyevans/ape_tag_libs: Libaries for reading/writing APEv2 tags in many languages Skip to content Navigation Menu Toggle navigation Sign in Appearance settings Platform AI CODE CREATION GitHub Copilot Write better code with AI GitHub Spark Build and deploy intelligent apps GitHub Models Manage and compare prompts MCP Registry New Integrate external tools DEVELOPER WORKFLOWS Actions Automate any workflow Codespaces Instant dev environments Issues Plan and track work Code Review Manage code changes APPLICATION SECURITY GitHub Advanced Security Find and fix vulnerabilities Code security Secure your code as you build Secret protection Stop leaks before they start EXPLORE Why GitHub Documentation Blog Changelog Marketplace View all features Solutions BY COMPANY SIZE Enterprises Small and medium teams Startups Nonprofits BY USE CASE App Modernization DevSecOps DevOps CI/CD View all use cases BY INDUSTRY Healthcare Financial services Manufacturing Government View all industries View all solutions Resources EXPLORE BY TOPIC AI Software Development DevOps Security View all topics EXPLORE BY TYPE Customer stories Events & webinars Ebooks & reports Business insights GitHub Skills SUPPORT & SERVICES Documentation Customer support Community forum Trust center Partners Open Source COMMUNITY GitHub Sponsors Fund open source developers PROGRAMS Security Lab Maintainer Community Accelerator Archive Program REPOSITORIES Topics Trending Collections Enterprise ENTERPRISE SOLUTIONS Enterprise platform AI-powered developer platform AVAILABLE ADD-ONS GitHub Advanced Security Enterprise-grade security features Copilot for Business Enterprise-grade AI features Premium Support Enterprise-grade 24/7 support Pricing Search or jump to... Search code, repositories, users, issues, pull requests... --> Search Clear Search syntax tips Provide feedback --> We read every piece of feedback, and take your input very seriously. Include my email address so I can be contacted Cancel Submit feedback Saved searches Use saved searches to filter your results more quickly --> Name Query To see all available qualifiers, see our documentation . Cancel Create saved search Sign in Sign up Appearance settings Resetting focus You signed in with another tab or window. Reload to refresh your session. You signed out in another tab or window. Reload to refresh your session. You switched accounts on another tab or window. Reload to refresh your session. Dismiss alert {{ message }} jeremyevans / ape_tag_libs Public Notifications You must be signed in to change notification settings Fork 6 Star 12 Libaries for reading/writing APEv2 tags in many languages 12 stars 6 forks Branches Tags Activity Star Notifications You must be signed in to change notification settings Code Issues 0 Pull requests 0 Discussions Actions Security Uh oh! There was an error while loading. Please reload this page . Insights Additional navigation options Code Issues Pull requests Discussions Actions Security Insights jeremyevans/ape_tag_libs master Branches Tags Go to file Code Open more actions menu Folders and files Name Name Last commit message Last commit date Latest commit History 194 Commits .github/ workflows .github/ workflows c c clojure clojure erlang erlang forth forth haskell haskell io io lua lua perl perl python python ruby ruby test-files test-files .gitignore .gitignore README README check_tests check_tests View all files Repository files navigation README This repository contains various APEv2 tag reader/writer libraries that I've created for different languages. It serves two purposes: 1) The best way to learn a language is to actually start programming in it. Creating an APEv2 reader/writer library is something that requires you get get your hands dirty in the language, without taking too much time. 2) Making sure an APEv2 library is available for more programming languages. I think the ID3v2.x tagging standards for mp3s are terrible and that APEv2 is much simpler and easier. Hopefully with easy API access to APEv2 tags, more programs will start offering APEv2 tagging as an alternative to ID3v2. Also, APEv2 is the tagging standard used in many of the fringe audio formats, so users of those formats will be able to use these libraries to access metadata in the programming language of their choice. About Libaries for reading/writing APEv2 tags in many languages Resources Readme Uh oh! There was an error while loading. Please reload this page . Activity Stars 12 stars Watchers 3 watching Forks 6 forks Report repository Releases No releases published Packages 0 No packages published Uh oh! There was an error while loading. Please reload this page . Contributors 2 Uh oh! There was an error while loading. Please reload this page . Languages C 23.1% Python 13.3% Ruby 11.1% Lua 11.1% Erlang 9.7% Clojure 8.7% Other 23.0% Footer © 2026 GitHub, Inc. Footer navigation Terms Privacy Security Status Community Docs Contact Manage cookies Do not share my personal information You can’t perform that action at this time. | 2026-01-13T09:30:25 |
http://heisenbug.blogspot.com/search/label/emacs | don't count on finding me: emacs skip to main | skip to sidebar don't count on finding me Showing posts with label emacs . Show all posts Showing posts with label emacs . Show all posts Thursday, June 24, 2010 Emacs the Lifesaver I was not thrilled of the task in front of me. Refreshing an old mega-patch, revise virtually every hunk to use a different interface, and committing it piecemeal to the repository again. Sounds like a long error prone job of suffering. Fortunately here is where the power tools come in. I re-merged the backed out revision, postponing conflicts; saved the diff away and reverted the repository; wrote a small awk script to massage the hunks in the diff to get a new patch; fired up emacs with the patch and applied each hunk after thorough review (and seldom with minor changes); some hunks are not ready to go in yet as they do not qualify as refactoring, these are kept for later; commit almost every file as a separate revision. I spend the most time in Emacs (the Mac OS X incarnation, Aquamacs is fantastic). It provides me all the comfort and productivity I need: it provides all necessary hunk operations such as apply, reverse, go to original, drop etc. I can transparently work from a remote machine via ssh, including editing, version control and the above diff operations peace of mind, by being rock solid and autosaving stuff. The only inconvenience is the sheer amount of keyboard equivalents, but I am getting used to them too. Thanks Emacs, without you I would probably drop! Posted by heisenbug at 7:55 AM No comments: Labels: emacs , llvm Older Posts Home Subscribe to: Comments (Atom) Blog Archive ▼  2022 (1) ▼  February (1) Pattern musings ►  2014 (5) ►  November (1) ►  October (1) ►  August (1) ►  July (1) ►  January (1) ►  2013 (5) ►  September (1) ►  August (3) ►  February (1) ►  2012 (2) ►  December (1) ►  September (1) ►  2011 (7) ►  December (1) ►  November (1) ►  October (1) ►  September (1) ►  August (1) ►  February (1) ►  January (1) ►  2010 (19) ►  December (5) ►  November (6) ►  October (1) ►  August (1) ►  July (2) ►  June (4) ►  2009 (12) ►  November (2) ►  October (1) ►  August (1) ►  June (1) ►  May (1) ►  March (4) ►  January (2) ►  2008 (22) ►  October (1) ►  September (3) ►  August (6) ►  July (3) ►  June (2) ►  May (1) ►  April (3) ►  March (1) ►  February (1) ►  January (1) ►  2007 (20) ►  December (2) ►  November (1) ►  October (1) ►  September (1) ►  August (1) ►  July (14) About Me heisenbug I am here and there. You may encounter me if you try, but no guarantees. Just a hint: I am mostly with my family. View my complete profile   | 2026-01-13T09:30:25 |
http://code.google.com/p/omega/#content | Google Code Archive - Long-term storage for Google Code Project Hosting. Code Archive Skip to content The Google Code Archive requires JavaScript to be enabled in your browser. Google About Google Privacy Terms | 2026-01-13T09:30:25 |
https://docs.asciidoctor.org/asciidoctorj/latest/project/ide/ | Develop in an IDE | Asciidoctor Docs Asciidoctor Docs In this project AsciiDoc Language Syntax Quick Reference Processing Asciidoctor Ruby Asciidoctor.js JavaScript AsciidoctorJ Java Extensions Add-on Converters PDF Ruby EPUB3 Ruby reveal.js Ruby, JavaScript Source Compilers Reducer Ruby, JavaScript Extended Syntax Asciidoctor Diagram Ruby Tooling Build Automation Maven Tools Java Gradle Plugin Java Asciidoclet Java Text Editors / Viewers Browser Extension IntelliJ Plugin Chat List --> Source Tweets AsciidoctorJ Distribution Installation Usage Command Line Interface Convert Documents The Asciidoctor Interface Conversion Options Locate Files Safe Modes Examples Converting to EPUB3 Ruby Runtime Register a Ruby Extension Logs Handling API Read the Document Tree Write a Custom Converter Extensions API AsciidoctorJ Conversion Process Overview Understanding the AST Classes Write an Extension Block Macro Processor Inline Macro Processor Block Processor Include Processor Preprocessor Postprocessor Treeprocessor Docinfo Processor Register Extensions Manually Registering Extensions with javaExtensionRegistry Bulk Extension Registration ( Extension Groups ) Automatically Loading Extensions Logging Syntax Highlighter API Implement a Syntax Highlighter Adapter Lifecycle of a SyntaxHighlighterAdapter Format the Source Block Element Link and Copy External Resources Static Syntax Highlighting During Conversion Invocation Order Automatically Load a Syntax Highlighter Help & Guides Updating to New Releases v3.0.x migration guide Extension Migration: 1.6.x to 2.0.x Extension Migration: 1.5.x to 1.6.x Running in Frameworks Using AsciidoctorJ in an OSGi environment Running AsciidoctorJ on WildFly Running AsciidoctorJ with Spring Boot Accessing the JRuby Instance Loading Ruby Libraries Loading External Gems with GEM_PATH Optimization Using a pre-release version Using a Snapshot Version Development Project Layout Local Development Develop in an IDE Continuous Integration AsciidoctorJ 3.0 AsciiDoc Asciidoctor 2.0 Asciidoctor.js 3.0 2.2 AsciidoctorJ 3.0 2.5 Asciidoctor PDF 2.3 2.2 2.1 2.0 Asciidoctor EPUB3 2.3 Asciidoctor reveal.js 5.0 4.1 Maven Tools 3.2 Gradle Plugin Suite 5.0 4.0 Asciidoclet 2.0 1.5.6 Asciidoctor Diagram 3.0.1 Browser Extension Community AsciidoctorJ Development Develop in an IDE 3.0 3.0 2.5 Edit this Page Develop in an IDE IntelliJ IDEA To import the project into IntelliJ IDEA, simply import the project using the import wizard. For more information, see the Gradle page in the IntelliJ IDEA Web Help. Eclipse To open the project in Eclipse, first generate the Eclipse project files: $ cd asciidoctorj-core ./gradlew eclipse Then, import the project into Eclipse using File   Import   General   Existing Project into Workspace . Local Development Continuous Integration Asciidoctor Home --> Docs Chat Source List (archive) @asciidoctor Copyright © 2026 Dan Allen, Sarah White, and individual Asciidoctor contributors. Except where noted, the content is licensed under a Creative Commons Attribution 4.0 International (CC BY 4.0) license. The UI for this site is derived from the Antora default UI and is licensed under the MPL-2.0 license. Several icons are imported from Octicons and are licensed under the MIT license. AsciiDoc® and AsciiDoc Language™ are trademarks of the Eclipse Foundation, Inc. Thanks to our backers and contributors for helping to make this project possible. Additional thanks to: Authored in AsciiDoc . Produced by Antora and Asciidoctor . | 2026-01-13T09:30:25 |
https://github.com/jeremyevans/ruby-american_date | GitHub - jeremyevans/ruby-american_date: American style month/day/year parsing for ruby 1.9+ Skip to content Navigation Menu Toggle navigation Sign in Appearance settings Platform AI CODE CREATION GitHub Copilot Write better code with AI GitHub Spark Build and deploy intelligent apps GitHub Models Manage and compare prompts MCP Registry New Integrate external tools DEVELOPER WORKFLOWS Actions Automate any workflow Codespaces Instant dev environments Issues Plan and track work Code Review Manage code changes APPLICATION SECURITY GitHub Advanced Security Find and fix vulnerabilities Code security Secure your code as you build Secret protection Stop leaks before they start EXPLORE Why GitHub Documentation Blog Changelog Marketplace View all features Solutions BY COMPANY SIZE Enterprises Small and medium teams Startups Nonprofits BY USE CASE App Modernization DevSecOps DevOps CI/CD View all use cases BY INDUSTRY Healthcare Financial services Manufacturing Government View all industries View all solutions Resources EXPLORE BY TOPIC AI Software Development DevOps Security View all topics EXPLORE BY TYPE Customer stories Events & webinars Ebooks & reports Business insights GitHub Skills SUPPORT & SERVICES Documentation Customer support Community forum Trust center Partners Open Source COMMUNITY GitHub Sponsors Fund open source developers PROGRAMS Security Lab Maintainer Community Accelerator Archive Program REPOSITORIES Topics Trending Collections Enterprise ENTERPRISE SOLUTIONS Enterprise platform AI-powered developer platform AVAILABLE ADD-ONS GitHub Advanced Security Enterprise-grade security features Copilot for Business Enterprise-grade AI features Premium Support Enterprise-grade 24/7 support Pricing Search or jump to... Search code, repositories, users, issues, pull requests... --> Search Clear Search syntax tips Provide feedback --> We read every piece of feedback, and take your input very seriously. Include my email address so I can be contacted Cancel Submit feedback Saved searches Use saved searches to filter your results more quickly --> Name Query To see all available qualifiers, see our documentation . Cancel Create saved search Sign in Sign up Appearance settings Resetting focus You signed in with another tab or window. Reload to refresh your session. You signed out in another tab or window. Reload to refresh your session. You switched accounts on another tab or window. Reload to refresh your session. Dismiss alert {{ message }} jeremyevans / ruby-american_date Public Notifications You must be signed in to change notification settings Fork 30 Star 106 American style month/day/year parsing for ruby 1.9+ 106 stars 30 forks Branches Tags Activity Star Notifications You must be signed in to change notification settings Code Issues 0 Pull requests 0 Discussions Actions Security Uh oh! There was an error while loading. Please reload this page . Insights Additional navigation options Code Issues Pull requests Discussions Actions Security Insights jeremyevans/ruby-american_date master Branches Tags Go to file Code Open more actions menu Folders and files Name Name Last commit message Last commit date Latest commit History 67 Commits .github/ workflows .github/ workflows lib lib spec spec .ci.gemfile .ci.gemfile .gitignore .gitignore CHANGELOG CHANGELOG MIT-LICENSE MIT-LICENSE README.rdoc README.rdoc Rakefile Rakefile american_date.gemspec american_date.gemspec View all files Repository files navigation README License ruby-american_date ruby-american_date exists to make ruby 1.9+ parse american-style month/day/year dates correctly, with behavior matching ruby 1.8.7. It can also be used on earlier ruby versions, but it is basically a noop there. As far as I know, there isn’t a gem that already handles this. You can find many snippets on the web that partially solve the issue, but most won’t be compatible with ruby 1.9.3, because Date.parse and DateTime.parse no longer call Date._parse directly on 1.9.3. Also most don’t handle cases where an american date format is used in addition to a time format. Note that this gem only handles / separated dates. It does not handle - or . separated dates. This is by design, for compatibility with ruby 1.8.7. Design The general idea is fairly simple. We look for a month/day/year substring in the input string, and if we find it, we transform it into a year-month-day ISO format string before passing it to the standard date parsing methods. This is probably the least invasive way that works correctly on both the pure-ruby date parser (<1.9.3) and the C extension date parser (>=1.9.3). Installation ruby-american_date is distributed as a gem, and can be installed with: gem install american_date Source ruby-american_date is hosted on GitHub: https :/ / github . com / jeremyevans / ruby - american_date Issues ruby-american_date uses GitHub Issues for issue tracking: https :/ / github . com / jeremyevans / ruby - american_date / issues Author Jeremy Evans <code@jeremyevans.net> About American style month/day/year parsing for ruby 1.9+ Resources Readme Uh oh! There was an error while loading. Please reload this page . Activity Stars 106 stars Watchers 5 watching Forks 30 forks Report repository Uh oh! There was an error while loading. Please reload this page . Contributors 4 Uh oh! There was an error while loading. Please reload this page . Languages Ruby 100.0% Footer © 2026 GitHub, Inc. Footer navigation Terms Privacy Security Status Community Docs Contact Manage cookies Do not share my personal information You can’t perform that action at this time. | 2026-01-13T09:30:25 |
https://github.com/jeremyevans/ruby-vorbis_comment/actions/workflows/ci.yml | CI · Workflow runs · jeremyevans/ruby-vorbis_comment · GitHub Skip to content Navigation Menu Toggle navigation Sign in Appearance settings Platform AI CODE CREATION GitHub Copilot Write better code with AI GitHub Spark Build and deploy intelligent apps GitHub Models Manage and compare prompts MCP Registry New Integrate external tools DEVELOPER WORKFLOWS Actions Automate any workflow Codespaces Instant dev environments Issues Plan and track work Code Review Manage code changes APPLICATION SECURITY GitHub Advanced Security Find and fix vulnerabilities Code security Secure your code as you build Secret protection Stop leaks before they start EXPLORE Why GitHub Documentation Blog Changelog Marketplace View all features Solutions BY COMPANY SIZE Enterprises Small and medium teams Startups Nonprofits BY USE CASE App Modernization DevSecOps DevOps CI/CD View all use cases BY INDUSTRY Healthcare Financial services Manufacturing Government View all industries View all solutions Resources EXPLORE BY TOPIC AI Software Development DevOps Security View all topics EXPLORE BY TYPE Customer stories Events & webinars Ebooks & reports Business insights GitHub Skills SUPPORT & SERVICES Documentation Customer support Community forum Trust center Partners Open Source COMMUNITY GitHub Sponsors Fund open source developers PROGRAMS Security Lab Maintainer Community Accelerator Archive Program REPOSITORIES Topics Trending Collections Enterprise ENTERPRISE SOLUTIONS Enterprise platform AI-powered developer platform AVAILABLE ADD-ONS GitHub Advanced Security Enterprise-grade security features Copilot for Business Enterprise-grade AI features Premium Support Enterprise-grade 24/7 support Pricing Search or jump to... Search code, repositories, users, issues, pull requests... --> Search Clear Search syntax tips Provide feedback --> We read every piece of feedback, and take your input very seriously. Include my email address so I can be contacted Cancel Submit feedback Saved searches Use saved searches to filter your results more quickly --> Name Query To see all available qualifiers, see our documentation . Cancel Create saved search Sign in Sign up Appearance settings Resetting focus You signed in with another tab or window. Reload to refresh your session. You signed out in another tab or window. Reload to refresh your session. You switched accounts on another tab or window. Reload to refresh your session. Dismiss alert {{ message }} jeremyevans / ruby-vorbis_comment Public Notifications You must be signed in to change notification settings Fork 1 Star 3 Code Issues 0 Pull requests 0 Discussions Actions Security Uh oh! There was an error while loading. Please reload this page . Insights Additional navigation options Code Issues Pull requests Discussions Actions Security Insights Actions: jeremyevans/ruby-vorbis_comment Actions --> All workflows Workflows CI CI Show more workflows... Management Caches Deployments CI CI Actions Loading... Loading Sorry, something went wrong. Uh oh! There was an error while loading. Please reload this page . --> will be ignored since log searching is not yet available Show workflow options Create status badge Create status badge Loading Uh oh! There was an error while loading. Please reload this page . ci.yml --> will be ignored since log searching is not yet available 5 workflow runs 5 workflow runs Event Filter by Event Sorry, something went wrong. Filter Loading Sorry, something went wrong. No matching events. Status Filter by Status Sorry, something went wrong. Filter Loading Sorry, something went wrong. No matching statuses. Branch Filter by Branch Sorry, something went wrong. Filter Loading Sorry, something went wrong. No matching branches. Actor Filter by Actor Sorry, something went wrong. Filter Loading Sorry, something went wrong. No matching users. Add Ruby 4.0 to CI CI #11: Commit 1c4831f pushed by jeremyevans 23m 43s master master 23m 43s View workflow file Use SimpleCov.add_filter block instead of string CI #10: Commit 42188b1 pushed by jeremyevans 41s master master 41s View workflow file Switch rdoc task to normal rake task, avoid rdoc/task require CI #9: Commit 204285f pushed by jeremyevans 44s master master 44s View workflow file Work with ubuntu-latest using 24.04 by default in CI CI #8: Commit 05037fb pushed by jeremyevans 47s master master 47s View workflow file Add Ruby 3.4 to CI CI #7: Commit aed5046 pushed by jeremyevans 55s master master 55s View workflow file You can’t perform that action at this time. | 2026-01-13T09:30:25 |
https://github.com/jeremyevans/hanna | GitHub - jeremyevans/hanna: RDoc generator designed with simplicity, beauty and ease of browsing in mind Skip to content Navigation Menu Toggle navigation Sign in Appearance settings Platform AI CODE CREATION GitHub Copilot Write better code with AI GitHub Spark Build and deploy intelligent apps GitHub Models Manage and compare prompts MCP Registry New Integrate external tools DEVELOPER WORKFLOWS Actions Automate any workflow Codespaces Instant dev environments Issues Plan and track work Code Review Manage code changes APPLICATION SECURITY GitHub Advanced Security Find and fix vulnerabilities Code security Secure your code as you build Secret protection Stop leaks before they start EXPLORE Why GitHub Documentation Blog Changelog Marketplace View all features Solutions BY COMPANY SIZE Enterprises Small and medium teams Startups Nonprofits BY USE CASE App Modernization DevSecOps DevOps CI/CD View all use cases BY INDUSTRY Healthcare Financial services Manufacturing Government View all industries View all solutions Resources EXPLORE BY TOPIC AI Software Development DevOps Security View all topics EXPLORE BY TYPE Customer stories Events & webinars Ebooks & reports Business insights GitHub Skills SUPPORT & SERVICES Documentation Customer support Community forum Trust center Partners Open Source COMMUNITY GitHub Sponsors Fund open source developers PROGRAMS Security Lab Maintainer Community Accelerator Archive Program REPOSITORIES Topics Trending Collections Enterprise ENTERPRISE SOLUTIONS Enterprise platform AI-powered developer platform AVAILABLE ADD-ONS GitHub Advanced Security Enterprise-grade security features Copilot for Business Enterprise-grade AI features Premium Support Enterprise-grade 24/7 support Pricing Search or jump to... Search code, repositories, users, issues, pull requests... --> Search Clear Search syntax tips Provide feedback --> We read every piece of feedback, and take your input very seriously. Include my email address so I can be contacted Cancel Submit feedback Saved searches Use saved searches to filter your results more quickly --> Name Query To see all available qualifiers, see our documentation . Cancel Create saved search Sign in Sign up Appearance settings Resetting focus You signed in with another tab or window. Reload to refresh your session. You signed out in another tab or window. Reload to refresh your session. You switched accounts on another tab or window. Reload to refresh your session. Dismiss alert {{ message }} jeremyevans / hanna Public forked from raggi/hanna Notifications You must be signed in to change notification settings Fork 15 Star 44 RDoc generator designed with simplicity, beauty and ease of browsing in mind License MIT license 44 stars 37 forks Branches Tags Activity Star Notifications You must be signed in to change notification settings Code Issues 0 Pull requests 0 Discussions Actions Security Uh oh! There was an error while loading. Please reload this page . Insights Additional navigation options Code Issues Pull requests Discussions Actions Security Insights jeremyevans/hanna master Branches Tags Go to file Code Open more actions menu Folders and files Name Name Last commit message Last commit date Latest commit History 252 Commits .github/ workflows .github/ workflows lib lib test test .ci.gemfile .ci.gemfile .gitignore .gitignore CHANGELOG CHANGELOG LICENSE LICENSE README.rdoc README.rdoc Rakefile Rakefile hanna.gemspec hanna.gemspec View all files Repository files navigation README MIT license Hanna Hanna is an RDoc generator built with simplicity, beauty and ease of browsing in mind. Installation gem install hanna Usage rdoc -o doc -f hanna lib An alternative is to set the ‘RDOCOPT` environment variable: RDOCOPT = "-f hanna" This will make RDoc always use hanna unless it is explicitly overridden. Integrating with RubyGems If you put the following line in your .gemrc, this will make RubyGems use Hanna for all rdoc generation: rdoc: -f hanna After doing this, if you wish to have documentation for all your installed gems to be formatted in hanna: gem rdoc --all --overwrite Rake task For repeated generation of API docs, you can set up a Rake task. Set hanna as the RDoc generator: require 'rdoc/task' RDoc :: Task . new do | rdoc | rdoc . generator = 'hanna' end Modification to RDoc Hanna makes a small modification to RDoc to generate more friendly documentation. It changes label lists to use a table instead of a description list, since it is very difficult to get visually appealing styling for description lists without cutting corners (like using fixed widths). Contributors The Hanna template was created by Mislav and since then has seen contributions from: Tony Strauss , who participated from the early start and made tons of fixes and enhancements to the template. Michael Granger who maintained the original RDoc template. Hongli Lai with the search filter for methods. Erik Hollensbe a serious refactoring and up to date with RDoc 2.5.x and 3.x, now named ‘hanna-nouveau’. James Tucker minor cleanups and RubyGems integration Jeremy Evans RDoc 4+ support, switch from haml/sass to erb, maintenance since 2014. About RDoc generator designed with simplicity, beauty and ease of browsing in mind Resources Readme License MIT license Uh oh! There was an error while loading. Please reload this page . Activity Stars 44 stars Watchers 2 watching Forks 15 forks Report repository Releases 41 tags Packages 0 No packages published Uh oh! There was an error while loading. Please reload this page . Languages Ruby 37.7% CSS 30.6% HTML 28.6% JavaScript 3.1% Footer © 2026 GitHub, Inc. Footer navigation Terms Privacy Security Status Community Docs Contact Manage cookies Do not share my personal information You can’t perform that action at this time. | 2026-01-13T09:30:25 |
https://github.com/jeremyevans/ruby-cicphash | GitHub - jeremyevans/ruby-cicphash: Case Insensitive Case Preserving Hash for ruby Skip to content Navigation Menu Toggle navigation Sign in Appearance settings Platform AI CODE CREATION GitHub Copilot Write better code with AI GitHub Spark Build and deploy intelligent apps GitHub Models Manage and compare prompts MCP Registry New Integrate external tools DEVELOPER WORKFLOWS Actions Automate any workflow Codespaces Instant dev environments Issues Plan and track work Code Review Manage code changes APPLICATION SECURITY GitHub Advanced Security Find and fix vulnerabilities Code security Secure your code as you build Secret protection Stop leaks before they start EXPLORE Why GitHub Documentation Blog Changelog Marketplace View all features Solutions BY COMPANY SIZE Enterprises Small and medium teams Startups Nonprofits BY USE CASE App Modernization DevSecOps DevOps CI/CD View all use cases BY INDUSTRY Healthcare Financial services Manufacturing Government View all industries View all solutions Resources EXPLORE BY TOPIC AI Software Development DevOps Security View all topics EXPLORE BY TYPE Customer stories Events & webinars Ebooks & reports Business insights GitHub Skills SUPPORT & SERVICES Documentation Customer support Community forum Trust center Partners Open Source COMMUNITY GitHub Sponsors Fund open source developers PROGRAMS Security Lab Maintainer Community Accelerator Archive Program REPOSITORIES Topics Trending Collections Enterprise ENTERPRISE SOLUTIONS Enterprise platform AI-powered developer platform AVAILABLE ADD-ONS GitHub Advanced Security Enterprise-grade security features Copilot for Business Enterprise-grade AI features Premium Support Enterprise-grade 24/7 support Pricing Search or jump to... Search code, repositories, users, issues, pull requests... --> Search Clear Search syntax tips Provide feedback --> We read every piece of feedback, and take your input very seriously. Include my email address so I can be contacted Cancel Submit feedback Saved searches Use saved searches to filter your results more quickly --> Name Query To see all available qualifiers, see our documentation . Cancel Create saved search Sign in Sign up Appearance settings Resetting focus You signed in with another tab or window. Reload to refresh your session. You signed out in another tab or window. Reload to refresh your session. You switched accounts on another tab or window. Reload to refresh your session. Dismiss alert {{ message }} jeremyevans / ruby-cicphash Public Notifications You must be signed in to change notification settings Fork 1 Star 7 Case Insensitive Case Preserving Hash for ruby ruby-cicphash.jeremyevans.net 7 stars 1 fork Branches Tags Activity Star Notifications You must be signed in to change notification settings Code Issues 0 Pull requests 0 Discussions Actions Security Uh oh! There was an error while loading. Please reload this page . Insights Additional navigation options Code Issues Pull requests Discussions Actions Security Insights jeremyevans/ruby-cicphash master Branches Tags Go to file Code Open more actions menu Folders and files Name Name Last commit message Last commit date Latest commit History 57 Commits .github/ workflows .github/ workflows test test .ci.gemfile .ci.gemfile .gitignore .gitignore CHANGELOG CHANGELOG MIT-LICENSE MIT-LICENSE README.rdoc README.rdoc Rakefile Rakefile cicphash.gemspec cicphash.gemspec cicphash.rb cicphash.rb View all files Repository files navigation README License CICPHash ruby-cicphash is a library that adds the CICPHash class, which has the same interface as Hash, but is case insensitive and case preserving. Any value can be used as a key. However, you cannot have two keys in the same CICPHash that would be the same if when converted to strings would be equal or differing only in case. For example, all of the following keys would be considered equalivalent: ‘ab’, ‘Ab’, ‘AB’, ‘aB’, :ab, :Ab, :AB, :aB CICPHash uses a last match wins policy. If an key-value pair is added to a CICPHash and a case insensitive variant of the key is already in the hash the instance of the key in the hash becomes the same the most recently added key (and the value is updated to reflect the new value). Example: require 'cicphash' hash = CICPHash . new hash [ :AB ] = 1 hash [ 'ab' ] # => 1 hash [ 'ab' ] = 2 hash # => {"ab"=>2} Installation gem install cicphash Source Code Source code is available on GitHub at github.com/jeremyevans/ruby-cicphash Reporting Bugs The bug tracker is located at github.com/jeremyevans/ruby-cicphash/issues License MIT Authors Jeremy Evans <code@jeremyevans.net> About Case Insensitive Case Preserving Hash for ruby ruby-cicphash.jeremyevans.net Resources Readme Uh oh! There was an error while loading. Please reload this page . Activity Stars 7 stars Watchers 1 watching Forks 1 fork Report repository Releases 1 tags Packages 0 No packages published Uh oh! There was an error while loading. Please reload this page . Languages Ruby 100.0% Footer © 2026 GitHub, Inc. Footer navigation Terms Privacy Security Status Community Docs Contact Manage cookies Do not share my personal information You can’t perform that action at this time. | 2026-01-13T09:30:25 |
http://vimcasts.org | Vimcasts - Free screencasts about the text editor Vim Menu Screencasts Articles Categories Training Publications Subscribe Vimcasts Screencasts Articles Categories Training Publications Subscribe VimCasts.org Learn Vim at your own pace with my self-study Core Vim Course. Learn more Learn Vim at your own pace with my self-study Core Vim Course. Learn more Learn essential Vim skills with Drew Neil, author of Practical Vim Explore the archives Vimcasts contains 76 free screencasts and 52 articles. Browse all content by category , or view all screencasts by publication date . Watch latest screencast Pasting into a terminal buffer # 76 Run time: 5:45 Feb 2, '18 Feb 2, 2018 Yanking and pasting works seemlessly between Neovim’s regular buffers and terminal buffers. In this video, we’ll look at how the Normal mode paste command works in a terminal buffer, and we’ll create a mapping to help with pasting text directly from Terminal mode. Watch screencast Read latest article Modern Vim Paperback now Shipping May 7, '18 May 7, 2018 I’m happy to announce that Modern Vim is now available as a paperback. You can purchase it directly from The Pragmatic Bookshelf . Continue reading Level-up your Vim Training Boost your productivity with a Vim training class . Join a public class, or book a private session for your team. Drew hosted a private Vim session for the shopify team that was one of the best workshops I have ever attended. John Duff, Director of Engineering at Shopify Publications Make yourself a faster and more efficient developer with the help of these publications , including Practical Vim (Pragmatic Bookshelf 2012), which has over 50 five-star reviews on Amazon. After reading it, I've switched to vim as my default editor on a daily basis with no regrets. ★★★★★ Javier Collado Learn to use Vim efficiently in your Ruby projects In association with thoughtbot, one of the most well respected Rails consultancies in the world, I've produced a series of screencasts on how to make navigating your Ruby projects with Vim ultra-efficient. Along the way, you’ll also learn how to make Ruby blocks a first-class text object in Vim. This lets you edit Ruby code at a higher level of abstraction. Available to buy from thoughtbot. . About Announcements Leave a tip Vimcasts.org established MMX | 2026-01-13T09:30:25 |
https://upsilon.cc/~zack/hacking/ | hacking zack's home page / hacking home research publications committees teaching hacking debian software talks blog about I like hacking (but this is about hacker s, and has basically nothing to do with black hat s). As a hacking enthusiast I can't stand being locked away from information and in particular source code. It should come as no surprise I'm a free software enthusiast, Free Software Foundation associate member, Free Software Foundation Europe fellow, and Software Freedom Conservancy supporter. These days, my hacking time is mostly devoted to contributing to the Debian project , but I'm also developing some free software on my own. debian -related stuff some software of mine Copyright © 2007-2022 by Stefano Zacchiroli <zack@upsilon.cc> Homepage by Stefano Zacchiroli is licensed under a Creative Commons Attribution-ShareAlike 4.0 International License . Last edited Sat 26 Dec 2015 12:36:32 PM CET Fri 21 Dec 2007 11:06:42 AM CET --> | 2026-01-13T09:30:25 |
https://upsilon.cc/~zack/blog/posts/2011/07/16_months_of_debian_sprints/ | 16 months of debian sprints zack's home page / blog / posts / 2011 / 07 / 16 months of debian sprints average sprint speed: 1 sprint/month I've proposed a DebConf11 BoF on Debian sprints and, more generally, on how we have been using Debian money in the past 1.3 years. As part of the BoF preparation, I've taken the time to review the last 16 months of sprints and check how the Debian Sprint Program — which we've recently streamlined and "marketed" quite a bit — is going. In particular, I've finally done the homework of preparing the big table™ of sprints and their costs, in order to evaluate how sustainable the sprint program is. Without further ado, here is the table: Debian sprints held from April 2010 to June 2011 No Sprint When (month) Where Attendees Debian cost (EUR) 1 groupware ( report ) 04/2010 de 4 240 2 FAI ( report ) 06/2010 de 7 570 (DebConf10) 08/2010 us 3 ftpmaster ( report ) 09/2010 de 3 350 4 DSA ( report ) 09/2010 de 3 400 5 release team ( report ) 10/2010 fr 6 0 6 kernel team ( report ) 10/2010 fr 3 120 7 www team 12/2010 at 5 1430 8 debian med 01/2011 de 25 460 9 security team 01/2011 de 7 1000 10 emdebian 02/2011 uk 17 0 11 ftpmaster 03/2011 de 5 2000 12 groupware 04/2011 de 6 300 13 alioth 05/2011 uk 4 500 14 debian edu 06/2011 de 9 760 15 release team 06/2011 be 5 1640 (DebConf11) 07/2010 ba Total 15 sprints 16 months 9770 To better understand the table, several comments are in order: numbers are approximate in various ways. In particular, 2010 costs predate a protocol I've agreed upon with the Debian auditors to do proper accounting, hence it is possible that some costs are slightly overestimated costs are Debian's costs and do not include reimbursements for non-Debian people that might have attended the sprint. This also explains why some sprints have been at 0 cost: they have been entirely sponsored by other entities interested in supporting Debian, such as companies or institutions. where needed, costs have been normalized to Euro we have streamlined the sprint process around October 2010 (you can find the underlying rationales in an old RFC ). Sprints happened before that data had a different way of being announced and of reporting back to the project. the above data are not detailed enough to properly estimate per-person costs, as we lack a breakdown of Debian vs non-Debian attendees no costs for DebConf-s are included, as they have their own budgets which aims to be amortized 0 cost in the long run Please note that the purpose of the table is not to be precise and transparent about Debian finances and how we use them. That is a (very!) worthwhile goal and I do think Debian should do much better in informing its community about how donated money are used to further Debian goals. But that is a broader topic on which the auditors are working; it is not up to me to discuss it here. If you are interested in that topic though, you might want to follow tbm's BoF at DebConf11 . The purpose of the table is rather to find out some general figures about Debian sprints held in the recent past: we have had a total of 15 sprints in 16 months (about 1 sprint/month) we have spent about 10'000 EUR for sprints, for an average per-sprint cost of about 650 EUR all sprints have been held in Europe (given DD geographical distribution , I find quite surprising that no group of US-based Debian hackers have asked for sprint sponsoring) about half of the sprints have been held in Germany (probably thanks to DD-density there and also to the welcoming attitude of friendly venues such as the Linux Hotel) the variance of per-person costs is high: there are very cheap sprints (e.g. when people travel within Europe by train and stay at friends') and quite expensive sprints (e.g. when one or more of the participant needs to be flown oversea — which has happened only once, up to now) I'm personally quite happy about those figures. Enabling volunteer developers to meet and hack together in person is possibly the most valuable way of using donated money. Having 1 sprint/month is not bad, but in a project the size of Debian is quite possibly a minimum. Doing more than that is highly desirable. It is also financially sustainable, especially if we will be able to show — by actually having more sprints and being transparent about them — that we can put into good use donated money. Another, more subtle, aspect of sustainability is that related to sprint management. Processing sprint requests and ensuring that transparency guidelines are actually followed by the organizers is still quite some work. I've been mostly doing that myself up to now, which is all fine and well, but does not necessarily scale. Other organizations (such as KDE e.V.) have realized that to the point of having hired people specifically to manage sprints in an otherwise volunteer community. In Debian we are quite keen of maintaining the project running on a volunteer basis. At the same time I feel we should have more room for scalability in the number of sprints we could run. So if you are looking for a management task to help Debian with, think about becoming, err, "sprint master", and contact me. If otherwise you want to focus on Debian hacking, what are you waiting for? Check the guidelines and propose your sprint! To know more about sprints, Debian money, and how you could help with all that, be sure not to miss the Sprint and money BoF . Tags: bof debconf11 debian dpl lang/english planet-debian sprint Copyright © 2007-2022 by Stefano Zacchiroli <zack@upsilon.cc> Homepage by Stefano Zacchiroli is licensed under a Creative Commons Attribution-ShareAlike 4.0 International License . Last edited Fri 22 Jul 2011 11:35:39 PM CEST Fri 22 Jul 2011 11:35:39 PM CEST --> | 2026-01-13T09:30:25 |
https://ko-kr.facebook.com/login/?next=https%3A%2F%2Fwww.facebook.com%2FSoftwareFreedomConservancy%2F | Facebook Facebook 이메일 또는 휴대폰 비밀번호 계정을 잊으셨나요? 새 계정 만들기 일시적으로 차단됨 일시적으로 차단됨 회원님의 이 기능 사용 속도가 너무 빠른 것 같습니다. 이 기능 사용에서 일시적으로 차단되었습니다. Back 한국어 English (US) Tiếng Việt Bahasa Indonesia ภาษาไทย Español 中文(简体) 日本語 Português (Brasil) Français (France) Deutsch 가입하기 로그인 Messenger Facebook Lite 동영상 Meta Pay Meta 스토어 Meta Quest Ray-Ban Meta Meta AI Meta AI 콘텐츠 더 보기 Instagram Threads 투표 정보 센터 개인정보처리방침 개인정보 보호 센터 정보 광고 만들기 페이지 만들기 개발자 채용 정보 쿠키 AdChoices 이용 약관 고객 센터 연락처 업로드 및 비사용자 설정 활동 로그 Meta © 2026 | 2026-01-13T09:30:25 |
https://github.com/jeremyevans/unicorn-lockdown | GitHub - jeremyevans/unicorn-lockdown: Helper library for running Unicorn on OpenBSD with chroot, privdrop, fork+exec, and pledge Skip to content Navigation Menu Toggle navigation Sign in Appearance settings Platform AI CODE CREATION GitHub Copilot Write better code with AI GitHub Spark Build and deploy intelligent apps GitHub Models Manage and compare prompts MCP Registry New Integrate external tools DEVELOPER WORKFLOWS Actions Automate any workflow Codespaces Instant dev environments Issues Plan and track work Code Review Manage code changes APPLICATION SECURITY GitHub Advanced Security Find and fix vulnerabilities Code security Secure your code as you build Secret protection Stop leaks before they start EXPLORE Why GitHub Documentation Blog Changelog Marketplace View all features Solutions BY COMPANY SIZE Enterprises Small and medium teams Startups Nonprofits BY USE CASE App Modernization DevSecOps DevOps CI/CD View all use cases BY INDUSTRY Healthcare Financial services Manufacturing Government View all industries View all solutions Resources EXPLORE BY TOPIC AI Software Development DevOps Security View all topics EXPLORE BY TYPE Customer stories Events & webinars Ebooks & reports Business insights GitHub Skills SUPPORT & SERVICES Documentation Customer support Community forum Trust center Partners Open Source COMMUNITY GitHub Sponsors Fund open source developers PROGRAMS Security Lab Maintainer Community Accelerator Archive Program REPOSITORIES Topics Trending Collections Enterprise ENTERPRISE SOLUTIONS Enterprise platform AI-powered developer platform AVAILABLE ADD-ONS GitHub Advanced Security Enterprise-grade security features Copilot for Business Enterprise-grade AI features Premium Support Enterprise-grade 24/7 support Pricing Search or jump to... Search code, repositories, users, issues, pull requests... --> Search Clear Search syntax tips Provide feedback --> We read every piece of feedback, and take your input very seriously. Include my email address so I can be contacted Cancel Submit feedback Saved searches Use saved searches to filter your results more quickly --> Name Query To see all available qualifiers, see our documentation . Cancel Create saved search Sign in Sign up Appearance settings Resetting focus You signed in with another tab or window. Reload to refresh your session. You signed out in another tab or window. Reload to refresh your session. You switched accounts on another tab or window. Reload to refresh your session. Dismiss alert {{ message }} jeremyevans / unicorn-lockdown Public Notifications You must be signed in to change notification settings Fork 0 Star 10 Helper library for running Unicorn on OpenBSD with chroot, privdrop, fork+exec, and pledge 10 stars 0 forks Branches Tags Activity Star Notifications You must be signed in to change notification settings Code Issues 0 Pull requests 0 Discussions Actions Security Uh oh! There was an error while loading. Please reload this page . Insights Additional navigation options Code Issues Pull requests Discussions Actions Security Insights jeremyevans/unicorn-lockdown master Branches Tags Go to file Code Open more actions menu Folders and files Name Name Last commit message Last commit date Latest commit History 83 Commits .github/ workflows .github/ workflows bin bin files files lib lib test test .gitignore .gitignore CHANGELOG CHANGELOG MIT-LICENSE MIT-LICENSE README.rdoc README.rdoc Rakefile Rakefile unicorn-lockdown.gemspec unicorn-lockdown.gemspec View all files Repository files navigation README License unicorn-lockdown unicorn-lockdown is a helper library for running Unicorn on OpenBSD with pledge, unveil, and fork+exec for increased security. With unicorn-lockdown, unicorn should be started as the application user, which should be different than the user that owns the application’s files. unicorn will pledge the master process, then fork worker processes. The worker processes will re-exec (fork+exec), then load the application, then set unveil to restrict file system access, then pledge to limit the allowed system calls at runtime. Assumptions unicorn-lockdown assumes you are using OpenBSD 6.6+ with the nginx and rubyXY-unicorn and rubyXY-pledge packages installed, and that you have a unicorn symlink in the PATH to the appropriate unicornXY executable. It also assumes you have a SMTP server listening on localhost port 25 to receive notification emails of worker crashes, if you are notifying for those. Usage unicorn-lockdown-setup To start the process of setting up your system to use unicorn-lockdown, run the following as root after reading the file and understanding what it does. unicorn - lockdown - setup Briefly, the configuration this uses the following directories: /var/www/sockets Stores unix sockets that Unicorn listens on and Nginx uses. /var/www/request-error-info Stores temporary files for each request with request info, used for crash notifications /var/log/unicorn Stores unicorn log files, one per application /var/log/nginx Stores nginx log files, two per application, one for access and one for errors This adds a _unicorn group that all application users will use as one of their groups, as well as a /etc/rc.d/rc.unicorn file that the application /etc/rc.d/unicorn_* files will use. unicorn-lockdown-add For each application you want to run with unicorn lockdown, run the following as root, again after reading the file and understanding what it does: unicorn-lockdown-add -o $owner -u $user $app_name Here’s the usage: Usage: unicorn-lockdown-add -o owner -u user [options] app_name Options: -c RACKUP_FILE rackup configuration file -d DIR application directory name -f UNICORN_FILE unicorn configuration file relative to application directory -o OWNER operating system application owner -u USER operating system user to run application --uid UID user id to use if creating the user when -U is specified -h, -?, --help Show this message The -o and -u options are required. Default values for other options are: -c None, Unicorn will use config.ru by default. -d Same as app_name . The value provided should a relative path under /var/www . -f unicorn.conf . This file should be relative to dir . --uid The uid automatically generated by useradd . The owner -o and the user -u should be different. The user is the user the application runs as, and should have read-only access to the application directory, other than locations where you want the application user to be able to modify files at runtime. The owner is the user that owns the application directory and can make modifications to the application. unicorn-lockdown unicorn-lockdown is the library required in your unicorn configuration file for the application, to handle configuring unicorn to run the app with fork+exec, unveil, and pledge. When you run unicorn-lockdown-add, it will create the unicorn configuration file for the app if one does not already exist, looking similar to: require 'unicorn-lockdown' Unicorn . lockdown ( self , :app => "app_name" , # Update this with correct email :email => 'root' , # More pledges may be needed depending on application :pledge => 'rpath prot_exec inet unix flock' , :master_pledge => 'rpath prot_exec cpath wpath inet proc exec' , :master_execpledge => 'stdio rpath prot_exec inet unix cpath wpath unveil flock' , # More unveils may be needed depending on application :unveil => { 'views' => 'r' }, :dev_unveil => { 'models' => 'r' }, ) Unicorn.lockdown options: :app (required) a short string for the name of the application, used for socket/log file names and in notifications :email (optional) an email address to use for notifications when the worker process crashes or an unhandled exception is raised by the application or middleware. :pledge (required) a pledge string to limit the allowed system calls after privileges have been dropped :master_pledge (optional) The string to use when pledging the master process before spawning worker processes :master_execpledge (optional) The pledge string for processes spawned by the master process (i.e. worker processes before loading the app) :unveil (required) a hash of paths to limit file system access, passed to Pledge.unveil . :dev_unveil (optional) a hash of paths to limit file system, merged into the :unveil option paths if in the development environment. Useful if you are allowing more access in development, such as access needed for file reloading. With this example pledge: rpath is needed to read files prot_exec is needed in most cases unix is needed for the unix socket to nginx inet is not needed in all cases, but most applications need some form of network access, and it is needed by default for emailing about exceptions that occur without process crashes. pf (OpenBSD’s firewall) should be used to limit access for the application’s operating system user to the minimum necessary access needed. flock is needed in Ruby 3.1+ (not necessarily required in older Ruby versions). With this example master pledge: rpath is needed to read files prot_exec is needed in most cases cpath and wpath are needed to unlink the request error files inet is needed to send emails for worker crashes proc and exec are needed to spawn worker processes With this examle master exec pledge: stdio must be added because ruby-pledge doesn’t add it automatically to execpromises, and Ruby requires it rpath, prot_exec, unix, inet are needed for the worker (see above) cpath and wpath are needed to create the request error files unveil is needed to restrict file system access unicorn-lockdown has specific support for allowing emails to be sent for Unicorn worker crashes (e.g. pledge violations) and unhandled application exceptions (e.g. pledge violations). Additionally, unicorn-lockdown modifies unicorn’s process status line in a way that allows it to be controllable via OpenBSD’s rcctl program for stopping/starting/reloading/restarting daemons. By default, Unicorn.lockdown limits the client_body_buffer_size to 11MB, with the expectation of an Nginx limit of 10MB, such that all client requests will be buffered in memory and unicorn will not need to write temporary files to disk. If this limit is not correct for your application, please call client_body_buffer_size after calling Unicorn.lockdown to set an appropriate limit. Note that rack still creates temporary files for file uploads by default, you’ll need to configure rack to disallow file uploads if your application does not need to accept uploaded files and you don’t want file upload attempts to cause pledge violations. With Roda, you can use the disallow_file_uploads plugin to prevent file upload attempts. When Unicorn.lockdown is used with the :email option, if the worker process crashes, it will email the address using the contents specified by the request file. To make sure there is useful information to email in the case of a crash, you need to populate the request information for all requests. If you are using Roda, one way to do this is to use the error_email or error_mail plugins: plugin :error_email , :from => 'foo@example.com' , :to => 'foo@example.com' , :prefix => '[app_name]' # or plugin :error_mail , :from => 'foo@example.com' , :to => 'foo@example.com' , :prefix => '[app_name]' and then at the top of the route block, do: if defined? ( Unicorn ) && Unicorn . respond_to? ( :write_request ) Unicorn . write_request ( error_email_content ( "Unicorn Worker Process Crash" )) # or Unicorn . write_request ( error_mail_content ( "Unicorn Worker Process Crash" )) end If you don’t have useful information in the request file, an email will still be sent for notification purposes, but it will not include request related information, which could make it difficult to diagnose the underlying problem. roda-pg_disconnect If you are using PostgreSQL as the database for the application, and using unix sockets to connect the application to the database, if the database is restarted, the application will no longer be able to connect to it unless you unveil the path the database socket (stored in /tmp by default). It can be a better approach security wise not to allow this, to prevent the application from being able to establish new database connections with potentially different credentials, as a mitigation in case the server is compromised. To allow the application to handle cases where the database is disconnected, such as due to a restart of PostgreSQL, you can kill the worker process if a disconnect error is detected, and have the master process then spawn a new worker. The roda-pg_disconnect plugin is a plugin for the roda web toolkit to kill the worker process after handling the connection if it detects the database connection has been lost. This plugin assumes the use of the Sequel database library and postgres adapter with the pg driver. In your Roda application: # Sometime before loading the error_handler plugin plugin :pg_disconnect To specifically restrict access to the database socket even when access to /tmp is allowed, you can unveil the database socket path with no permissions: '/tmp/.s.PGSQL.5432' => '' Note that there are potentially other security issues with unveiling access to /tmp beyond granting access to the database server, so it is recommended you do not unveil it. If the application needs a directory for temporary files (e.g. for handling uploaded files with rack), you can set the TMPDIR environment variable to an appropriate directory that is writable by the application user and not other users, and most web applications will respect that (assuming they use the tmpfile/tmpdir libraries in the standard library). rack-email_exceptions rack-email_exceptions is a rack middleware designed to wrap all other middleware and the application. It rescues unhandled exceptions raised by subsequent middleware or the application itself. Unicorn.lockdown will automatically setup this middleware if the :email option is used. It is possible to use this middleware manually: require 'rack/email_exceptions' use Rack :: EmailExceptions , "app_name" , 'foo@example.com' unveiler unveiler is a library designed to help with testing applications that use pledge and unveil. If you are running your application pledged and unveiled, you want your tests to run pledged and unveiled to find problems. unveiler assumes you are using minitest for testing. To use unveiler: require 'minitest/autorun' require 'unveiler' at_exit do Unveiler . pledge_and_unveil ( 'rpath prot_exec inet unix' , 'views' => 'r' ) end autoload As you’ll find out if you try to run your applications with unveil, autoload and other forms of runtime requires are the enemy. Both unicorn-lockdown and unveiler have support for handling common autoloaded constants in the rack and mail gems. If you use other gems that use autoload or runtime requires, you’ll have to add unveils for the appropriate gems: Unicorn . lockdown ( self , # ... :unveil => { 'views' => 'r' , 'gem-name' => :gem , } ) Author Jeremy Evans <code@jeremyevans.net> About Helper library for running Unicorn on OpenBSD with chroot, privdrop, fork+exec, and pledge Resources Readme Uh oh! There was an error while loading. Please reload this page . Activity Stars 10 stars Watchers 0 watching Forks 0 forks Report repository Uh oh! There was an error while loading. Please reload this page . Languages Ruby 100.0% Footer © 2026 GitHub, Inc. Footer navigation Terms Privacy Security Status Community Docs Contact Manage cookies Do not share my personal information You can’t perform that action at this time. | 2026-01-13T09:30:25 |
https://upsilon.cc/~zack/about/ | about zack's home page / about home research publications committees teaching hacking debian software talks blog about Some facts about Zack's home page (i.e. this website): This website content is (unless otherwise stated at the bottom of the page) copyright © Stefano Zacchiroli <zack@upsilon.cc> . This website content license is (unless otherwise stated at the bottom of the page) CC Attribution-Share Alike 4.0 , with attribution via backlink to the page you took content from. This website is powered by : ikiwiki , git , emacs , markdown , debian (you can bet it's all free software !). The code is available via git/gitweb as usual, you can also webcheckout http://upsilon.cc/~zack . All web pages strive to be interoperable , being (hopefully) valid XHTML 1.0 Strict . You can check that by yourself clicking on the corresponding icon at the bottom of each page, you are welcome to mail me if you find non-valid pages. This website is not a general purpose wiki, this means that in general you can't edit its pages . However, there are 2 notable exceptions: the wiki section is freely editable, as well as all discussion pages and blog post comments ; registration or an OpenID account are required in order to edit. ... on the dark side: This website sports the following (internal) broken links (and yes, I should probably do something about them, if any): 6D866396.asc from new GPG key 6D866396 key-transition.2010.txt from new GPG key 6D866396 Copyright © 2007-2022 by Stefano Zacchiroli <zack@upsilon.cc> Homepage by Stefano Zacchiroli is licensed under a Creative Commons Attribution-ShareAlike 4.0 International License . Last edited Fri 03 Oct 2014 01:47:09 PM CEST Fri 21 Dec 2007 04:48:07 PM CET --> | 2026-01-13T09:30:25 |
https://github.com/jeremyevans/fixture_dependencies | GitHub - jeremyevans/fixture_dependencies: Sequel/ActiveRecord fixture loader that handles dependency graphs Skip to content Navigation Menu Toggle navigation Sign in Appearance settings Platform AI CODE CREATION GitHub Copilot Write better code with AI GitHub Spark Build and deploy intelligent apps GitHub Models Manage and compare prompts MCP Registry New Integrate external tools DEVELOPER WORKFLOWS Actions Automate any workflow Codespaces Instant dev environments Issues Plan and track work Code Review Manage code changes APPLICATION SECURITY GitHub Advanced Security Find and fix vulnerabilities Code security Secure your code as you build Secret protection Stop leaks before they start EXPLORE Why GitHub Documentation Blog Changelog Marketplace View all features Solutions BY COMPANY SIZE Enterprises Small and medium teams Startups Nonprofits BY USE CASE App Modernization DevSecOps DevOps CI/CD View all use cases BY INDUSTRY Healthcare Financial services Manufacturing Government View all industries View all solutions Resources EXPLORE BY TOPIC AI Software Development DevOps Security View all topics EXPLORE BY TYPE Customer stories Events & webinars Ebooks & reports Business insights GitHub Skills SUPPORT & SERVICES Documentation Customer support Community forum Trust center Partners Open Source COMMUNITY GitHub Sponsors Fund open source developers PROGRAMS Security Lab Maintainer Community Accelerator Archive Program REPOSITORIES Topics Trending Collections Enterprise ENTERPRISE SOLUTIONS Enterprise platform AI-powered developer platform AVAILABLE ADD-ONS GitHub Advanced Security Enterprise-grade security features Copilot for Business Enterprise-grade AI features Premium Support Enterprise-grade 24/7 support Pricing Search or jump to... Search code, repositories, users, issues, pull requests... --> Search Clear Search syntax tips Provide feedback --> We read every piece of feedback, and take your input very seriously. Include my email address so I can be contacted Cancel Submit feedback Saved searches Use saved searches to filter your results more quickly --> Name Query To see all available qualifiers, see our documentation . Cancel Create saved search Sign in Sign up Appearance settings Resetting focus You signed in with another tab or window. Reload to refresh your session. You signed out in another tab or window. Reload to refresh your session. You switched accounts on another tab or window. Reload to refresh your session. Dismiss alert {{ message }} jeremyevans / fixture_dependencies Public Notifications You must be signed in to change notification settings Fork 28 Star 47 Sequel/ActiveRecord fixture loader that handles dependency graphs License MIT license 47 stars 28 forks Branches Tags Activity Star Notifications You must be signed in to change notification settings Code Issues 0 Pull requests 0 Discussions Actions Security Uh oh! There was an error while loading. Please reload this page . Insights Additional navigation options Code Issues Pull requests Discussions Actions Security Insights jeremyevans/fixture_dependencies master Branches Tags Go to file Code Open more actions menu Folders and files Name Name Last commit message Last commit date Latest commit History 144 Commits .github/ workflows .github/ workflows lib lib spec spec .ci.gemfile .ci.gemfile .gitignore .gitignore CHANGELOG CHANGELOG MIT-LICENSE MIT-LICENSE README.md README.md Rakefile Rakefile fixture_dependencies.gemspec fixture_dependencies.gemspec View all files Repository files navigation README MIT license fixture_dependencies fixture_dependencies is a fixture loader, allowing the loading of models from YAML fixtures, along with their entire dependency graph. It has the following features: Fixtures specify association names instead of foreign keys Supports both Sequel and ActiveRecord Supports many_to_one/belongs_to, one_to_many/has_many, many_to_many/has_and_belongs_to_many, and has_one/one_to_one associations Loads a fixture's dependency graph in such a manner that foreign key constraints aren't violated Has a simple API ( FixtureDependencies.load(:model__fixture) ) Handles almost all cyclic dependencies Includes Rails and Sequel test helpers for Test::Unit (and a Sequel test helper for RSpec) that load fixtures for every test inside a transaction, so fixture data is never left in your database Installation gem install fixture_dependencies Source Source is available via github: http://github.com/jeremyevans/fixture_dependencies Usage With Rails/ActiveRecord/Test::Unit: Add the following to test/test_helper.rb after "require 'test_help'": require 'fixture_dependencies/test_unit/rails' This overrides the default test helper to load the fixtures inside transactions and to use FixtureDependencies to load the fixtures. With Sequel/Test::Unit: Somewhere before the test code is loaded: require 'fixture_dependencies/test_unit/sequel' Make sure the test case classes use FixtureDependencies::SequelTestCase: class ModelTest < FixtureDependencies::SequelTestCase This runs the test cases inside a Sequel transaction. With Sequel/RSpec: Somewhere before the test code is loaded: require 'fixture_dependencies/rspec/sequel' This runs each spec inside a separate Sequel transaction. With Minitest/Spec: Somewhere before the test code is loaded: require 'fixture_dependencies/minitest_spec/sequel' This runs each spec inside a separate Sequel transaction. With Rails and Minitest: You can add the following in your test_helper.rb file. ENV [ 'RAILS_ENV' ] ||= 'test' require_relative '../config/environment' require 'rails/test_help' require 'fixture_dependencies/helper_methods' class ActiveSupport :: TestCase # we are monkey-patching. # Run tests in parallel with specified workers parallelize ( workers : :number_of_processors ) # Add more helper methods to be used by all tests here... include FixtureDependencies :: HelperMethods FixtureDependencies . fixture_path = './test/fixtures' # set the path of your fixtures def run ( * args , & block ) Sequel :: Model . db . transaction ( :rollback => :always ) { super } end end With other testing libraries: You can just use FixtureDependencies.load to handle the loading of fixtures. The use of transactions is up to you. One thing you must do if you are not using the rails test helper is to set the fixture path for FixtureDependencies: FixtureDependencies.fixture_path = '/path/to/fixtures' A few helper methods are also available, just include them in your test superclass: require 'fixture_dependencies/helper_methods' class Test < Minitest::Test include FixtureDependencies::HelperMethods end Changes to Rails default fixtures: fixture_dependencies is designed to require the least possible changes to the default YAML fixtures used by Rails (well, at least Rails 1.2 and earlier). For example, see the following changes: OLD NEW asset1: asset1: id: 1 id: 1 employee_id: 2 employee: jeremy product_id: 3 product: nx7010 vendor_id: 2 vendor: lxg_computers note: in working order note: in working order As you can see, you just replace the foreign key attribute and value with the name of the association and the associations name. This assumes you have an employee fixture with a name of jeremy, and products fixture with the name of nx7010, and a vendors fixture with the name lxg_computers. Fixture files still use the table_name of the model. Note that you should hard code primary key values for each fixture, as shown in the example above. ERB Fixtures Fixtures can also use ERB to preprocess the fixture file, useful if you need to do any programming inside the fixture file, such as looping to create multiple records. For the ERB support to be invoked, your fixture file should be named #{table_name}.yml.erb instead of #{table_name}.yml . You can mix ERB fixture files and regular fixture files, but you cannot have an ERB fixture file and a regular fixture file for the same table (the regular fixture file will be used in that case). Changes to the fixtures Class Method: fixture_dependencies can still use the fixtures class method in your test: class EmployeeTest < Test::Unit::TestCase fixtures :assets end In Rails default testing practices, the arguments to fixtures are table names. fixture_dependencies changes this to underscored model names. If you are using Rails' recommended table practices, this shouldn't make a difference. It is recommended that you do not use the fixtures method, and instead load individual fixtures as needed (see below). This makes your tests more robust, in case you want to add or remove individual fixtures at a later date. Loading individual fixtures with fixtures class method There is support for loading individual fixtures (and just their dependencies), using the following syntax: class EmployeeTest < Test::Unit::TestCase fixtures :employee__jeremy # Note the double underscore end This would load just the jeremy fixture and its dependencies. This is better than loading all fixtures for the model. Even better is loading just the fixtures you want inside every test method (see below). Loading fixtures inside test methods It is better to skip the use of the fixtures method entirely, and load specific fixtures manually in each test method. This reduces coupling and makes tests less brittle. Here's an example: class EmployeeTest < Test::Unit::TestCase def test_employee_name # Load the fixture and return the Employee object employee = load(:employee__jeremy) # Test the employee end def test_employees # Load the fixtures and return two Employee objects employee1, employee2 = load(:employees=>[:jeremy, :karl]) # Test the employees end def test_award_statistics # Load all fixtures in both tables load(:employee_award__jeremy_first, :award__first) # Test the award_statistics method # (which pulls data from the tables loaded above) end end Don't worry about loading the same fixture twice, if a fixture is already loaded, it won't attempt to load it again. One downside of this approach is it can be slower that loading all fixtures before the test suite. Loading attributes only You can load only the attributes of fixtures, without saving them with load_attributes. This is useful for occasions where you want to mutate attributes without having to create lots of fixtures or want to test code that is run before or after the database transaction (validations, model hooks). # load_attributes responds like load, but without saving the record fruit = load_attributes(:fruit__banana) # test the behaviour before saving the record fruit.save # test the behaviour after saving the record You can also use the build method for loading the attributes of a single record, merging the attributes passed as options. This is useful for testing changes in behaviour when mutating a single parameter: old_banana = build(:fruit__banana, :age=>'old') fresh_banana = build(:fruit__banana, :age=>'new') old_banana.must_be :rotten? new_banana.wont_be :rotten? one_to_many/many_to_many/has_many/has_and_belongs_to_many assocations Here's an example of using has_one (logon_information), has_many (assets), and has_and_belongs_to_many (groups) associations. jeremy: id: 2 name: Jeremy Evans logon_information: jeremy assets: [asset1, asset2, asset3] groups: [group1] logon_information is a has_one association to another table which was split from the employees table due to database security requirements. Assets is a has_many association, where one employee is responsible for the asset. Employees can be a member of multiple groups, and each group can have multiple employees. For has_* associations, after fixture_dependencies saves jeremy, it will load and save logon_information (and its dependencies...), it will load each asset in the order specified (and their dependencies...), and it will load all of the groups in the order specified (and their dependencies...). Note that there is only a load order inside a specific association, associations are stored in the same hash as attributes and are loaded in an arbitrary order. many_to_many/has_and_belongs_to_many join table fixtures Another change is that Rails defaults allow you to specify habtm join tables in fixtures. That doesn't work with fixture dependencies, as there is no associated model. Instead, you use a has_and_belongs_to_many association name in the the appropriate model fixtures (see above). belongs_to/many_to_one polymorphic fixtures ActiveRecord supports polymorphic associations by default. With Sequel, this is made via the sequel_polymorphic gem. Here the mapping in Rails: class Animal < ActiveRecord::Base has_many :fruits, as: :eater end class Fruit < ActiveRcord::Base belongs_to :eater, polymorphic: true end And here on Sequel: require 'sequel_polymorphic' class Animal < Sequel::Model plugin :polymorphic ony_to_many :fruits, as: :eater end class Fruit < Sequel::Model plugin :polymorphic many_to_one :eater, polymorphic: true end In both cases, the fixtures looks like: animals.yml : george: id: 1 name: George fruits.yml : apple: id: 1 name: Apple eater: george (Animal) In your test, use something like this: apple = load(:fruit__apple) apple.eater.name.must_equal "George" fixture_dependencies will set the eater association in Fruit instance george instance of Animal . Cyclic dependencies fixture_dependencies handles almost all cyclic dependencies. It handles all has_many, has_one, and habtm cyclic dependencies. It handles all self-referential cyclic dependencies. It handles all belongs_to cyclic dependencies except the case where there is a NOT NULL or validates_presence of constraint on the cyclic dependency's foreign key. For example, a case that won't work is when employee belongs_to supervisor (with a NOT NULL or validates_presence_of constraint on supervisor_id), and john is karl's supervisor and karl is john's supervisor. Since you can't create john without a valid supervisor_id, you need to create karl first, but you can't create karl for the same reason (as john doesn't exist yet). There isn't a generic way to handle the belongs_to cyclic dependency, as far as I know. Deferring foreign key checks could work, but may not be enabled (and one of the main reasons to use the plugin is that it doesn't require them). For associations like the example above (employee's supervisor is also an employee), setting the foreign_key to the primary key and then changing it later is an option, but database checks may prevent it. For more complex cyclic dependencies involving multiple model classes (employee belongs_to division belongs_to head_of_division when the employee is a member of the division and also the head of the division), even that approach is not possible. Known issues Currently, the plugin only supports YAML fixtures, but other types of fixtures would be fairly easy to add. The plugin is significantly slower than the default testing method, because it loads all fixtures inside of a transaction (one per test method), where Rails defaults to loading the fixtures once per test suite (outside of a transaction), and only deletes fixtures from a table when overwriting it with new fixtures. Instantiated fixtures are not available with this plugin. Instead, you should use load(:model__fixture_name). Namespace Issues By default, fixture dependencies is going to load the model with the camelized name in the symbol used. So for :foo_bar__baz , it's going to look for the fixture with name baz for the model FooBar . If your model is namespaced, such as Foo::Bar , this isn't going to work well. In that case, you can override the default mapping: FixtureDependencies.class_map[:bar] = Foo::Bar and then use :bar__baz to load the fixture with name baz for the model Foo::Bar . Custom Fixture Filenames Fixture dependencies will look for a file that corresponds to the table name for the model by default. You can override this by defining a fixtures_filename class method in the model: class Artist < Sequel::Model def self.fixture_filename :artists_custom_fixture_file end end Troubleshooting If you run into problems with loading your fixtures, it can be difficult to see where the problems are. To aid in debugging an error, add the following code after requiring the library: FixtureDependencies.verbose = 3 This will give a verbose description of the loading and saving of fixtures for every test, including the recursive loading of the dependency graph. Specs The specs for fixture dependencies are run with Rake. They require the sequel, activerecord, and sqlite3 gems installed. The default rake task runs the specs. You should run the spec_migrate task first to create the spec database. Similar Ideas Rails now supports something similar by default. Honestly, I'm not sure what the differences are. fixture_references is a similar plugin. It uses erb inside yaml, and uses the foreign key numbers inside of the association names, which leads me to believe it doesn't support has_* associations. Sample Rails App with Fixtures Working Check out this app which features Fixtures and Minitest and steps to enable you to replicate it . License fixture_dependencies is released under the MIT License. See the MIT-LICENSE file for details. Author Jeremy Evans code@jeremyevans.net About Sequel/ActiveRecord fixture loader that handles dependency graphs Resources Readme License MIT license Uh oh! There was an error while loading. Please reload this page . Activity Stars 47 stars Watchers 2 watching Forks 28 forks Report repository Uh oh! There was an error while loading. Please reload this page . Contributors 14 Uh oh! There was an error while loading. Please reload this page . Languages Ruby 100.0% Footer © 2026 GitHub, Inc. Footer navigation Terms Privacy Security Status Community Docs Contact Manage cookies Do not share my personal information You can’t perform that action at this time. | 2026-01-13T09:30:25 |
https://rubygems.org/gems/asciidoctor/versions/2.0.26?locale=pt-BR | asciidoctor | RubyGems.org | O host de gems da sua comunidade ⬢ RubyGems nav#focus mousedown->nav#mouseDown click@window->nav#hide"> Navigation menu autocomplete#choose mouseover->autocomplete#highlight"> Buscar Gems… Releases Blog Gems Guias Fazer Login Cadastrar asciidoctor 2.0.26 A fast, open source text processor and publishing toolchain for converting AsciiDoc content to HTML 5, DocBook 5, and other formats. Gemfile: = instalar: = Versões: 2.0.26 October 24, 2025 (278 KB) 2.0.25 October 16, 2025 (278 KB) 2.0.24 October 13, 2025 (278 KB) 2.0.23 May 17, 2024 (277 KB) 2.0.22 March 08, 2024 (276 KB) Mostrar todas as versões (78) Development Dependencies (9): concurrent-ruby ~> 1.1.0 cucumber ~> 3.1.0 erubi ~> 1.10.0 haml ~> 6.3.0 minitest ~> 5.22.0 nokogiri ~> 1.13.0 rake ~> 12.3.0 slim ~> 4.1.0 tilt ~> 2.0.0 Mostrar todas as dependências Donos: Pushed by: Autores: Dan Allen, Sarah White, Ryan Waldron, Jason Porter, Nick Hengeveld, Jeremy McAnally SHA 256 checksum: = ← Previous version Total de downloads 52.497.923 Desta versão 363.442 Versão lançada: October 24, 2025 1:49am Licença: MIT Versão Requerida do Ruby: >= 0 Links: Homepage Changelog Código Fonte Lista de Emails Bug Tracker Download Funding Review changes Badge Inscrever-se RSS Denunciar Abuso Dependências Reversas Status Uptime Código Fonte Dump de Dados Estatísticas Como Contribuir Sobre Ajuda API Policies Support Us Segurança RubyGems.org é o serviço de hospedagem de gems da comunidade Ruby. Publique e instale suas gems instantaneamente. Use a API para interagir e encontrar mais informações sobre gems disponíveis. Torne-se um contribuidor e melhore o site com suas mudanças. O RubyGems.org só é possível através da nossa parceria com a grande comunidade Ruby. Fastly fornece uma largura de banda (bandwidth) e suporte a CDN, Ruby Central cobre a infraestrutura e custos, e financia o desenvolvimento e o trabalho operacional. Saiba mais sobre nossos parceiros e como eles trabalham juntos . Operated by Ruby Central Design DockYard Hospedagem AWS DNS DNSimple Monitoramento Datadog Provisionamento Fastly Monitoramento Honeybadger Secured by Mend.io English Nederlands 简体中文 正體中文 Português do Brasil Français Español Deutsch 日本語 | 2026-01-13T09:30:25 |
https://vp.net/ | vp.net We're sorry but vp.net doesn't work properly without JavaScript enabled. Please enable it to continue. vp.net™ don't trust. verify. Verified Privacy™ for Verified Legends the only VPN that isn't spying on you* get started * See proof that the top VPN services are lying about not spying on you! get started * See proof that the top VPN services are lying about not spying on you! | 2026-01-13T09:30:25 |
https://bundler.io/v4.0/man/bundle-info.1.html | Bundler: bundle info Bundler Docs Team Blog Repository bundle info bundle-info - Show information for the given gem in your bundle bundle info [GEM_NAME] [--path] [--version] Description Given a gem name present in your bundle, print the basic information about it such as homepage, version, path and summary. Options --path Print the path of the given gem --version Print gem version Choose version v4.0 v2.7 v2.6 v2.5 v2.4 v2.3 v2.2 v2.1 v2.0 v1.17 v1.16 v1.15 General Release notes Primary Commands bundle install bundle update bundle cache bundle exec bundle config bundle help Utilities bundle bundle add bundle binstubs bundle check bundle clean bundle console bundle doctor bundle env bundle fund bundle gem bundle info bundle init bundle issue bundle licenses bundle list bundle lock bundle open bundle outdated bundle platform bundle plugin bundle pristine bundle remove bundle show bundle version gemfile Edit this document on GitHub if you caught an error or noticed something was missing. Docs Team Blog About Repository | 2026-01-13T09:30:25 |
https://docs.asciidoctor.org/asciidoctorj/latest/extensions/conversion-process-overview/ | AsciidoctorJ Conversion Process Overview | Asciidoctor Docs Asciidoctor Docs In this project AsciiDoc Language Syntax Quick Reference Processing Asciidoctor Ruby Asciidoctor.js JavaScript AsciidoctorJ Java Extensions Add-on Converters PDF Ruby EPUB3 Ruby reveal.js Ruby, JavaScript Source Compilers Reducer Ruby, JavaScript Extended Syntax Asciidoctor Diagram Ruby Tooling Build Automation Maven Tools Java Gradle Plugin Java Asciidoclet Java Text Editors / Viewers Browser Extension IntelliJ Plugin Chat List --> Source Tweets AsciidoctorJ Distribution Installation Usage Command Line Interface Convert Documents The Asciidoctor Interface Conversion Options Locate Files Safe Modes Examples Converting to EPUB3 Ruby Runtime Register a Ruby Extension Logs Handling API Read the Document Tree Write a Custom Converter Extensions API AsciidoctorJ Conversion Process Overview Understanding the AST Classes Write an Extension Block Macro Processor Inline Macro Processor Block Processor Include Processor Preprocessor Postprocessor Treeprocessor Docinfo Processor Register Extensions Manually Registering Extensions with javaExtensionRegistry Bulk Extension Registration ( Extension Groups ) Automatically Loading Extensions Logging Syntax Highlighter API Implement a Syntax Highlighter Adapter Lifecycle of a SyntaxHighlighterAdapter Format the Source Block Element Link and Copy External Resources Static Syntax Highlighting During Conversion Invocation Order Automatically Load a Syntax Highlighter Help & Guides Updating to New Releases v3.0.x migration guide Extension Migration: 1.6.x to 2.0.x Extension Migration: 1.5.x to 1.6.x Running in Frameworks Using AsciidoctorJ in an OSGi environment Running AsciidoctorJ on WildFly Running AsciidoctorJ with Spring Boot Accessing the JRuby Instance Loading Ruby Libraries Loading External Gems with GEM_PATH Optimization Using a pre-release version Using a Snapshot Version Development Project Layout Local Development Develop in an IDE Continuous Integration AsciidoctorJ 3.0 AsciiDoc Asciidoctor 2.0 Asciidoctor.js 3.0 2.2 AsciidoctorJ 3.0 2.5 Asciidoctor PDF 2.3 2.2 2.1 2.0 Asciidoctor EPUB3 2.3 Asciidoctor reveal.js 5.0 4.1 Maven Tools 3.2 Gradle Plugin Suite 5.0 4.0 Asciidoclet 2.0 1.5.6 Asciidoctor Diagram 3.0.1 Browser Extension Community AsciidoctorJ Extensions API AsciidoctorJ Conversion Process Overview 3.0 3.0 2.5 Edit this Page AsciidoctorJ Conversion Process Overview Before starting to write your first extension, some basic understanding of how Asciidoctor treats the document is helpful. As any language processing tool, the process can be roughly split into three steps: Parsing: the raw sources content is read and analyzed to generate the internal representation, the AST ( abstract syntax tree ). Processing: the AST is processed. For example to detect possible errors, add automatically generated content (toc), etc. Output generation: once the final AST is set, it’s again processed to generate the desired output. For example, a subsection of the AST representing a title with a paragraph will be converted into its correspondent HTML or PDF output. Some liberty is taken to make the process easier to understand. In reality, Asciidoctor has implementation details that divert from the 3 steps above. The different extension types are called in different steps of the conversion process in the following order: Preprocessors are called when the parser requires the AsciiDoc source to parse. IncludeProcessors are called whenever an include:: directive is found while reading the AsciiDoc source. BlockMacroProcessors and BlockProcessors are called while parsing in the order that they appear in the source document. Treeprocessors are called after the document has been completely parsed into the Document tree right before processing. InlineMacroProcessors are called during output generation in the order that they appear in the document. DocinfoProcessors are called at the beginning of output generation if they add content to the header. And they are called at the end of output generation if they add content to the footer. Postprocessors are called after output generation before the content is written to the destination. Extensions API Understanding the AST Classes Asciidoctor Home --> Docs Chat Source List (archive) @asciidoctor Copyright © 2026 Dan Allen, Sarah White, and individual Asciidoctor contributors. Except where noted, the content is licensed under a Creative Commons Attribution 4.0 International (CC BY 4.0) license. The UI for this site is derived from the Antora default UI and is licensed under the MPL-2.0 license. Several icons are imported from Octicons and are licensed under the MIT license. AsciiDoc® and AsciiDoc Language™ are trademarks of the Eclipse Foundation, Inc. Thanks to our backers and contributors for helping to make this project possible. Additional thanks to: Authored in AsciiDoc . Produced by Antora and Asciidoctor . | 2026-01-13T09:30:25 |
https://lists.debian.org/#content | Debian Mailing Lists -- Index mailing lists Skip Quicknav About Debian Getting Debian Support Developers' Corner Mailing Lists / Index Debian Mailing Lists Please see the introduction to Debian mailing lists for more information on what they are and how they can be used. There are list indices for the following types of mailing lists: Debconf Users Developers Internationalization and Translations Ports Bug tracking system Miscellaneous Debian Linux Standard Base Software in the Public Interest Other If you wish to browse a complete list of mailing lists, see the complete index . If you wish to browse a list of additional Debian related mailing lists, see the wiki page . To subscribe to or unsubscribe from multiple mailing lists at once, use the subscription or unsubscription web form, respectively. Note that a lot of these mailing lists can be browsed as Usenet newsgroups . Our list archives can also be searched . Take a look at some usage statistics for the lists. Back to: Debian Lists || Debian Project homepage . Home About Social Contract Code of Conduct Free Software Partners Donations Contact Us Getting Debian Network install CD/USB ISO images CD vendors Pre-installed Debian Packages News Project News Events Documentation Release Info Installation manual Debian Books Support Debian International Security Information Bug reports Mailing Lists Mailing List Archives Ports/Architectures Miscellaneous Help Debian Developers' Corner Site map Search You may submit bugs against the list archives using the lists.debian.org pseudo-package or contact the maintainer at listmaster@lists.debian.org . See the Debian contact page for further information on contacting us. Copyright © 2015 SPI and others; See license terms Debian is a registered trademark of Software in the Public Interest, Inc. | 2026-01-13T09:30:25 |
http://hackage.haskell.org/package/semigroupoids-4.2/docs/src/Data-Groupoid.html | src/Data/Groupoid.hs {-# LANGUAGE CPP #-} #if defined(__GLASGOW_HASKELL__) && __GLASGOW_HASKELL__ >= 702 {-# LANGUAGE Trustworthy #-} #endif module Data . Groupoid ( Groupoid ( .. ) ) where import Data . Semigroupoid import Data . Semigroupoid . Dual -- | semigroupoid with inverses. This technically should be a category with inverses, except we need to use Ob to define the valid objects for the category class Semigroupoid k => Groupoid k where inv :: k a b -> k b a instance Groupoid k => Groupoid ( Dual k ) where inv ( Dual k ) = Dual ( inv k ) | 2026-01-13T09:30:25 |
https://bundler.io/about.html | Bundler: About this site Bundler Docs Team Blog Repository About this Web site Source code https://github.com/rubygems/bundler-site Architecture Middleman 4.4 is the core system of this Web site. A half of source code is located in ./source , but the other half is located in rubygems/rubygems/tree/master/bundler/lib/bundler/man” , which would be retrieved by executing bundle exec rake man . When the source code is merged to the default branch master on GitHub, Deploy job on GitHub Actions would automatically build source (HTML, JS, CSS and font) and push them to GitHub Pages. Deploy status can be followed in github-pages Deployment history . Custom domain is used to host bundler.io (see also Managing a custom domain for your GitHub Pages site ). As seen above, you might sometimes take care about the difference in deploy methods between review apps and production. Unlike production mentioned above, review apps of this Web site rely on Heroku architecture, which run as middleman server. Localization While internationalization system was introduced in 2016 , multilingualization is still ongoing. We welcome multilingualize more guides and other documentations. To get started, move some files existing in /source or create a file to /source/localizable to multiligualize files. Becoming a maintainer of this Web site (namely rubygems/bundler-site ) If you want to be an official maintainer, start by helping out. As a first step, we welcome you to create a few of pull requests to improve the Web site to the repo . Also new feature improvement proposals are welcome. Guides Bundler in gems Frequently Asked Questions Gemfiles Getting Started How to Upgrade to Bundler 2 How to create a Ruby gem with Bundler How to deploy bundled applications How to install gems from git repositories How to manage application dependencies with Bundler How to manage groups of gems How to package and share code using a Gemfile How to troubleshoot RubyGems and Bundler TLS/SSL Issues How to update gems with Bundler How to use Bundler in a single-file Ruby script How to use Bundler with Docker How to use Bundler with Rails How to use Bundler with Ruby How to use Bundler with RubyMotion How to use Bundler with Sinatra How to use git bisect with Bundler How to write a Bundler plugin Known Plugins Recommended Workflow with Version Control Ruby Directive Why Bundler exists Contributing to Bundler Edit this document on GitHub if you caught an error or noticed something was missing. Docs Team Blog About Repository | 2026-01-13T09:30:25 |
https://github.com/ajacoutot/aws-openbsd | GitHub - ajacoutot/aws-openbsd: AWS OpenBSD image builder (AMI) and cloud-init replacement Skip to content Navigation Menu Toggle navigation Sign in Appearance settings Platform AI CODE CREATION GitHub Copilot Write better code with AI GitHub Spark Build and deploy intelligent apps GitHub Models Manage and compare prompts MCP Registry New Integrate external tools DEVELOPER WORKFLOWS Actions Automate any workflow Codespaces Instant dev environments Issues Plan and track work Code Review Manage code changes APPLICATION SECURITY GitHub Advanced Security Find and fix vulnerabilities Code security Secure your code as you build Secret protection Stop leaks before they start EXPLORE Why GitHub Documentation Blog Changelog Marketplace View all features Solutions BY COMPANY SIZE Enterprises Small and medium teams Startups Nonprofits BY USE CASE App Modernization DevSecOps DevOps CI/CD View all use cases BY INDUSTRY Healthcare Financial services Manufacturing Government View all industries View all solutions Resources EXPLORE BY TOPIC AI Software Development DevOps Security View all topics EXPLORE BY TYPE Customer stories Events & webinars Ebooks & reports Business insights GitHub Skills SUPPORT & SERVICES Documentation Customer support Community forum Trust center Partners Open Source COMMUNITY GitHub Sponsors Fund open source developers PROGRAMS Security Lab Maintainer Community Accelerator Archive Program REPOSITORIES Topics Trending Collections Enterprise ENTERPRISE SOLUTIONS Enterprise platform AI-powered developer platform AVAILABLE ADD-ONS GitHub Advanced Security Enterprise-grade security features Copilot for Business Enterprise-grade AI features Premium Support Enterprise-grade 24/7 support Pricing Search or jump to... Search code, repositories, users, issues, pull requests... --> Search Clear Search syntax tips Provide feedback --> We read every piece of feedback, and take your input very seriously. Include my email address so I can be contacted Cancel Submit feedback Saved searches Use saved searches to filter your results more quickly --> Name Query To see all available qualifiers, see our documentation . Cancel Create saved search Sign in Sign up Appearance settings Resetting focus You signed in with another tab or window. Reload to refresh your session. You signed out in another tab or window. Reload to refresh your session. You switched accounts on another tab or window. Reload to refresh your session. Dismiss alert {{ message }} ajacoutot / aws-openbsd Public Notifications You must be signed in to change notification settings Fork 47 Star 183 AWS OpenBSD image builder (AMI) and cloud-init replacement 183 stars 47 forks Branches Tags Activity Star Notifications You must be signed in to change notification settings Code Issues 0 Pull requests 0 Actions Projects 0 Security Uh oh! There was an error while loading. Please reload this page . Insights Additional navigation options Code Issues Pull requests Actions Projects Security Insights ajacoutot/aws-openbsd master Branches Tags Go to file Code Open more actions menu Folders and files Name Name Last commit message Last commit date Latest commit History 317 Commits deprecated deprecated README.md README.md ec2-init.sh ec2-init.sh obsd-img-builder.sh obsd-img-builder.sh View all files Repository files navigation README AWS-OpenBSD AWS playground for OpenBSD kids. Running whatever is in this repo will propably end up destroying a kitten factory. Prerequisites for obsd-img-builder.sh (OpenBSD AMI builder) shell access to OpenBSD current >6.5 with vmm(4) support and Internet access 3.5GB of free space in ${TMPDIR} awscli and vmdktool packages installed AWS IAM user with enough permissions (AmazonEC2FullAccess, AmazonS3FullAccess, IAMFullAccess) AWS environment variables properly set (when not use root's awscli configuration): AWS_CONFIG_FILE AWS_DEFAULT_PROFILE (when not using the default profile) AWS_SHARED_CREDENTIALS_FILE Script usage usage: obsd-img-builder.sh -a "architecture" -- default to "amd64" -d "description" -- AMI description; defaults to "openbsd-$release-$timestamp" -i "path to RAW image" -- use image at path instead of creating one -m "install mirror" -- defaults to installurl(5) or "https://cdn.openbsd.org/pub/OpenBSD" -n -- only create a RAW image (don't convert to an AMI nor push to AWS) -r "release" -- e.g "6.5"; default to "snapshots" -s "image size in GB" -- default to "12" TODO arm64 support MP support Misc KARL (kernel address randomized link) While a newly built image/AMI will contain a randomized kernel, it is advised to add user-data at first boot that will reboot the instance once the first randomization is done. This is so that every instance will indeed run a different relinked kernel. ENI hotplug # cat <<-'EOF' >/etc/hotplug/attach #!/bin/sh case $1 in 3) echo "!/sbin/dhclient -i routers $2" >/etc/hostname.$2 /bin/sh /etc/netstart $i ;; esac EOF # chmod 0555 /etc/hotplug/attach # rcctl enable hotplugd && rcctl start hotplugd Build sample output # export AWS_CONFIG_FILE=/home/myuser/.aws/config # export AWS_DEFAULT_PROFILE=builder # export AWS_SHARED_CREDENTIALS_FILE=/home/myuser/.aws/credentials # ./obsd-img-builder.sh ================================================================================ | creating install.site ================================================================================ ================================================================================ | creating sd1 and storing siteXX.tgz ================================================================================ vmctl: raw imagefile created Writing MBR at offset 0. Label editor (enter '?' for help at any prompt) > offset: [128] size: [2096972] FS type: [4.2BSD] > > No label changes. /dev/rvnd0a: 1023.9MB in 2096960 sectors of 512 bytes 6 cylinder groups of 202.47MB, 12958 blocks, 25984 inodes each super-block backups (for fsck -b #) at: 32, 414688, 829344, 1244000, 1658656, 2073312, ================================================================================ | creating auto_install.conf ================================================================================ ================================================================================ | creating modified bsd.rd for autoinstall ================================================================================ SHA256.sig 100% |******************************************************| 2141 00:00 bsd.rd 100% |******************************************************| 9971 KB 00:01 checking signature: /etc/signify/openbsd-65-base.pub ================================================================================ | starting autoinstall inside vmm(4) ================================================================================ vmctl: raw imagefile created Connected to /dev/ttyp5 (speed 115200) Copyright (c) 1982, 1986, 1989, 1991, 1993 The Regents of the University of California. All rights reserved. Copyright (c) 1995-2019 OpenBSD. All rights reserved. https://www.OpenBSD.org OpenBSD 6.5-beta (RAMDISK_CD) #783: Thu Mar 21 21:42:12 MDT 2019 deraadt@amd64.openbsd.org:/usr/src/sys/arch/amd64/compile/RAMDISK_CD real mem = 520093696 (496MB) avail mem = 500412416 (477MB) mainbus0 at root bios0 at mainbus0 acpi at bios0 not configured cpu0 at mainbus0: (uniprocessor) cpu0: Intel(R) Core(TM) i5-5300U CPU @ 2.30GHz, 2295.72 MHz, 06-3d-04 cpu0: FPU,VME,DE,PSE,TSC,MSR,PAE,MCE,CX8,SEP,PGE,MCA,CMOV,PAT,PSE36,CFLUSH,MMX,FXSR,SSE,SSE2,SSE3,PCLMUL,SSSE3,FMA3,CX16,SSE4.1,SSE4.2,MOVBE,POPCNT,AES,XSAVE,AVX,F16C,RDRAND,HV,NXE,PAGE1GB,LONG,LAHF,ABM,3DNOWP,ITSC,FSGSBASE,BMI1,AVX2,SMEP,BMI2,ERMS,RDSEED,ADX,SMAP,MELTDOWN cpu0: 256KB 64b/line 8-way L2 cache pvbus0 at mainbus0: OpenBSD pci0 at mainbus0 bus 0 pchb0 at pci0 dev 0 function 0 "OpenBSD VMM Host" rev 0x00 virtio0 at pci0 dev 1 function 0 "Qumranet Virtio RNG" rev 0x00 viornd0 at virtio0 virtio0: irq 3 virtio1 at pci0 dev 2 function 0 "Qumranet Virtio Network" rev 0x00 vio0 at virtio1: address fe:e1:bb:d1:44:83 virtio1: irq 5 virtio2 at pci0 dev 3 function 0 "Qumranet Virtio Storage" rev 0x00 vioblk0 at virtio2 scsibus0 at vioblk0: 2 targets sd0 at scsibus0 targ 0 lun 0: <VirtIO, Block Device, > SCSI3 0/direct fixed sd0: 12288MB, 512 bytes/sector, 25165824 sectors virtio2: irq 6 virtio3 at pci0 dev 4 function 0 "Qumranet Virtio Storage" rev 0x00 vioblk1 at virtio3 scsibus1 at vioblk1: 2 targets sd1 at scsibus1 targ 0 lun 0: <VirtIO, Block Device, > SCSI3 0/direct fixed sd1: 1024MB, 512 bytes/sector, 2097152 sectors virtio3: irq 7 virtio4 at pci0 dev 5 function 0 "OpenBSD VMM Control" rev 0x00 vmmci0 at virtio4 virtio4: irq 9 isa0 at mainbus0 com0 at isa0 port 0x3f8/8 irq 4: ns16450, no fifo com0: console softraid0 at root scsibus2 at softraid0: 256 targets root on rd0a swap on rd0b dump on rd0b erase ^?, werase ^W, kill ^U, intr ^C, status ^T Welcome to the OpenBSD/amd64 6.5 installation program. Starting non-interactive mode in 5 seconds... (I)nstall, (U)pgrade, (A)utoinstall or (S)hell? waiting for vm openbsd-current-amd64-20190322T091544Z: Performing non-interactive install... Terminal type? [vt220] vt220 System hostname? (short form, e.g. 'foo') openbsd Available network interfaces are: vio0 vlan0. Which network interface do you wish to configure? (or 'done') [vio0] vio0 IPv4 address for vio0? (or 'dhcp' or 'none') [dhcp] dhcp IPv6 address for vio0? (or 'autoconf' or 'none') [none] none Available network interfaces are: vio0 vlan0. Which network interface do you wish to configure? (or 'done') [done] done DNS domain name? (e.g. 'example.com') [my.domain] my.domain Using DNS nameservers at 100.64.11.2 Password for root account? <provided> Public ssh key for root account? [none] none Start sshd(8) by default? [yes] yes Change the default console to com0? [yes] yes Available speeds are: 9600 19200 38400 57600 115200. Which speed should com0 use? (or 'done') [115200] 115200 Setup a user? (enter a lower-case loginname, or 'no') [no] ec2-user Full name for user ec2-user? [ec2-user] EC2 Default User Password for user ec2-user? <provided> Public ssh key for user ec2-user [none] none WARNING: root is targeted by password guessing attacks, pubkeys are safer. Allow root ssh login? (yes, no, prohibit-password) [no] no What timezone are you in? ('?' for list) [UTC] UTC Available disks are: sd0 sd1. Which disk is the root disk? ('?' for details) [sd0] sd0 No valid MBR or GPT. Use (W)hole disk MBR, whole disk (G)PT or (E)dit? [whole] whole Setting OpenBSD MBR partition to whole sd0...done. URL to autopartitioning template for disklabel? [none] none The auto-allocated layout for sd0 is: # size offset fstype [fsize bsize cpg] a: 255.1M 64 4.2BSD 2048 16384 1 # / b: 290.2M 522496 swap c: 12288.0M 0 unused d: 288.2M 1116832 4.2BSD 2048 16384 1 # /tmp e: 353.2M 1706976 4.2BSD 2048 16384 1 # /var f: 1005.1M 2430432 4.2BSD 2048 16384 1 # /usr g: 447.0M 4488864 4.2BSD 2048 16384 1 # /usr/X11R6 h: 1339.3M 5404416 4.2BSD 2048 16384 1 # /usr/local i: 1342.0M 8147296 4.2BSD 2048 16384 1 # /usr/src j: 5204.1M 10895776 4.2BSD 2048 16384 1 # /usr/obj k: 1759.8M 21553728 4.2BSD 2048 16384 1 # /home Use (A)uto layout, (E)dit auto layout, or create (C)ustom layout? [a] a newfs: reduced number of fragments per cylinder group from 32648 to 32512 to enlarge last cylinder group /dev/rsd0a: 255.1MB in 522432 sectors of 512 bytes 5 cylinder groups of 63.50MB, 4064 blocks, 8192 inodes each /dev/rsd0k: 1759.8MB in 3604032 sectors of 512 bytes 9 cylinder groups of 202.47MB, 12958 blocks, 25984 inodes each newfs: reduced number of fragments per cylinder group from 36880 to 36728 to enlarge last cylinder group /dev/rsd0d: 288.2MB in 590144 sectors of 512 bytes 5 cylinder groups of 71.73MB, 4591 blocks, 9216 inodes each /dev/rsd0f: 1005.1MB in 2058432 sectors of 512 bytes 5 cylinder groups of 202.47MB, 12958 blocks, 25984 inodes each newfs: reduced number of fragments per cylinder group from 57216 to 56992 to enlarge last cylinder group /dev/rsd0g: 447.0MB in 915552 sectors of 512 bytes 5 cylinder groups of 111.31MB, 7124 blocks, 14336 inodes each /dev/rsd0h: 1339.3MB in 2742880 sectors of 512 bytes 7 cylinder groups of 202.47MB, 12958 blocks, 25984 inodes each /dev/rsd0j: 5204.1MB in 10657952 sectors of 512 bytes 26 cylinder groups of 202.47MB, 12958 blocks, 25984 inodes each /dev/rsd0i: 1342.0MB in 2748480 sectors of 512 bytes 7 cylinder groups of 202.47MB, 12958 blocks, 25984 inodes each /dev/rsd0e: 353.2MB in 723456 sectors of 512 bytes 4 cylinder groups of 88.31MB, 5652 blocks, 11392 inodes each Available disks are: sd1. Which disk do you wish to initialize? (or 'done') [done] done /dev/sd0a (9861f4b2a79df4f4.a) on /mnt type ffs (rw, asynchronous, local) /dev/sd0k (9861f4b2a79df4f4.k) on /mnt/home type ffs (rw, asynchronous, local, nodev, nosuid) /dev/sd0d (9861f4b2a79df4f4.d) on /mnt/tmp type ffs (rw, asynchronous, local, nodev, nosuid) /dev/sd0f (9861f4b2a79df4f4.f) on /mnt/usr type ffs (rw, asynchronous, local, nodev) /dev/sd0g (9861f4b2a79df4f4.g) on /mnt/usr/X11R6 type ffs (rw, asynchronous, local, nodev) /dev/sd0h (9861f4b2a79df4f4.h) on /mnt/usr/local type ffs (rw, asynchronous, local, nodev) /dev/sd0j (9861f4b2a79df4f4.j) on /mnt/usr/obj type ffs (rw, asynchronous, local, nodev, nosuid) /dev/sd0i (9861f4b2a79df4f4.i) on /mnt/usr/src type ffs (rw, asynchronous, local, nodev, nosuid) /dev/sd0e (9861f4b2a79df4f4.e) on /mnt/var type ffs (rw, asynchronous, local, nodev, nosuid) Let's install the sets! Location of sets? (disk http or 'done') [disk] http HTTP proxy URL? (e.g. 'http://proxy:8080', or 'none') [none] none HTTP Server? (hostname, list#, 'done' or '?') [cdn.openbsd.org] cdn.openbsd.org Server directory? [pub/OpenBSD/snapshots/amd64] pub/OpenBSD/snapshots/amd64 Select sets by entering a set name, a file name pattern or 'all'. De-select sets by prepending a '-', e.g.: '-game*'. Selected sets are labelled '[X]'. [X] bsd [X] comp65.tgz [X] xbase65.tgz [X] xserv65.tgz [X] bsd.rd [X] man65.tgz [X] xshare65.tgz [X] base65.tgz [X] game65.tgz [X] xfont65.tgz Set name(s)? (or 'abort' or 'done') [done] done Get/Verify SHA256.sig 100% |**************************| 2141 00:00 Signature Verified Get/Verify bsd 100% |**************************| 15492 KB 00:02 Get/Verify bsd.rd 100% |**************************| 9971 KB 00:01 Get/Verify base65.tgz 100% |**************************| 191 MB 00:27 Get/Verify comp65.tgz 100% |**************************| 93001 KB 00:12 Get/Verify man65.tgz 100% |**************************| 7383 KB 00:01 Get/Verify game65.tgz 100% |**************************| 2740 KB 00:00 Get/Verify xbase65.tgz 100% |**************************| 20664 KB 00:03 Get/Verify xshare65.tgz 100% |**************************| 4448 KB 00:01 Get/Verify xfont65.tgz 100% |**************************| 39342 KB 00:05 Get/Verify xserv65.tgz 100% |**************************| 16684 KB 00:02 Installing bsd 100% |**************************| 15492 KB 00:00 Installing bsd.rd 100% |**************************| 9971 KB 00:00 Installing base65.tgz 100% |**************************| 191 MB 00:18 Extracting etc.tgz 100% |**************************| 256 KB 00:00 Installing comp65.tgz 100% |**************************| 93001 KB 00:14 Installing man65.tgz 100% |**************************| 7383 KB 00:01 Installing game65.tgz 100% |**************************| 2740 KB 00:00 Installing xbase65.tgz 100% |**************************| 20664 KB 00:02 Extracting xetc.tgz 100% |**************************| 6935 00:00 Installing xshare65.tgz 100% |**************************| 4448 KB 00:01 Installing xfont65.tgz 100% |**************************| 39342 KB 00:03 Installing xserv65.tgz 100% |**************************| 16684 KB 00:01 Location of sets? (disk http or 'done') [done] disk Is the disk partition already mounted? [yes] no Available disks are: sd0 sd1. Which disk contains the install media? (or 'done') [sd1] sd1 Pathname to the sets? (or 'done') [6.5/amd64] 6.5/amd64 INSTALL.amd64 not found. Use sets found here anyway? [no] yes Select sets by entering a set name, a file name pattern or 'all'. De-select sets by prepending a '-', e.g.: '-game*'. Selected sets are labelled '[X]'. [ ] site65.tgz Set name(s)? (or 'abort' or 'done') [done] site* [X] site65.tgz Set name(s)? (or 'abort' or 'done') [done] done Directory does not contain SHA256.sig. Continue without verification? [no] yes Installing site65.tgz 100% |**************************| 372 00:00 Location of sets? (disk http or 'done') [done] done Saving configuration files... done. Making all device nodes... done. Relinking to create unique kernel... done. CONGRATULATIONS! Your OpenBSD install has been successfully completed! When you login to your new system the first time, please read your mail using the 'mail' command. syncing disks... done vmmci0: powerdown rebooting... terminated vm 11 stopping vm openbsd-current-amd64-20190322T091544Z: forced to terminate vm 11 [SIGTERM] ================================================================================ | creating IAM role ================================================================================ { "Role": { "AssumeRolePolicyDocument": { "Version": "2012-10-17", "Statement": [ { "Action": "sts:AssumeRole", "Effect": "Allow", "Condition": { "StringEquals": { "sts:Externalid": "vmimport" } }, "Principal": { "Service": "vmie.amazonaws.com" } } ] }, "RoleId": "AROAJ724UC5U3JGJ5EZ7C", "CreateDate": "2019-03-22T09:18:45Z", "RoleName": "openbsd-current-amd64-20190322T091544Z", "Path": "/", "Arn": "arn:aws:iam::360116137065:role/openbsd-current-amd64-20190322T091544Z" } } ================================================================================ | converting image to stream-based VMDK ================================================================================ ================================================================================ | uploading image to S3 ================================================================================ { "Location": "http://openbsd-current-amd64-20190322t091544z-29476.s3.amazonaws.com/" } upload: ./openbsd-current-amd64-20190322T091544Z.vmdk to s3://openbsd-current-amd64-20190322t091544z-29476/openbsd-current-amd64-20190322T091544Z.vmdk ================================================================================ | converting VMDK to snapshot ================================================================================ Progress: None% ================================================================================ | removing bucket openbsd-current-amd64-20190322t091544z-29476 ================================================================================ delete: s3://openbsd-current-amd64-20190322t091544z-29476/openbsd-current-amd64-20190322T091544Z.vmdk remove_bucket: openbsd-current-amd64-20190322t091544z-29476 ================================================================================ | registering AMI ================================================================================ { "ImageId": "ami-0d1cf7bb6f969621f" } ================================================================================ | removing IAM role ================================================================================ ================================================================================ | work directory: /tmp/aws-ami.p0MJZxjBcr ================================================================================ Instanciate the AMI and connect to it using SSH: $ ssh ec2-user@${IPADDR} About AWS OpenBSD image builder (AMI) and cloud-init replacement Topics aws openbsd cloud-init Resources Readme Uh oh! There was an error while loading. Please reload this page . Activity Stars 183 stars Watchers 26 watching Forks 47 forks Report repository Releases No releases published Packages 0 No packages published Contributors 11 Uh oh! There was an error while loading. Please reload this page . Languages Shell 100.0% Footer © 2026 GitHub, Inc. Footer navigation Terms Privacy Security Status Community Docs Contact Manage cookies Do not share my personal information You can’t perform that action at this time. | 2026-01-13T09:30:25 |
http://heisenbug.blogspot.com/search?updated-max=2010-07-14T16:12:00-07:00#sidebar | don't count on finding me skip to main | skip to sidebar don't count on finding me Thursday, June 24, 2010 Emacs the Lifesaver I was not thrilled of the task in front of me. Refreshing an old mega-patch, revise virtually every hunk to use a different interface, and committing it piecemeal to the repository again. Sounds like a long error prone job of suffering. Fortunately here is where the power tools come in. I re-merged the backed out revision, postponing conflicts; saved the diff away and reverted the repository; wrote a small awk script to massage the hunks in the diff to get a new patch; fired up emacs with the patch and applied each hunk after thorough review (and seldom with minor changes); some hunks are not ready to go in yet as they do not qualify as refactoring, these are kept for later; commit almost every file as a separate revision. I spend the most time in Emacs (the Mac OS X incarnation, Aquamacs is fantastic). It provides me all the comfort and productivity I need: it provides all necessary hunk operations such as apply, reverse, go to original, drop etc. I can transparently work from a remote machine via ssh, including editing, version control and the above diff operations peace of mind, by being rock solid and autosaving stuff. The only inconvenience is the sheer amount of keyboard equivalents, but I am getting used to them too. Thanks Emacs, without you I would probably drop! Posted by heisenbug at 7:55 AM No comments: Labels: emacs , llvm Tuesday, June 22, 2010 Burning ISO CDs I wasted some hours with trying to burn ISO CDs on the mac. I tried various methods like converting .dmg to .cdr (CD Master) in Disk Utility, but the resulting CD always mounted as HFS+. Finally I googled a nice method: hdiutil makehybrid -iso -o MyImage.iso /Volumes/SomeFolder/ will create an ISO filesystem, which can be burnt with Disk Utility and shows up like that in the Finder. That is - well, I am pretty sure - readable on PCs. Alternatively I may use hdiutil burn MyImage.iso I believe... In retrospect, some of my burn products may have ended up as PC-readable too, since hybrid filesystems may have been created. I'll test them on a PC tomorrow for sure. Posted by heisenbug at 5:24 PM No comments: Labels: filesystem , iso Friday, June 18, 2010 Sized types I have always liked the idea of assigning some notion of size to (tree-like) values, and track its changes along pattern matching and construction to be able to reason about termination-unaffecting recursive calls. Many years ago, when reading the Hughes-Pareto-Sabry paper I did not see the point yet why termination is fundamental in various aspects. Only when sitting on the park bench on the isle of Margitsziget (Budapest) and discussing with Tim about sound logic in Ωmega, it dawned to me how termination checking with sized types can be exploited. I developed the intuition of the tree-like data floating heads down in the water and we are reasoning about criteria that it can still float without touching the ground at depth n . Still, this metaphor was rather hazy. In the meantime I have tried to digest the relevant papers from Barthe and Abel, brainstormed somewhat here and let my brain background. Yesterday, I found (on reddit) a link to Abel's new MiniAgda implementation and its description. It made clear to me that my early intuition was not bad at all, the water depth is the upper limit of the size, and recursion is to reduce this to obtain a well-founded induction. Now it is time to rethink my ideas about infinite function types and how they can be reconciled with sized types. But it looks like Abel has done the hard work and his Haskell implementation of MiniAgda could be married with Ωmega in the following way: Derive a sized variant of every (suitable) Ωmega datatype and try to check which functions on them terminate. These can be used as theorems in Ωmega. Hopefully Tim is paying attention to this when implementing Trellys... Posted by heisenbug at 12:01 PM No comments: Labels: omega , termination , types Tuesday, June 8, 2010 My grief with out-of-tree code This post is a long-standing todo item in my brain, but this checkin actually prompted me to do it. A little bit of history first. As a software developer currently mostly active in the embedded space, I like solutions which allow me to save some CPU cycles or bytes of RAM here and there as long as they still allow me to use the same interfaces. Exploiting the characteristics of the underlying hardware and algorithms is often low-hanging fruit when it comes to optimizations. So I have this little agenda of about 10 items I wish to implement in the future to make the LLVM framework a little more efficient. One of these was to reorder the operands inside of the call instruction, to obtain faster access to the callee but mainly to allow fast visitation of all instructions that have a certain callee. I explained all my motives in a separate mail , so I want to save you from the gory details here. To make a long story short, it took me several iterations to catch all places in the optimizers where the operand order was assumed to be in the (callee, arg1, arg2, ...) fashion, instead of the new (arg1, arg2, ..., callee) one, and some miscompilations were only revealed by running the nightly tests. It was a work of blood and sweat because there are many intrinsics and transformations on them and they are often manipulating via the low-level interface getOperand(n) . Actually there is a nice helper interface, called CallSite , which makes it easy to access the call instruction's arguments in a high-level fashion and this interface probably the best for LLVM clients, since its also handles the invoke instructions. However, I regard it ok to use the low-level interface in the LLVM tree directly, since it is possible to consistently change things in one atomic commit. Finally, the day where all regression and nightly tests succeeded, has dawned. My patch seemingly stuck, with all buildbots green. I left for downtown and returned late at night. Just to discover that all has been backed out, because my change broke havoc in an Apple project that obviously used the low-level interface. This was especially frustrating, since I cannot even submit a correcting patch against that project. I did receive very little encouraging support, not even moral one. Some comments were even pretty dismissive, like this patch has already caused many problems, it is not worth it for such a marginal gain . I have no problem with the comment itself, since I would utter such words in comparable situations too, but this time it was my investment that was at stake. I was pretty determined to keep fighting. I wondered whether new measurements with higher arity calls would find a significant speedup with my patch applied. So I did some benchmarking for cases where the change is expected to make a difference, and actually found (roughly) a 3% speedup. Clearly this number is only achieved in specific situations, so the generic case would be well below that, but still it could compensate for many little time eaters that are necessary for an advanced optimization pass or analysis. In my conversation with the involved engineer I enumerated following reasons why resorting to low-level interface in out-of-tree projects is a bad idea: they are not conveying the intent they are depending on implementation details by reaching over abstraction barriers they are an impediment to change (these are mostly the same reasons which you can find in the above commit message too). He did agree to all this and promised to nudge the OpenGL implementors. I also received a request to submit a patch that guarantees that no silent breakage can happen. Well, I acknowledged that this is a valid concern, so I did some brainstorming. I succeeded to put together a small patch that detected all instances of get/setOperand(0) , the major potential cause of breakage in external projects. Compiling with this patch would pinpoint all places where getCalledValue() should be used. But I cannot promise more than that! Why it is impossible to guarantee that with my proposed change either everything keeps working or there is a compilation error with a clear fixing indication? Because the User baseclass does provide the low-level getOperand interface too and I cannot disallow that. C++ only lets me protect parts of the CallInst class... Would a patch to make getOperand private in CallInst be accepted? Probably not now, but read on. What aggravates the problem with private trees is file ownership. The engineer who detects the breakage is not entitled to fix simple cases, but needs to lobby the project/file owner first. This results in additional inertia. (Disclaimer: I am not sure whether Apple does have a file-ownership model internally.) Surprisingly the same thing that happened to me theoretically could happen to any Apple engineer too. Imagine some checkin to LLVM broke the dragonegg GCC plugin which is effectively licensed as GPLv3, so no Apple engineer is allowed to inspect its sources. What would happen if the dragonegg maintainer backed out the change on grounds of "broke an important external project"? What to do next? Now, whining is not one of the things I like to do, so let's advance in some way. Bill's patch I mentioned in the beginning is a possible first step, as I could rework a large portion of my patch in terms of getArgOperand(n-1) instead of getOperand(n-1) , without actually changing the operand order for now. These kinds of incremental refactorings that do not change functionality are mostly welcome in the LLVM world. Then I am dependent on the goodwill of some Apple engineer to make a similar change in that internal project too. Finally the switch (i.e. the operand order) could be flipped. Why I am reluctant to begin? Because it is lots of work, many new intrinsics have been introduced, I definitely will get a bunch of merge conflicts, and finally, who knows, there might be another internal project that chokes and the whole misery enters a new iteration. Why do I feel that the change is urgent? Because LLVM is getting popular with an extraordinal speed. As more and more external projects use LLVM as a foundation, more and more code will exhibit bad habits of using low-level interfaces. The few post-v2.7 months are probably the last chance to make the switch in argument order, before things become de-facto cemented. Maybe it is too late already. That would be a pity, though, LLVM as a compilation infrastructure should be as fast and nimble as possible. Every one of its clients would profit. So, dear external tree developers, I hope you get rid of the low-level calls and use the high-level ones instead. It should not cost you more than touching a couple of lines and retesting. I would be happy to assist you. Regarding development policy, I would welcome a clear statement about what amount of testing in the LLVM ecosystem is "sufficient" and excludes the risk of a patch being backed out. Bottom line, I'd love to get this patch wrapped up, but I am dependent on the support of external tree owners. Are you willing to help me? Posted by heisenbug at 3:23 AM No comments: Labels: llvm Wednesday, November 25, 2009 Patrícia's New Hobby The artistic blood of my lovely wife is flowing again :-) Her newest hobby is orchestrating photo-shootings. Predominantly of pregnant friends and everybody who simply wants to feel marvelous... Like Lelêca! Posted by heisenbug at 2:45 PM No comments: Labels: family Monday, November 2, 2009 Freude, die man sieht Dieses Photo zeigt Lelêca (alias MausiMausi, alias SchlausiMausi) in mit einem Kopfschmuck, der eigentlich zur pernambucanischen Tracht gehört. Ein Geschenk von Tio Davis – Danke! Lelê freut sich inzwischen auf den morgentlichen Gang in den Kindergarten (natürlich mit Papa!) und scheut sich auch nicht vor kleineren Wortgefechten ("vai comer não!"). Aber was richtig gut ist heißt dann "muito ótimo" und Akzeptanz wird mit einem klaren "tá certo!" signalisiert. Und wie man sieht, geht es den Jungs auch ganz passabel... Posted by heisenbug at 3:47 PM No comments: Labels: family Thursday, October 1, 2009 New Thrist Cabbage Yeah, it took more than a year (and dcoutts help on IRC), but finally I've gathered all my hackage-foo to submit a new thrist package (v1.1.1). Its main purpose is to require base v4.0 or higher. As an added bonus (Thrist p) now provides a Category instance. I have also added an Arrow (Thrist (->)) instance, but its first method is bogus as of now. I plan to correct this with v1.1.2. My plans for 0.2 are: adaptors Data.Thrist.Monad , Data.Thrist.List (aka. R*), Data.Thrist.Arrow , all with their respective sensible class instances, tests. Then sometime I can start setting up some cool stuff to demonstrate hoare-triples in thrist setting. We'll see. Posted by heisenbug at 2:37 PM No comments: Labels: thrist Tuesday, August 4, 2009 Static Constraints In the last months Tim has been adding a new function sameLabel to Ωmega and this finally allowed me to encode the concept of free variables. In just a couple of days I managed to implement environment construction with statically checked proof that no identifier is shadowed. Here is a little example. Building on this advance I fulfilled a long lasting desire and managed to prototype LLVM basic blocks in Ωmega with thrists. The approach is implemented in 2 steps: build up a labelled sequence of preinstructions, and then construct sufficient evidence about well-formedness, that the strict type constraints in the thrist can be proven. Curiously, the defs propagate to the right and the uses to the right in this thrist. The good thing is, that after all this struggle I am pretty confident that many more properties and constraints can be encoded, such as the LLVM type system (on defs, uses and constants), that Phi nodes must not go into entry blocks, that Phi nodes must preceed other instructions in the basic block, every use must happen in the scope of a corresponding def, etc. The next days will surely see more progress, I have crawled out of the swamp and have firm ground under my feet... Posted by heisenbug at 3:52 PM No comments: Labels: llvm , omega , thrist Sunday, June 14, 2009 Daddy's Girl Das Bild zeigt die Ruhe vor dem Sturm. Wenige Minuten später ist Leleka in ihren Festanzug geschlüpft und die Party ging los, mit Geschenken und viel Leckerem. Spruch der letzten Woche: "Aniversário de Lelêca no domingo!" Posted by heisenbug at 2:56 PM No comments: Labels: family Wednesday, May 27, 2009 Ketchup Problem In Chapter 6 (page 16) Jeremy Gibbons describes a datatype that models all secure operations that can be applied to a (partially filled) ketchup bottle . I believe that this is the example that Jeremy has shown me at ICFP'07 in Freiburg (when I have introduced him to my thrist concept), and I have been unable to find it ever since. Now, I guess I can add it to the bibliography section of my paper. That is, if I ever get around updating the draft again... PS: a bibtex-able conference paper is here . Posted by heisenbug at 6:43 AM No comments: Labels: thrist Tuesday, March 31, 2009 Sieben Tage Regen, Sieben Tage Schnee … … und es tut nicht mehr weh! Dieser Winter war der schmerzhafteste den ich bisher in Deutschland erlebt habe. Lang und kalt. Die Natur ist acht Wochen (oder mehr?) hinterher, unser Hunger nach Sonne unvorstellbar. Wie gut, daß mein Wetter-Widget jetzt sieben Tage Sonne und angenehme Temperaturen verspricht! Das Haus ist nunmehr tiptop eingerichtet, die Gartensaison kann kommen. Auf wiedersehen, Winter, willkommen Frühling! Posted by heisenbug at 10:15 PM No comments: Labels: family , garden , weather Saturday, March 21, 2009 Lack of Total Order My new project is starting to bind my mental resources at work. So some of the fringe projects which I casually do for fun will surely suffer. LLVM: Two of my recent patches had to be backed out of the tree, because they caused trouble with bootstrapping llvm-gcc. I am pretty sure these are not caused by bugs on my side (geee!), but frustrating nevertheless. The situation is also aggravated by the fact that I am unable to build a stock llvm-gcc on my Tiger machines I have access to, so I have lost my ability to debug these beasts. A third patch is in-progress (CallInst operand reorg - function to the back) but it is dependent on one of the backed-out ones. It is also pretty stubborn, since there are many hidden assumptions in the codebase which expect the callee in front position. I am slowly weeding out the problems. Omega: Little progress on this front. Tim also seems to have reduced his workload on here - probably caused by the "Cyber Milennium" course - so I do not feel a lot of motivation. Which is sad, because there are some nice papers on GADT decidable type inference appearing. Omega could benefit from those. Clang: Doug has been working on the template instantiation machinery lately, and I took over a mini-project: instantiation of "?:" expressions. It mostly works, but there is still review feedback to satisfy and the missing middle-expression problem needs a solution. These must be unit-tested as well. Back to my regular work. The job is demanding, I co-develop the implementation, test framework and test-suite simultaneously. Of course I could accept some help, but it is also important that the basics get in right and unwatered. I have a nice plan for stub-libraries that can invoke TCL commands to fill in out parameters and result values. Fun. Regarding the headline, it was inspired by thinking about a purely-functional (i.e. immutable) lattice library for use by Clang's (partial) template specialization feature. Yes, and lattices arise as containers of partially-ordered data. Posted by heisenbug at 3:04 PM No comments: Labels: clang , haskell , llvm , work Wednesday, March 11, 2009 RWH I am happy because my copy of Real World Haskell arrived today. I ordered it through my employer, and while waiting for it more than two months, it finally got delivered. Anyway, I plan to put QuickCheck to good use by generating testcases automatically. Let's see how far this can carry us. Posted by heisenbug at 5:05 AM No comments: Labels: haskell , work Tuesday, March 3, 2009 3^2 Day Today is 3^2 day, because 3 squared is 9 and today's date is 03.03.09. Number jokes aside, it was a good day, I am finally beginning the implementation part of my new project at work and the ideas keep sprouting. Good. PS.: Also I found a nice article about decidable type inference for GADTs. Final version hopefully for ICFP09! Posted by heisenbug at 2:55 PM No comments: Labels: GADT , good Friday, January 30, 2009 Verhörhämmer Um ein Paar dieser "rohen Diamanten" zu downloaden, habe ich dieses kleine tcsh script geschrieben: foreach j ( 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 ) foreach i ( `curl "http://blog.br-online.de/fruehaufdreher/index.php?/categories/2-Verhoerhammer/P"$j".html" | grep .mp3 | grep value= | grep song_title= | awk -F= '{print $4}' | awk -F"&" '{print $1}' | awk -F/ '{print $6}' ` ) echo $j : $i curl http://blog.br-online.de/fruehaufdreher/uploads/$i > $i end end Macht Spaß... Danke BR! :-) Posted by heisenbug at 4:27 PM No comments: Wednesday, January 28, 2009 Dan's Birthday Yesterday was Daniel's birthday. We made a surprise visit and he loved it! I came a bit late (work, work, new project, yadda), which was no problem because people had lots of fun. They fired up the karaoke machine, and after some beers even I took the mike. But Helena on stage was the cutest thing ever! She grabbed the microphone as if she was a seasoned singer. However she did not sing a single tune, just posed :-) Posted by heisenbug at 3:27 PM No comments: Labels: family Thursday, October 9, 2008 Hauskauf Heute war doch ein recht spezieller Tag. Notartermin zwecks Vertragsunterzeichnung. Ich kann nur sagen daß mein Herz doch ziemlich in die Hose geruscht ist... ...noch nie habe ich so eine Menge Geld auf eine Karte gesetzt. Als nächstes nun wird bezahlt und dann beginnt der lange, schweißtreibende Weg zur Tilgung. Darüber später mehr. Posted by heisenbug at 9:30 AM No comments: Labels: family , house Wednesday, September 10, 2008 Hoare Triples and Thrists While mousing through the L4.verified presentation that took place at Galois , I could not help but build an association bridge between Hoare triples and thrists. Especially when you go to p. 52 and thereabout. Here is my take on the connection: We have some command s that belong to a data type C , and C has two type parameters: data C :: * -> * -> * where C1 :: ... -> C a b The first type parameter can be interpreted as the precondition of the command while the second as its postcondition ({P} and {Q} in Hoare's notation). This convention employs the types-as-properties interpretation. If commands are sequenced, the postconditions of the former commands must imply the preconditions of the latter. This is referred to as the composition rule and corresponds to appending two thrists. Now, in Ωmega the situation is even prettier, because C need not be a two-type-parameter entity, but can be parameterized over arbitrary kind s. The built-in evaluation mechanism (type functions) allow the most powerful constructs. (Haskell will get something similar at the type level, called type families , with GHC v6.10.) Posted by heisenbug at 12:54 PM No comments: Labels: haskell , hoare-triple , omega , thrist Wednesday, September 3, 2008 Saudades É muito bom ficar sozinho alguns dias, pensando e trabalhando em paz. Mas quando as semanas passam a distância parece que aumenta e a ausência começa de doer. Meus amores sinto muito falta de voces, quero que voltam logo. Posted by heisenbug at 12:22 PM No comments: Labels: family Monday, September 1, 2008 Meme evolution While I am missing family induced distraction, I use the opportunity of reading old papers that I always wanted to revisit. Yesterday, while reading "A History of Haskell" I was amused by the sentence: "Wadler misunderstood what Fasel had in mind, and type classes were born!" This is a concrete case of "meme evolution" (in Dawkins ' sense): a mutation of a meme (by transcription error) finds a new habitat where it thrives and blossoms. Some preconditions are needed for this to happen: communication loosening of amorphous ideas an open mind, not shying away from listening to the unknown Many great ideas come to me while reading conference papers of others and where I have no idea what they are talking about :-) While trying to make vague sense of what I have in front of me a fireworks of ideas commence, all building in some way on foundations of things (pet projects) I have done in the past. Now, how can I ensure that I periodically can enjoy the state of minimal disturbances? Posted by heisenbug at 9:38 AM No comments: Labels: evolution , haskell , philosophy Newer Posts Older Posts Home Subscribe to: Comments (Atom) Blog Archive ▼  2022 (1) ▼  February (1) Pattern musings ►  2014 (5) ►  November (1) ►  October (1) ►  August (1) ►  July (1) ►  January (1) ►  2013 (5) ►  September (1) ►  August (3) ►  February (1) ►  2012 (2) ►  December (1) ►  September (1) ►  2011 (7) ►  December (1) ►  November (1) ►  October (1) ►  September (1) ►  August (1) ►  February (1) ►  January (1) ►  2010 (19) ►  December (5) ►  November (6) ►  October (1) ►  August (1) ►  July (2) ►  June (4) ►  2009 (12) ►  November (2) ►  October (1) ►  August (1) ►  June (1) ►  May (1) ►  March (4) ►  January (2) ►  2008 (22) ►  October (1) ►  September (3) ►  August (6) ►  July (3) ►  June (2) ►  May (1) ►  April (3) ►  March (1) ►  February (1) ►  January (1) ►  2007 (20) ►  December (2) ►  November (1) ►  October (1) ►  September (1) ►  August (1) ►  July (14) About Me heisenbug I am here and there. You may encounter me if you try, but no guarantees. Just a hint: I am mostly with my family. View my complete profile   | 2026-01-13T09:30:25 |
http://heisenbug.blogspot.com/2011/10/macs-and-me.html?showComment=1317906285227#sidebar | don't count on finding me: Macs and me skip to main | skip to sidebar don't count on finding me Wednesday, October 5, 2011 Macs and me I am profoundly saddened since I woke up at 4:00am in the morning, and saw the news headline about the passing of Steve Jobs. I have seen this coming for a long time, as my father died in a very similar way back 1993 with only 52. Looking at the thin appearance of Jobs in the last month or even years I constantly get reminded of him. Basically the same story of suffering, loss of weight, liver transplant (in vain), death. RIP, Dad, RIP, Steve. I am writing this on a rusty vintage 2000 PowerBook G4 Titanium, I bought on eBay last year, because the video of my own 2001 TiBook went black. By today's web standards completely inadequate, it serves me well for news reading, terminal logins, etc. My son Pedro got his MacBook Pro 15'' delivered just today. An awesome piece of technology. My father bought the first Mac in 1986, just after opening his practice as a neurologist. This was two years after cutting all strings in Hungary and fleeing to Germany in a pretty bold move. Must have been a moment of total self-overestimation when I promised to my dad "if you buy that Mac Plus I'll write you the best software for it for your doctor's office". A crazy time began. At day the Mac was used to keep patient's data with a DTP program "RagTime", at 5pm I hauled the Mac home (in a big black bag) and started writing the program. Sometimes deep into the night. I used Turbo Pascal (and later MPW) after figuring out that the Lisp environment I preferred simply did not cut it due to insufficient support of the Toolbox. In the morning my father carried the Mac back and powered it up. Less than year later the program was ready for productive work. A Mac SE joined the party and we had a networked doctor's application with a really neat windowed user interface, that would put even today's programs to shame in this regard. There was even a time when we fancied marketing this product, but my university duties and the early death of my father simply negated all plans to this end. When I had my diploma in my hands I picked up the phone and called the guy who sold us the Mac Plus and a copy of "Inside Macintosh" back in '86. In the meantime he founded a pretty successful company around a networked admin solution called 'netOctopus' which was his baby. We occasionally met at Apple developer events and I new that he was a pretty damn good coder. He hired me and I was earning money by programming Macs! So yes, I love Macs and there is no reason that this will change in the foreseeable future. I kept telling to myself, should Jobs die one day, I'll put that Mac Plus (now in my basement and still functional) up for sale at eBay. My thought today: "screw it – too many fond memories attached". Posted by heisenbug at 9:39 PM Labels: family , mac , sadness 3 comments: MARCO ANTONIO MENELAU said... muito bonito gabor. Parabens. homenagemjusta a um grande homemn October 6, 2011 at 2:24 AM Cristina Menelau said... Gostei muito, me emocionei com sua história. Todos lamentamos a morte prematura de Jobs mas, a vida tem dessas surpresas. Um gênio sai de cena, aguardemos que outro apareça para preenchê-la proém, sem jamais esquecer os que se foram. October 6, 2011 at 6:04 AM RecaPortella said... Que história emocionante Gabor! Parabéns por conseguir em palavras descrever momentos e histórias como essa. Triste, porém cheia de ensinamentos em todos os sentidos. Agora é esperar o tempo levar um pouco dessa tristeza e continuar seguindo a vida lembrando sempre dos bons ensinamentos que grandes pessoas com essas nos deixaram! Bjs October 6, 2011 at 10:10 AM Post a Comment Newer Post Older Post Home Subscribe to: Post Comments (Atom) Blog Archive ►  2022 (1) ►  February (1) ►  2014 (5) ►  November (1) ►  October (1) ►  August (1) ►  July (1) ►  January (1) ►  2013 (5) ►  September (1) ►  August (3) ►  February (1) ►  2012 (2) ►  December (1) ►  September (1) ▼  2011 (7) ►  December (1) ►  November (1) ▼  October (1) Macs and me ►  September (1) ►  August (1) ►  February (1) ►  January (1) ►  2010 (19) ►  December (5) ►  November (6) ►  October (1) ►  August (1) ►  July (2) ►  June (4) ►  2009 (12) ►  November (2) ►  October (1) ►  August (1) ►  June (1) ►  May (1) ►  March (4) ►  January (2) ►  2008 (22) ►  October (1) ►  September (3) ►  August (6) ►  July (3) ►  June (2) ►  May (1) ►  April (3) ►  March (1) ►  February (1) ►  January (1) ►  2007 (20) ►  December (2) ►  November (1) ►  October (1) ►  September (1) ►  August (1) ►  July (14) About Me heisenbug I am here and there. You may encounter me if you try, but no guarantees. Just a hint: I am mostly with my family. View my complete profile   | 2026-01-13T09:30:25 |
http://web.cecs.pdx.edu/%7Esheard/Omega/index.html | Omega Download Page Omega Download Page What's New April 29, 2011 Version 1.5 Release 1.5 marks the first milestone without major involvement of Tim. See the release notes for more details. To download the system visit here . May 7, 2010. Version 1.4.6 Significantly improved pretty printing of types in error messages. Adds a new command, :norm to the type "check" loop which normalizes the type of the expression entered. Several minor bugs have also been fixed. April 14, 2010. Version 1.4.5 A very minor update to version 1.4.4. Includes a fix to the "lift" function, and updates to the manual that were mistakenly not included in version 1.4.4. March 28, 2010. Version 1.4.4 Bug fixes. Lots of work on better error messages. An improved module system that doesn't reload modules already loaded. A newstyle of syntactic extension that allows more than one style per datatype. July 22, 2008. Version 1.4.3 Many bug fixes. A more robust implementation of level polymorphism. A new set of example programs. This version of Omega was prepared for, and used by Summer School on Logic and Theorem Proving in Programming Languages in Eugene in July 2008. June 9, 2007. Version 1.4.2. Updated manual with new sections on level-polymorphism, use of Syntactic Extension, and Labels. New operations on Labels including dynamic generation and equality checks. Drastic changes to the implementation of syntactic extensions. If you use this feature, read the manual. Syntactic Extensions can now be imported (see the manual for details). The #(n+1) syntax has changed. A large restructuring of the parser, making it easier to maintain. Many, many bug fixs (Thank you, Gabor Greif for the bug reports)! A slighlty revised version, posted June 12, 2007. April 12, 2007. Version 1.4.1. Bug fixes, and truly level-polymorphic datatypes. Feb. 27, 2007. Version 1.4. A completely rewritten constraint solving mechanism. The "theorem" declaration, rewriting, backchaining, and refinement lemmas. Syntactic extension. Improved module system. Tracing directives, and bounds setting directives. Many bug fixes and improved error messages. Nov. 13, 2006. Version 1.3. Many bug fixes. New way to handle type-functions using narrowing. New implementation of discharging static constraints. Much improved error messages. Nov. 7, 2005. Version 1.2. Many bug fixes, the command line editor (many thanks to Nils Anders Danielsson), unreachable clauses. This and succeeding versions requires GHC 6.4.1 or better to compile. June 23, 2005. Version 1.1 (revision 1). No new features, just bug fixes over version 1.1. May 23, 2005. Version 1.1 released. Includes better error messages, Anonymous existential types. Datatypes as propositions and static constraints. March 3, 2005. First public release of Omega. Version 1.00. Download Download the appropriate archive, then follow the installation notes below: Version 1.5 Version 1.4.6 Omega Version 1.4.6 (zip file) Compiles with Haskell Platform 2009.2.0.2 Version 1.4.5 Omega Version 1.4.5 (zip file) Compiles with Haskell Platform 2009.2.0.2 Version 1.4.4 Omega Version 1.4.4 (zip file) Compiles with Haskell Platform 2009.2.0.2 Version 1.4.3 Omega Version 1.4.3 (zip file) Compiles with GHC 6.8.3 Version 1.4.2 Omega Version 1.4.2 (zip file) . Requires GHC 6.4.1 or higher to compile. Version 1.4.1 Omega Version 1.4.1 (zip file) . Requires GHC 6.4.1 or higher to compile. Version 1.4 Omega Version 1.4 (zip file) . Requires GHC 6.4.1 or higher to compile. Version 1.3 Omega Version 1.3 (zip file) . Requires GHC 6.4.1 or higher to compile. Version 1.2 Omega Version 1.2 (zip file) . Requires GHC 6.4.1 to compile. Version 1.11 Omega Version 1.1 revision 1 (zip file) Version 1.1 Omega Version 1.1 (zip file) Version 1.0 Omega Version 1.0 (zip file) Installation Notes: Install the appropriate version of GHC compiler. Download the distribution file. Unzip the distribution. You will get a Omega directory. Other directories include the Omega manual for that version, examples, etc. Go to this directory. You should have the source files to Omega. You will find the license in the file LICENSE.txt . Read it to be sure you agree to the conditions of distribution. type "make all" to start the GHC compilation process. The omega interpreter will be placed in the file omega.exe For more information about Omega visit Tim Sheard's web page This material is based upon work supported by the National Science Foundation under Grant No. 0098126 and 0613969. Any opinions, findings, and conclusions or recommendations expressed in this material are those of the author(s) and do not necessarily reflect the views of the National Science Foundation. | 2026-01-13T09:30:25 |
https://rubygems.org/gems/sequel | sequel | RubyGems.org | your community gem host ⬢ RubyGems nav#focus mousedown->nav#mouseDown click@window->nav#hide"> Navigation menu autocomplete#choose mouseover->autocomplete#highlight"> Search Gems… Releases Blog Gems Guides Sign in Sign up sequel 5.100.0 The Database Toolkit for Ruby Gemfile: = install: = Versions: 5.100.0 January 01, 2026 (639 KB) 5.99.0 December 01, 2025 (639 KB) 5.98.0 November 01, 2025 (638 KB) 5.97.0 October 01, 2025 (635 KB) 5.96.0 September 01, 2025 (634 KB) Show all versions (301 total) Runtime Dependencies (1): bigdecimal >= 0 Development Dependencies (6): activemodel >= 0 minitest >= 5.7.0 minitest-global_expectations >= 0 minitest-hooks >= 0 nokogiri >= 0 tzinfo >= 0 Show all transitive dependencies Owners: Pushed by: Authors: Jeremy Evans SHA 256 checksum: = ← Previous version Total downloads 65,541,218 For this version 223,953 Version Released: January 1, 2026 5:07pm License: MIT Required Ruby Version: >= 1.9.2 Links: Homepage Changelog Source Code Documentation Mailing List Bug Tracker Download Review changes Badge Subscribe RSS Report abuse Reverse dependencies Status Uptime Code Data Stats Contribute About Help API Policies Support Us Security RubyGems.org is the Ruby community’s gem hosting service. Instantly publish your gems and then install them . Use the API to find out more about available gems . Become a contributor and improve the site yourself. The RubyGems.org website and service are maintained and operated by Ruby Central’s Open Source Program and the RubyGems team. It is funded by the greater Ruby community through support from sponsors, members, and infrastructure donations. If you build with Ruby and believe in our mission, you can join us in keeping RubyGems.org, RubyGems, and Bundler secure and sustainable for years to come by contributing here . Operated by Ruby Central Designed by DockYard Hosted by AWS Resolved with DNSimple Monitored by Datadog Gems served by Fastly Monitored by Honeybadger Secured by Mend.io English Nederlands 简体中文 正體中文 Português do Brasil Français Español Deutsch 日本語 | 2026-01-13T09:30:25 |
https://rubygems.org/gems/unicorn-lockdown | unicorn-lockdown | RubyGems.org | your community gem host ⬢ RubyGems nav#focus mousedown->nav#mouseDown click@window->nav#hide"> Navigation menu autocomplete#choose mouseover->autocomplete#highlight"> Search Gems… Releases Blog Gems Guides Sign in Sign up unicorn-lockdown 1.3.0 Helper library for running Unicorn with fork+exec/unveil/pledge on OpenBSD Gemfile: = install: = Versions: 1.3.0 May 22, 2024 (17.5 KB) 1.2.0 November 16, 2022 (17.5 KB) 1.1.0 July 18, 2022 (17 KB) 1.0.0 November 09, 2020 (16.5 KB) 0.13.0 July 09, 2019 (17.5 KB) Show all versions (9 total) Runtime Dependencies (2): pledge >= 0 unicorn >= 0 Development Dependencies (4): mail >= 0 minitest-global_expectations >= 0 rack >= 0 roda >= 0 Show all transitive dependencies Owners: Pushed by: Authors: Jeremy Evans SHA 256 checksum: = ← Previous version Total downloads 15,004 For this version 833 Version Released: May 22, 2024 9:24pm License: MIT Required Ruby Version: >= 2.0.0 Links: Homepage Changelog Mailing List Bug Tracker Download Review changes Badge Subscribe RSS Report abuse Reverse dependencies Status Uptime Code Data Stats Contribute About Help API Policies Support Us Security RubyGems.org is the Ruby community’s gem hosting service. Instantly publish your gems and then install them . Use the API to find out more about available gems . Become a contributor and improve the site yourself. The RubyGems.org website and service are maintained and operated by Ruby Central’s Open Source Program and the RubyGems team. It is funded by the greater Ruby community through support from sponsors, members, and infrastructure donations. If you build with Ruby and believe in our mission, you can join us in keeping RubyGems.org, RubyGems, and Bundler secure and sustainable for years to come by contributing here . Operated by Ruby Central Designed by DockYard Hosted by AWS Resolved with DNSimple Monitored by Datadog Gems served by Fastly Monitored by Honeybadger Secured by Mend.io English Nederlands 简体中文 正體中文 Português do Brasil Français Español Deutsch 日本語 | 2026-01-13T09:30:25 |
http://heisenbug.blogspot.com/search/label/termination | don't count on finding me: termination skip to main | skip to sidebar don't count on finding me Showing posts with label termination . Show all posts Showing posts with label termination . Show all posts Friday, June 18, 2010 Sized types I have always liked the idea of assigning some notion of size to (tree-like) values, and track its changes along pattern matching and construction to be able to reason about termination-unaffecting recursive calls. Many years ago, when reading the Hughes-Pareto-Sabry paper I did not see the point yet why termination is fundamental in various aspects. Only when sitting on the park bench on the isle of Margitsziget (Budapest) and discussing with Tim about sound logic in Ωmega, it dawned to me how termination checking with sized types can be exploited. I developed the intuition of the tree-like data floating heads down in the water and we are reasoning about criteria that it can still float without touching the ground at depth n . Still, this metaphor was rather hazy. In the meantime I have tried to digest the relevant papers from Barthe and Abel, brainstormed somewhat here and let my brain background. Yesterday, I found (on reddit) a link to Abel's new MiniAgda implementation and its description. It made clear to me that my early intuition was not bad at all, the water depth is the upper limit of the size, and recursion is to reduce this to obtain a well-founded induction. Now it is time to rethink my ideas about infinite function types and how they can be reconciled with sized types. But it looks like Abel has done the hard work and his Haskell implementation of MiniAgda could be married with Ωmega in the following way: Derive a sized variant of every (suitable) Ωmega datatype and try to check which functions on them terminate. These can be used as theorems in Ωmega. Hopefully Tim is paying attention to this when implementing Trellys... Posted by heisenbug at 12:01 PM No comments: Labels: omega , termination , types Older Posts Home Subscribe to: Comments (Atom) Blog Archive ▼  2022 (1) ▼  February (1) Pattern musings ►  2014 (5) ►  November (1) ►  October (1) ►  August (1) ►  July (1) ►  January (1) ►  2013 (5) ►  September (1) ►  August (3) ►  February (1) ►  2012 (2) ►  December (1) ►  September (1) ►  2011 (7) ►  December (1) ►  November (1) ►  October (1) ►  September (1) ►  August (1) ►  February (1) ►  January (1) ►  2010 (19) ►  December (5) ►  November (6) ►  October (1) ►  August (1) ►  July (2) ►  June (4) ►  2009 (12) ►  November (2) ►  October (1) ►  August (1) ►  June (1) ►  May (1) ►  March (4) ►  January (2) ►  2008 (22) ►  October (1) ►  September (3) ►  August (6) ►  July (3) ►  June (2) ►  May (1) ►  April (3) ►  March (1) ►  February (1) ►  January (1) ►  2007 (20) ►  December (2) ►  November (1) ►  October (1) ►  September (1) ►  August (1) ►  July (14) About Me heisenbug I am here and there. You may encounter me if you try, but no guarantees. Just a hint: I am mostly with my family. View my complete profile   | 2026-01-13T09:30:25 |
http://code.google.com/p/omega/issues/detail?id=12 | Google Code Archive - Long-term storage for Google Code Project Hosting. Code Archive Skip to content The Google Code Archive requires JavaScript to be enabled in your browser. Google About Google Privacy Terms | 2026-01-13T09:30:25 |
http://hackage.haskell.org/package/semigroupoids-4.2/docs/src/Data-Functor-Extend.html | src/Data/Functor/Extend.hs {-# LANGUAGE CPP #-} #if defined(__GLASGOW_HASKELL__) && __GLASGOW_HASKELL__ >= 702 {-# LANGUAGE Safe #-} #endif ----------------------------------------------------------------------------- -- | -- Module : Data.Functor.Extend -- Copyright : (C) 2011 Edward Kmett -- License : BSD-style (see the file LICENSE) -- -- Maintainer : Edward Kmett <ekmett@gmail.com> -- Stability : provisional -- Portability : portable -- ---------------------------------------------------------------------------- module Data . Functor . Extend ( -- * Extendable Functors -- $definition Extend ( .. ) ) where import Prelude hiding ( id , ( . ) ) import Control . Category import Control . Monad . Trans . Identity import Data . Functor . Identity import Data . Semigroup import Data . List ( tails ) import Data . List . NonEmpty ( NonEmpty ( .. ) , toList ) #ifdef MIN_VERSION_containers import Data . Sequence ( Seq ) import qualified Data . Sequence as Seq import Data . Tree #endif #ifdef MIN_VERSION_comonad import Data . Functor . Coproduct import Control . Comonad . Trans . Env import Control . Comonad . Trans . Store import Control . Comonad . Trans . Traced #endif class Functor w => Extend w where -- | -- > duplicated = extended id -- > fmap (fmap f) . duplicated = duplicated . fmap f duplicated :: w a -> w ( w a ) -- | -- > extended f = fmap f . duplicated extended :: ( w a -> b ) -> w a -> w b extended f = fmap f . duplicated duplicated = extended id -- * Extends for Prelude types: -- -- Instances: While Data.Functor.Extend.Instances would be symmetric -- to the definition of Control.Monad.Instances in base, the reason -- the latter exists is because of Haskell 98 specifying the types -- @'Either' a@, @((,)m)@ and @((->)e)@ and the class Monad without -- having the foresight to require or allow instances between them. -- -- Here Haskell 98 says nothing about Extend, so we can include the -- instances directly avoiding the wart of orphan instances. instance Extend [] where duplicated = init . tails instance Extend Maybe where duplicated Nothing = Nothing duplicated j = Just j instance Extend ( Either a ) where duplicated ( Left a ) = Left a duplicated r = Right r instance Extend ( (,) e ) where duplicated p = ( fst p , p ) instance Semigroup m => Extend ( ( -> ) m ) where duplicated f m = f . ( <> ) m #ifdef MIN_VERSION_containers instance Extend Seq where duplicated l = Seq . take ( Seq . length l ) ( Seq . tails l ) instance Extend Tree where duplicated w @ ( Node _ as ) = Node w ( map duplicated as ) #endif #ifdef MIN_VERSION_comonad instance ( Extend f , Extend g ) => Extend ( Coproduct f g ) where extended f = Coproduct . coproduct ( Left . extended ( f . Coproduct . Left ) ) ( Right . extended ( f . Coproduct . Right ) ) instance Extend w => Extend ( EnvT e w ) where duplicated ( EnvT e wa ) = EnvT e ( extended ( EnvT e ) wa ) instance Extend w => Extend ( StoreT s w ) where duplicated ( StoreT wf s ) = StoreT ( extended StoreT wf ) s extended f ( StoreT wf s ) = StoreT ( extended ( \ wf' s' -> f ( StoreT wf' s' ) ) wf ) s instance ( Extend w , Semigroup m ) => Extend ( TracedT m w ) where extended f = TracedT . extended ( \ wf m -> f ( TracedT ( fmap ( . ( <> ) m ) wf ) ) ) . runTracedT #endif -- I can't fix the world -- instance (Monoid m, Extend n) => Extend (ReaderT m n) -- duplicate f m = f . mappend m -- * Extends for types from 'transformers'. -- -- This isn't really a transformer, so i have no compunction about including the instance here. -- -- TODO: Petition to move Data.Functor.Identity into base instance Extend Identity where duplicated = Identity -- Provided to avoid an orphan instance. Not proposed to standardize. -- If Extend moved to base, consider moving instance into transformers? instance Extend w => Extend ( IdentityT w ) where extended f ( IdentityT m ) = IdentityT ( extended ( f . IdentityT ) m ) instance Extend NonEmpty where extended f w @ ~ ( _ :| aas ) = f w :| case aas of [] -> [] ( a : as ) -> toList ( extended f ( a :| as ) ) -- $definition -- There are two ways to define an 'Extend' instance: -- -- I. Provide definitions for 'extended' -- satisfying this law: -- -- > extended f . extended g = extended (f . extended g) -- -- II. Alternately, you may choose to provide definitions for 'duplicated' -- satisfying this law: -- -- > duplicated . duplicated = fmap duplicated . duplicated -- -- You may of course, choose to define both 'duplicated' /and/ 'extended'. -- In that case you must also satisfy these laws: -- -- > extended f = fmap f . duplicated -- > duplicated = extended id -- -- These are the default definitions of 'extended' and 'duplicated'. | 2026-01-13T09:30:25 |
https://github.com/jeremyevans/minitest-hooks | GitHub - jeremyevans/minitest-hooks: Around and before_all/after_all/around_all hooks for Minitest Skip to content Navigation Menu Toggle navigation Sign in Appearance settings Platform AI CODE CREATION GitHub Copilot Write better code with AI GitHub Spark Build and deploy intelligent apps GitHub Models Manage and compare prompts MCP Registry New Integrate external tools DEVELOPER WORKFLOWS Actions Automate any workflow Codespaces Instant dev environments Issues Plan and track work Code Review Manage code changes APPLICATION SECURITY GitHub Advanced Security Find and fix vulnerabilities Code security Secure your code as you build Secret protection Stop leaks before they start EXPLORE Why GitHub Documentation Blog Changelog Marketplace View all features Solutions BY COMPANY SIZE Enterprises Small and medium teams Startups Nonprofits BY USE CASE App Modernization DevSecOps DevOps CI/CD View all use cases BY INDUSTRY Healthcare Financial services Manufacturing Government View all industries View all solutions Resources EXPLORE BY TOPIC AI Software Development DevOps Security View all topics EXPLORE BY TYPE Customer stories Events & webinars Ebooks & reports Business insights GitHub Skills SUPPORT & SERVICES Documentation Customer support Community forum Trust center Partners Open Source COMMUNITY GitHub Sponsors Fund open source developers PROGRAMS Security Lab Maintainer Community Accelerator Archive Program REPOSITORIES Topics Trending Collections Enterprise ENTERPRISE SOLUTIONS Enterprise platform AI-powered developer platform AVAILABLE ADD-ONS GitHub Advanced Security Enterprise-grade security features Copilot for Business Enterprise-grade AI features Premium Support Enterprise-grade 24/7 support Pricing Search or jump to... Search code, repositories, users, issues, pull requests... --> Search Clear Search syntax tips Provide feedback --> We read every piece of feedback, and take your input very seriously. Include my email address so I can be contacted Cancel Submit feedback Saved searches Use saved searches to filter your results more quickly --> Name Query To see all available qualifiers, see our documentation . Cancel Create saved search Sign in Sign up Appearance settings Resetting focus You signed in with another tab or window. Reload to refresh your session. You signed out in another tab or window. Reload to refresh your session. You switched accounts on another tab or window. Reload to refresh your session. Dismiss alert {{ message }} jeremyevans / minitest-hooks Public Notifications You must be signed in to change notification settings Fork 13 Star 109 Around and before_all/after_all/around_all hooks for Minitest License MIT license 109 stars 13 forks Branches Tags Activity Star Notifications You must be signed in to change notification settings Code Issues 0 Pull requests 0 Discussions Actions Security Uh oh! There was an error while loading. Please reload this page . Insights Additional navigation options Code Issues Pull requests Discussions Actions Security Insights jeremyevans/minitest-hooks master Branches Tags Go to file Code Open more actions menu Folders and files Name Name Last commit message Last commit date Latest commit History 87 Commits .github/ workflows .github/ workflows lib/ minitest lib/ minitest spec spec .ci.gemfile .ci.gemfile .gitignore .gitignore CHANGELOG CHANGELOG Gemfile Gemfile MIT-LICENSE MIT-LICENSE README.rdoc README.rdoc Rakefile Rakefile minitest-hooks.gemspec minitest-hooks.gemspec View all files Repository files navigation README MIT license minitest-hooks minitest-hooks adds around and before_all/after_all/around_all hooks for Minitest. This allows you do things like run each suite of specs inside a database transaction, running each spec inside its own savepoint inside that transaction, which can significantly speed up testing for specs that share expensive database setup code. Installation gem install minitest - hooks Source Code Source code is available on GitHub at github.com/jeremyevans/minitest-hooks Usage In Specs (Minitest::Spec) For all specs require 'minitest/hooks/default' For some specs First, you need to require the library. require 'minitest/hooks' You can set the default for some specs to be Minitest::HooksSpec : Minitest :: Spec . register_spec_type ( /something/ , Minitest :: HooksSpec ) Alternatively, you can include Minitest::Hooks in a specific spec class: describe 'something' do include Minitest :: Hooks end before_all Hooks To run code before any specs in the suite are executed, pass :all to before : describe 'something' do before ( :all ) do DB [ :table ]. insert ( :column => 1 ) end end after_all Hooks To run code after all specs in the suite are executed, pass :all to after : describe 'something' do after ( :all ) do DB [ :table ]. delete end end around Hooks To run code around each spec in a suite, call around with a block, and have the block call super : describe 'something' do around do | & block | DB . transaction ( :rollback => :always , :savepoint => true , :auto_savepoint => true ) do super ( & block ) end end end around_all Hooks To run code around all specs in a suite, call around(:all) with a block, and have the block call super : describe 'something' do around ( :all ) do | & block | DB . transaction ( :rollback => :always ) do super ( & block ) end end end In Tests (Minitest::Test) Create a subclass of Minitest::Test and include Minitest::Hooks , and have your test classes subclass from that subclass: require 'minitest/hooks/test' class MyTest < Minitest :: Test include Minitest :: Hooks end class TestSuite1 < MyTest end You can just define the before_all , after_all , around , and around_all methods, instead of using the spec DSL. Make sure to call super when overriding the methods. class TestSuite1 < MyTest def before_all super DB [ :table ]. insert ( :column => 1 ) end def after_all DB [ :table ]. delete super end def around DB . transaction ( :rollback => :always , :savepoint => true , :auto_savepoint => true ) do super end end def around_all DB . transaction ( :rollback => :always ) do super end end end Behavior Hooks Just Define Methods Just like the before/after hooks supported by minitest, all hooks supported by minitest-hooks just define methods on the spec class, there is no magic (“It’s just ruby”). This has a couple of effects: You cannot define multiple hooks of the same type in the same class. This is because you cannot have multiple methods with the same name in the same class. If you define a second hook of the same type in the same class, it will overwrite the previous hook, just like ruby’s behavior if you define a method twice in the same class. For around and around(:all) hooks, you should always call super. If you want a subclass around hook to run inside a superclass around hook, you need to call super in the subclass hook and run the code inside the block you pass to super, then call block.call somewhere inside the super block: describe "superclass" do around do | & block | some_outer_method do super ( & block ) end end describe "subclass" do around do | & block | super do some_inner_method do block . call end end end end end You do not need to call super for before(:all) or after(:all) hooks. Both before(:all) and after(:all) implicitly call super for you in the method they define, mirroring minitest’s behavior for before and after hooks. All hooks share state/instance variables. So any instance variables you set in before(:all), around(:all), or around are shared with the examples. Note that after(:all) will only see instance variables set in before(:all) or around(:all), it will not see instance variables set inside examples. All Spec Classes are Independent The way minitest works, all spec classes are indepedent of other spec classes in terms of how and when they are executed, even spec classes that are subclasses of other spec classes. This means that for every spec class, the before(:all), after(:all), and around(:all) hooks for that class will be executed, even if they were defined in the spec’s superclass and not in the spec class itself. So if you have a spec superclass that uses before(:all), and a spec subclass for that superclass, the before(:all) in the spec superclass will be run twice, once in the context of an instance of the superclass, before executing the superclass’s specs, and once in the context of an instance of the subclass, before executing the subclass’s specs. Order of Operations For each spec class, the around(:all) hooks are run first. Both before(:all) and after(:all) run inside around(:all). For each spec inside the spec class, around will be called, and before and after for each spec will be run inside around. License MIT Author Jeremy Evans <code@jeremyevans.net> About Around and before_all/after_all/around_all hooks for Minitest Resources Readme License MIT license Uh oh! There was an error while loading. Please reload this page . Activity Stars 109 stars Watchers 3 watching Forks 13 forks Report repository Used by 1.2k + 1,144 Contributors 8 Uh oh! There was an error while loading. Please reload this page . Languages Ruby 100.0% Footer © 2026 GitHub, Inc. Footer navigation Terms Privacy Security Status Community Docs Contact Manage cookies Do not share my personal information You can’t perform that action at this time. | 2026-01-13T09:30:25 |
https://github.com/jeremyevans/thamble | GitHub - jeremyevans/thamble: Create HTML Tables from Enumerables Skip to content Navigation Menu Toggle navigation Sign in Appearance settings Platform AI CODE CREATION GitHub Copilot Write better code with AI GitHub Spark Build and deploy intelligent apps GitHub Models Manage and compare prompts MCP Registry New Integrate external tools DEVELOPER WORKFLOWS Actions Automate any workflow Codespaces Instant dev environments Issues Plan and track work Code Review Manage code changes APPLICATION SECURITY GitHub Advanced Security Find and fix vulnerabilities Code security Secure your code as you build Secret protection Stop leaks before they start EXPLORE Why GitHub Documentation Blog Changelog Marketplace View all features Solutions BY COMPANY SIZE Enterprises Small and medium teams Startups Nonprofits BY USE CASE App Modernization DevSecOps DevOps CI/CD View all use cases BY INDUSTRY Healthcare Financial services Manufacturing Government View all industries View all solutions Resources EXPLORE BY TOPIC AI Software Development DevOps Security View all topics EXPLORE BY TYPE Customer stories Events & webinars Ebooks & reports Business insights GitHub Skills SUPPORT & SERVICES Documentation Customer support Community forum Trust center Partners Open Source COMMUNITY GitHub Sponsors Fund open source developers PROGRAMS Security Lab Maintainer Community Accelerator Archive Program REPOSITORIES Topics Trending Collections Enterprise ENTERPRISE SOLUTIONS Enterprise platform AI-powered developer platform AVAILABLE ADD-ONS GitHub Advanced Security Enterprise-grade security features Copilot for Business Enterprise-grade AI features Premium Support Enterprise-grade 24/7 support Pricing Search or jump to... Search code, repositories, users, issues, pull requests... --> Search Clear Search syntax tips Provide feedback --> We read every piece of feedback, and take your input very seriously. Include my email address so I can be contacted Cancel Submit feedback Saved searches Use saved searches to filter your results more quickly --> Name Query To see all available qualifiers, see our documentation . Cancel Create saved search Sign in Sign up Appearance settings Resetting focus You signed in with another tab or window. Reload to refresh your session. You signed out in another tab or window. Reload to refresh your session. You switched accounts on another tab or window. Reload to refresh your session. Dismiss alert {{ message }} jeremyevans / thamble Public Notifications You must be signed in to change notification settings Fork 1 Star 20 Create HTML Tables from Enumerables 20 stars 1 fork Branches Tags Activity Star Notifications You must be signed in to change notification settings Code Issues 0 Pull requests 0 Discussions Actions Security Uh oh! There was an error while loading. Please reload this page . Insights Additional navigation options Code Issues Pull requests Discussions Actions Security Insights jeremyevans/thamble master Branches Tags Go to file Code Open more actions menu Folders and files Name Name Last commit message Last commit date Latest commit History 51 Commits .github/ workflows .github/ workflows lib lib spec spec .ci.gemfile .ci.gemfile .gitignore .gitignore CHANGELOG CHANGELOG MIT-LICENSE MIT-LICENSE README.rdoc README.rdoc Rakefile Rakefile thamble.gemspec thamble.gemspec View all files Repository files navigation README License Thamble Thamble creates HTML tables from enumerable objects. Installation gem install thamble Source Code Source code is available on GitHub at github.com/jeremyevans/thamble Examples The Thamble.table method expects an enumerable of arrays (such as an array of arrays), and returns a string containing the HTML table output: puts Thamble . table ([[ 1 , 2 ]]) output: <table> <tbody> <tr> <td>1</td> <td>2</td> </tr> </tbody> </table> If a block is passed to the method, all items in the enumerable are yielded to the block, and the block should return an array with the data to use in the table: puts Thamble . table ([{ :a => 1 , :b => 2 }, { :a => 3 , :b => 4 }]){ | l | [ l [ :b ], l [ :a ] + 10 ]} output: <table> <tbody> <tr> <td>2</td> <td>11</td> </tr> <tr> <td>4</td> <td>13</td> </tr> </tbody> </table> You can use the :headers option to set custom headers: puts Thamble . table ([[ 1 , 2 ], [ 3 , 4 ]], :headers => [ 'A' , 'B' ]) output: <table> <thead> <tr> <th>A</th> <th>B</th> </tr> </thead> <tbody> <tr> <td>1</td> <td>2</td> </tr> <tr> <td>3</td> <td>4</td> </tr> </tbody> </table> Other options supported are: :caption A caption for the table :column_th Use th instead of td for first cell in each row :table HTML attribute hash for the table itself :td HTML attribute hash for the table data cells, can be a proc called with the data value, row position, and row that returns a hash :th HTML attribute hash for the table header cells, can be a proc called with the header that returns a hash :tr HTML attribute hash for the table rows, can be a proc called with the row that returns a hash :widths Array of widths for each column Escaping By default, Thamble escapes all output. You can use the Thamble.raw method to return a string marked as already being escaped. puts Thamble . table ([[ '&1234;' , Thamble . raw ( '&1234;' )]]) output: <table> <tbody> <tr> <td>&amp;1234;</td> <td>&1234;</td> </tr> </tbody> </table> The raw method is also exposed on the second object yielded to Thamble.table: puts Thamble . table ([[ '1' , '&1234;' ]]) do | row , table | row . map { | value | table . raw ( value )} end Rails Support Thamble comes with basic rails support via: require 'thamble/rails' ApplicationController . helper Thamble :: RailsHelper This allows you to use the following style in your templates: <%= thamble([[1, 2], [3, 4]], :headers=>['A', 'B']) %> License MIT Author Jeremy Evans <code@jeremyevans.net> About Create HTML Tables from Enumerables Resources Readme Uh oh! There was an error while loading. Please reload this page . Activity Stars 20 stars Watchers 1 watching Forks 1 fork Report repository Releases 5 tags Packages 0 No packages published Uh oh! There was an error while loading. Please reload this page . Languages Ruby 100.0% Footer © 2026 GitHub, Inc. Footer navigation Terms Privacy Security Status Community Docs Contact Manage cookies Do not share my personal information You can’t perform that action at this time. | 2026-01-13T09:30:25 |
https://github.com/jeremyevans/roda-route_list | GitHub - jeremyevans/roda-route_list: List routes when using Roda Skip to content Navigation Menu Toggle navigation Sign in Appearance settings Platform AI CODE CREATION GitHub Copilot Write better code with AI GitHub Spark Build and deploy intelligent apps GitHub Models Manage and compare prompts MCP Registry New Integrate external tools DEVELOPER WORKFLOWS Actions Automate any workflow Codespaces Instant dev environments Issues Plan and track work Code Review Manage code changes APPLICATION SECURITY GitHub Advanced Security Find and fix vulnerabilities Code security Secure your code as you build Secret protection Stop leaks before they start EXPLORE Why GitHub Documentation Blog Changelog Marketplace View all features Solutions BY COMPANY SIZE Enterprises Small and medium teams Startups Nonprofits BY USE CASE App Modernization DevSecOps DevOps CI/CD View all use cases BY INDUSTRY Healthcare Financial services Manufacturing Government View all industries View all solutions Resources EXPLORE BY TOPIC AI Software Development DevOps Security View all topics EXPLORE BY TYPE Customer stories Events & webinars Ebooks & reports Business insights GitHub Skills SUPPORT & SERVICES Documentation Customer support Community forum Trust center Partners Open Source COMMUNITY GitHub Sponsors Fund open source developers PROGRAMS Security Lab Maintainer Community Accelerator Archive Program REPOSITORIES Topics Trending Collections Enterprise ENTERPRISE SOLUTIONS Enterprise platform AI-powered developer platform AVAILABLE ADD-ONS GitHub Advanced Security Enterprise-grade security features Copilot for Business Enterprise-grade AI features Premium Support Enterprise-grade 24/7 support Pricing Search or jump to... Search code, repositories, users, issues, pull requests... --> Search Clear Search syntax tips Provide feedback --> We read every piece of feedback, and take your input very seriously. Include my email address so I can be contacted Cancel Submit feedback Saved searches Use saved searches to filter your results more quickly --> Name Query To see all available qualifiers, see our documentation . Cancel Create saved search Sign in Sign up Appearance settings Resetting focus You signed in with another tab or window. Reload to refresh your session. You signed out in another tab or window. Reload to refresh your session. You switched accounts on another tab or window. Reload to refresh your session. Dismiss alert {{ message }} jeremyevans / roda-route_list Public Notifications You must be signed in to change notification settings Fork 3 Star 27 List routes when using Roda License MIT license 27 stars 3 forks Branches Tags Activity Star Notifications You must be signed in to change notification settings Code Issues 0 Pull requests 0 Discussions Actions Security Uh oh! There was an error while loading. Please reload this page . Insights Additional navigation options Code Issues Pull requests Discussions Actions Security Insights jeremyevans/roda-route_list master Branches Tags Go to file Code Open more actions menu Folders and files Name Name Last commit message Last commit date Latest commit History 42 Commits .github/ workflows .github/ workflows bin bin lib lib spec spec .ci.gemfile .ci.gemfile .gitignore .gitignore CHANGELOG CHANGELOG MIT-LICENSE MIT-LICENSE README.rdoc README.rdoc Rakefile Rakefile roda-route_list.gemspec roda-route_list.gemspec View all files Repository files navigation README MIT license roda-route_list The Roda route_list plugin reads route information from a json file, and then makes the route metadata available for introspection. This provides a workaround to the general issue of routing trees being unable to introspect the routes. Installation gem install roda - route_list Source Code Source code is available on GitHub at github.com/jeremyevans/roda-route_list Basic Usage This plugin assumes that a json file containing the routes metadata has already been created. The recommended way to create one is to add comments above each route in the Roda app, in one of the following formats: # route: /path/to/foo # route: GET /path/to/foo # route: GET|POST /path/to/foo/:foo_id # route[route_name]: /path/to/foo # route[route_name]: GET /path/to/foo # route[foo]: GET|POST /path/to/foo/:foo_id As you can see, the general style is a comment followed by the word route. If you want to name the route, you can put the name in brackets. Then you have a colon. Optionally after that you can have the method for the route, or multiple methods separated by pipes if the path works with multiple methods. The end is the path for the route. Assuming you have added the appropriate comments as explained above, you can create the json file using the roda-parse_routes executable that came with the roda-route_list gem: roda-parse_routes -f routes.json app.rb Assuming you have the necessary json file created, you can then get route information: plugin :route_list # Array of route metadata hashes route_list # => [{:path=>'/path/to/foo', :methods=>['GET', 'POST']}] # path for the route with the given name listed_route ( :route_name ) # => '/path/to/foo' # path for the route with the given name, supplying hash for placeholders listed_route ( :foo , :foo_id => 3 ) # => '/path/to/foo/3' # path for the route with the given name, supplying array for placeholders listed_route ( :foo , [ 3 ]) # => '/path/to/foo/3' The listed_route method is also available at the instance level to make it easier to use inside the route block. Automatically Updating the Routes Metadata On Heroku You can get this to work on Heroku by hooking into the facility for precompiling assets. If this consider your route list an asset, this makes sense. You just need to add an assets:precompile task, similar to this (or add the code an existing assets:precompile task): namespace :assets do desc "Update the routes metadata" task :precompile do sh 'roda-parse_routes -f routes.json app.rb' end end Otherwise At the top of your Roda app file, or at least before you create the Roda app subclass, just call the roda-parse_routes program: # app.rb system 'roda-parse_routes' , '-f' , 'routes.json' , __FILE__ require 'roda' class App < Roda # ... end License MIT Maintainer Jeremy Evans <code@jeremyevans.net> About List routes when using Roda Resources Readme License MIT license Uh oh! There was an error while loading. Please reload this page . Activity Stars 27 stars Watchers 4 watching Forks 3 forks Report repository Releases 3 tags Packages 0 No packages published Uh oh! There was an error while loading. Please reload this page . Contributors 3 Uh oh! There was an error while loading. Please reload this page . Languages Ruby 100.0% Footer © 2026 GitHub, Inc. Footer navigation Terms Privacy Security Status Community Docs Contact Manage cookies Do not share my personal information You can’t perform that action at this time. | 2026-01-13T09:30:25 |
https://github.com/jeremyevans/ruby-cicphash/actions/workflows/ci.yml | CI · Workflow runs · jeremyevans/ruby-cicphash · GitHub Skip to content Navigation Menu Toggle navigation Sign in Appearance settings Platform AI CODE CREATION GitHub Copilot Write better code with AI GitHub Spark Build and deploy intelligent apps GitHub Models Manage and compare prompts MCP Registry New Integrate external tools DEVELOPER WORKFLOWS Actions Automate any workflow Codespaces Instant dev environments Issues Plan and track work Code Review Manage code changes APPLICATION SECURITY GitHub Advanced Security Find and fix vulnerabilities Code security Secure your code as you build Secret protection Stop leaks before they start EXPLORE Why GitHub Documentation Blog Changelog Marketplace View all features Solutions BY COMPANY SIZE Enterprises Small and medium teams Startups Nonprofits BY USE CASE App Modernization DevSecOps DevOps CI/CD View all use cases BY INDUSTRY Healthcare Financial services Manufacturing Government View all industries View all solutions Resources EXPLORE BY TOPIC AI Software Development DevOps Security View all topics EXPLORE BY TYPE Customer stories Events & webinars Ebooks & reports Business insights GitHub Skills SUPPORT & SERVICES Documentation Customer support Community forum Trust center Partners Open Source COMMUNITY GitHub Sponsors Fund open source developers PROGRAMS Security Lab Maintainer Community Accelerator Archive Program REPOSITORIES Topics Trending Collections Enterprise ENTERPRISE SOLUTIONS Enterprise platform AI-powered developer platform AVAILABLE ADD-ONS GitHub Advanced Security Enterprise-grade security features Copilot for Business Enterprise-grade AI features Premium Support Enterprise-grade 24/7 support Pricing Search or jump to... Search code, repositories, users, issues, pull requests... --> Search Clear Search syntax tips Provide feedback --> We read every piece of feedback, and take your input very seriously. Include my email address so I can be contacted Cancel Submit feedback Saved searches Use saved searches to filter your results more quickly --> Name Query To see all available qualifiers, see our documentation . Cancel Create saved search Sign in Sign up Appearance settings Resetting focus You signed in with another tab or window. Reload to refresh your session. You signed out in another tab or window. Reload to refresh your session. You switched accounts on another tab or window. Reload to refresh your session. Dismiss alert {{ message }} jeremyevans / ruby-cicphash Public Notifications You must be signed in to change notification settings Fork 1 Star 7 Code Issues 0 Pull requests 0 Discussions Actions Security Uh oh! There was an error while loading. Please reload this page . Insights Additional navigation options Code Issues Pull requests Discussions Actions Security Insights Actions: jeremyevans/ruby-cicphash Actions --> All workflows Workflows CI CI Show more workflows... Management Caches Deployments CI CI Actions Loading... Loading Sorry, something went wrong. Uh oh! There was an error while loading. Please reload this page . --> will be ignored since log searching is not yet available Show workflow options Create status badge Create status badge Loading Uh oh! There was an error while loading. Please reload this page . ci.yml --> will be ignored since log searching is not yet available 7 workflow runs 7 workflow runs Event Filter by Event Sorry, something went wrong. Filter Loading Sorry, something went wrong. No matching events. Status Filter by Status Sorry, something went wrong. Filter Loading Sorry, something went wrong. No matching statuses. Branch Filter by Branch Sorry, something went wrong. Filter Loading Sorry, something went wrong. No matching branches. Actor Filter by Actor Sorry, something went wrong. Filter Loading Sorry, something went wrong. No matching users. Add Ruby 4.0 to CI CI #30: Commit c76523b pushed by jeremyevans 20m 46s master master 20m 46s View workflow file Use SimpleCov.add_filter block instead of string CI #29: Commit e743696 pushed by jeremyevans 48s master master 48s View workflow file Add JRuby 10.0 to CI CI #28: Commit e8a0191 pushed by jeremyevans 12m 30s master master 12m 30s View workflow file Switch rdoc task to normal rake task, avoid rdoc/task require CI #27: Commit 4036478 pushed by jeremyevans 14s master master 14s View workflow file Work with ubuntu-latest using 24.04 by default in CI CI #26: Commit 7c48d1d pushed by jeremyevans 52s master master 52s View workflow file Add Ruby 3.4 to CI CI #25: Commit 8042091 pushed by jeremyevans 1m 50s master master 1m 50s View workflow file Use -W:strict_unused_block when running tests on Ruby 3.4+ CI #24: Commit a458aa1 pushed by jeremyevans 1m 3s master master 1m 3s View workflow file You can’t perform that action at this time. | 2026-01-13T09:30:25 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.