DOCSLIB.ORG

Interval Arithmetic” Library in Common Lisp

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Interval Arithmetic” Library in Common Lisp Why You Cannot (Yet) Write an “Interval Arithmetic” Library in Common Lisp . or: Hammering Some Sense into :ieee-floating-point Marco Antoniotti Dipartimento di Informatica, Sistemistica e Comunicazione Università degli Studi di Milano Bicocca [email protected] ABSTRACT 1 INTRODUCTION “Interval Arithmetic” (IA) appears to be a useful numerical An interesting exercise (academic or not) that a programmer tool to have at hand in several applications. Alas, the current (Common Lisp or not) may find intriguing is to implement an IA descriptions and proposed standards are always formulated Interval Arithmetic (IA) library1. Programmers of all stripes in terms of the IEEE-754 standard, and the status of IEEE- would learn a lot if they tried to really implement an IA 754 compliance of most Common Lisp implementations is not library. But since most probably won’t, this paper may serve up to par. as sufficient summary to get you through a cocktail party A solution would be for Common Lisp implementations to conversation on the matter. adhere to the Language Independent Arithmetic (LIA) IEC The usefulness of IA is rather established; many numerical standard, which includes IEEE 754. issues can be naturally dealt with by using an IA library, al- While the LIA standard provides a set of proposed bindings beit at a slight increase in computation times. There is a nice for Common Lisp, the format and depth of the specification body of literature and proposed standards to ensure avail- documents is not readily usable by a Common Lisp program- ability of IA in a computing environment, and many of these mer, should an implementation decide to comply with the eventually provide one or two different interval representa- provisions. Moreover, much latitude is left to each implemen- tions (endpoint and midpoint), the operations on them, and tation to provide the LIA “environmental” setup. nitpicking treatment of corner cases; e.g., intervals with infi- It would be most beneficial if more precision were agreed nite endpoints and interval division by an interval containing upon by the Common Lisp community about how to provide 0. LIA compliance in the implementations. In that case, a new As we shall see, the “nitpicking” boils down to using the set of documentation or manuals in the style of the Hyper- IEEE-754/IEC-60559 standards [11]. Eventually, in this work, Spec could be provided, for the benefit of the Common Lisp the use of the IEC Language Independent Arithmetic (LIA) programmer. standards [6–8] will be advocated. The LIA standard is a The goal of this paper is to foster a discussion within comprehensive collection of concepts and carefully thought the Common Lisp community to converge on a complete out behaviors a basic library of integer, floating point and specification for LIA compliance. The paper discusses someof complex numbers mathematical functions and ancillary en- the issues that must be resolved to reach that goal, e.g., error vironment functionalities should look like. One of the, in handling and full specification of mathematical functions the opinion of the writer, unstated goals of LIA is that a behavior. programmer should be able to relatively easily understand mathematical software writeen in any language ecosystem KEYWORDS that abided the specification. Programming Languages, Common Lisp, Library Specification, A word of caution. The present paper is neither a full Floating Point Arithmetic, Language Independent Arithmetic blown Common Lisp LIA specification, nor a description of an implementation of the functionalities depicted herein. It ACM Reference Format: rather is a leaflet that intend to present the community a Marco Antoniotti. 2020. Why You Cannot (Yet) Write an “Inter- val Arithmetic” Library in Common Lisp: . or: Hammering Some project which, in the modest opinion of the writer, should Sense into :ieee-floating-point. In Proceedings of the 13th Eu- be completed after careful debate and careful consideration ropean Lisp Symposium (ELS 2020). ACM, New York, NY, USA, of all the details. 8 pages. https://doi.org/10.5281/zenodo.3759522 1.1 An IA Library. Hitting the Wall Permission to make digital or hard copies of part or all of this work for personal or classroom use is granted without fee provided that An IA library in Common Lisp implementing what is known copies are not made or distributed for profit or commercial advantage as an endpoint representation can be easily started as follows. and that copies bear this notice and the full citation on the first page. For brevity, since it is a valid Common Lisp identifier, we use Copyrights for third-party components of this work must be honored. For all other uses, contact the owner/author(s). ELS 2020, April 27–28 2020, Zürich, Switzerland 1See, for example [4], or [5] for a rather complete summary with © 2020 Copyright held by the owner/author(s). references to the seminal works in the area. IEEE has also published a https://doi.org/10.5281/zenodo.3759522 preliminary standard for IA [10]. ELS 2020, April 27–28 2020, Zürich, Switzerland Marco Antoniotti the name [] here for what other languages might call an floating-point-invalid-operation interval. division-by-zero (defstruct ([] (:constructor [] (low high))) Alas, their use is inconsistent across implementations (apart (low 0.0 :type real) from the mostly clear cut case of division-by-zero). Two (high 0.0 :type real)) implementations may choose to signal floating-point-invalid-operation or (defun radius (i) (- ([]-high i) ([]-low i))) floating-point-inexact on the same operation. This is not the only issue vis-a-vis Common Lisp and the (defun pointp (i) (= ([]-high i) ([]-low i))) IEEE-754. A deeper issue pertains the notification machinery that is invoked when one of the aforementioned conditions is (defmethod add ((i1 []) (i2 [])) to be signaled by an operation. Should an implementation ([] (+ ([]-low i1) ([]-low i2)) actually signal a (floating point) condition using error, or (+ ([]-high i1) ([]-high i2)))) should it go the C way [3] and record somewhere an indication that a condition “happened”, for the programmer to check (defmethod sub ((i1 []) (i2 [])) directly? ([] (- ([]-low i1) ([]-high i2)) (- ([]-high i1) ([]-low i2)))) 1.2 Common Lisp Implementations and the After starting in earnest, a Common Lisp (or Java, C, :ieee-floating-point Feature R, Python) programmer is soon faced with a number of The ANSI Common Lisp Standard [1] makes provisions for a numerical issues, should she be willing to achieve the best Common Lisp implementation to “declare” that it purports possible behavior out of the IA library. to conform to the requirements of the IEEE Standard for The problem is that, as mentioned before, IA specifications Binary Floating-Point Arithmetic (no reference given). There are usually formulated in terms of the IEEE-754 standard, are a few problems with this statement3. which, at this point is readily available only to C and C++ The presence of the feature in a programmers2 In particular, the IA specifications exploit :ieee-floating-point Common Lisp implementation is a (very) partial indication rounding modes and infinities, which are unevenly available that some support for the IEEE-754 is available. Table 1 in Common Lisp implementations; another, related issue is shows a summary of the current state of compliance for a the treatment of floating point exceptions. number of implementations4 with respect to the notions just Rounding Modes. If we had available some ways of handling described. infinities and rounding modes, we could write the IA library operations as follows: Infinities and NaNs. Many implementations provide infini- ties and NaNs, but with obviously different lineages. E.g., (defmethod add ((i1 []) (i2 [])) the following syntax is used by LW and CCL, which is then ([] (rounding-down (+ ...)) declined in various interesting ways: (rounding-up (+ ...)))) where rounding-down and rounding-up are macros with an ∞ 1F++0, 1D-+0 intuitive semantics. Unfortunately, at this point in time, it is NaN 1F+-0, 1S–0 not possible to provide the rounding-down and rounding-up but ACL chooses to provide “variables” with read-time syn- macros without delving deeply in an implementation. tax. Infinities and NaNs. Another issue is the handling of spe- ACL prompt> *infinity-single* cial values: essentially infinities and NaNs (not-a-number). #.*INFINITY-SINGLE* Both items are handled unevenly in Common Lisp implementa- tions; infinities and quiet NaNs (cfr. the IEEE-754 standard) ACL prompt> (+ 42 *nan-single*) are somewhat supported; signaling NaNs not so much so. #.*NAN-SINGLE* Handling of Floating Point Exceptions. Apart from our While this may be perfectly sensible it has the drawback of doomed IA library, another issue that is not always very well not playing so nicely with *read-eval*. clarified in Common Lisp implementations (and especially The only implementations that allow a programmer to get across them) is how floating points exceptions are handled. a handle on a signaling NaN are CMUCL and SBCL. There The Common Lisp standard defines the conditions: appear to be no easy way to create such a value in the other implementations. floating-point-overflow floating-point-underflow floating-point-inexact 3A form of “left to the implementation”, which, as usual, does not bode well for the programmer. 2There are, e.g., Python bindings to IEEE-754, but they rely on the 4The table is incomplete because not all implementations were checked underlying C library implementation. and because the notion of “compliance” is rather complicated to assess Cfr., https://www.python.org/dev/peps/pep-0754/. in this case. Why You Cannot (Yet) Write an “Interval Arithmetic” Library in Common Lisp ELS 2020, April 27–28 2020, Zürich, Switzerland CMUCL/SBCL LW ACL ABCL ECL CCL Infinities Y Y Y U U Y Quiet NaNs Y Y Y U U Y Signaling NaNs Y N N U U U Rounding Y N N U U N Exceptions NACF P P P P P P Exceptions NRI Y N N U U N Table 1: Common Lisp implementations “compliance” status w.r.t.
Load more

Recommended publications
  • The Glib/GTK+ Development Platform
    The GLib/GTK+ Development Platform A Getting Started Guide Version 0.8 Sébastien Wilmet March 29, 2019 Contents 1 Introduction 3 1.1 License . 3 1.2 Financial Support . 3 1.3 Todo List for this Book and a Quick 2019 Update . 4 1.4 What is GLib and GTK+? . 4 1.5 The GNOME Desktop . 5 1.6 Prerequisites . 6 1.7 Why and When Using the C Language? . 7 1.7.1 Separate the Backend from the Frontend . 7 1.7.2 Other Aspects to Keep in Mind . 8 1.8 Learning Path . 9 1.9 The Development Environment . 10 1.10 Acknowledgments . 10 I GLib, the Core Library 11 2 GLib, the Core Library 12 2.1 Basics . 13 2.1.1 Type Definitions . 13 2.1.2 Frequently Used Macros . 13 2.1.3 Debugging Macros . 14 2.1.4 Memory . 16 2.1.5 String Handling . 18 2.2 Data Structures . 20 2.2.1 Lists . 20 2.2.2 Trees . 24 2.2.3 Hash Tables . 29 2.3 The Main Event Loop . 31 2.4 Other Features . 33 II Object-Oriented Programming in C 35 3 Semi-Object-Oriented Programming in C 37 3.1 Header Example . 37 3.1.1 Project Namespace . 37 3.1.2 Class Namespace . 39 3.1.3 Lowercase, Uppercase or CamelCase? . 39 3.1.4 Include Guard . 39 3.1.5 C++ Support . 39 1 3.1.6 #include . 39 3.1.7 Type Definition . 40 3.1.8 Object Constructor . 40 3.1.9 Object Destructor .
    [Show full text]
  • The Component Object Model Specification Version 0.9 October 24, 1995
    http://scottge.wordpress.com The Component Object Model Specification Version 0.9 October 24, 1995 This document contains the specification to the Component Object Model (COM), an architecture and supporting infrastructure for building, using, and evolving component software in a robust manner. This specification contains the standard APIs supported by the COM Library, the standard suites of interfaces supported or used by software written in a COM environment, along with the network protocols used by COM in support of distributed computing. This specification is still in draft form, and thus subject to change. Note: This document is an early release of the final specification. It is meant to specify and accompany software that is still in development. Some of the information in this documentation may be inaccurate or may not be an accurate representation of the functionality of the final specification or software. Microsoft assumes no responsibility for any damages that might occur either directly or indirectly from these inaccuracies. Microsoft may have trademarks, copyrights, patents or pending patent applications, or other intellectual property rights covering subject matter in this document. The furnishing of this document does not give you a license to these trademarks, copyrights, patents, or other intellectual property rights. Copyright ? 1992-95 Microsoft Corporation. All Rights Reserved The Component Object Model Specification The Component Object Model The Component Object Model Specification Draft Version 0.9, October 24, 1995 Microsoft Corporation and Digital Equipment Corporation Copyright ? 1992-95 Microsoft Corporation. Microsoft does not make any representation or warranty regarding the Specification or any product or item developed based on the Specification.
    [Show full text]
  • Reading for Monday
    Reading for Monday Subsequent pages of this document contain the appropriate excerpts from the 3 papers, in the order of the bullet points listed below: • H/Direct: • Read sections 1 and 2: this sets up the problem and design space. – In section 2.3: focus on understanding IDL types versus Haskell types. • Read the bullets on page 157: these explain the five IDL pointer types. • Attempt to understand what marshalPoint on page 159 is doing. • Take note of the main claim on the page after page 159. • Stretching the storage manager: • Read section 4 to understand stable names and stable pointers – Read section 4.4 closely to understand some garbage collection im- plications. • Read section 5.6 to understand the memory management issue (not the solution). • Calling hell from heaven and heaven from hell: • Read the second bulleted point in the intro. • Read section 3 – Read section 3.3 closely (stable pointers) – Read section 3.5 closely (higher-order callbacks) • The Lua Registry: • Read section 27.3.1: “Lua offers a separate table, called the registry, that C code can freely use, but Lua code cannot access.” 1 H/Direct: A Binary Foreign Language Interface for Haskell Sigbjorn Finne Daan Leijen Erik Meijer University of Glasgow University of Utrecht University of Utrecht [email protected] [email protected] [email protected] Simon Peyton Jones University of Glasgow [email protected] Abstract the particular Haskell implementation. To maintain this in- dependence, H/Direct requires the implementation to sup- H/Direct is a foreign-language interface for the purely func- port a primitive foreign-language interface mechanism, ex- tional language Haskell.
    [Show full text]
  • On2 Flix Engine for Linux Installation
    On2 Flix Engine for Linux Installation Topics Preparing the System Java Perl PHP Python Installation Instructions 1. Accept the EULA 2. Verify Prerequisites 3. Uninstall the Previous Version 4. Verify Language Support 5. Register On2 Flix Engine 6. Configure the Installation 7. Install Files 8. Configure the System 9. Build Optional Modules 10. Installation Complete Additional Resources Preparing the System Perform the following to prepare the system for installation: 1. Read the System Overview document provided with this release. 2. Verify Linux prerequisites. a. Operating System: x86 GNU/Linux with GNU C Library (glibc) version 2.3.2 or higher, x86_64 is supported with 32-bit support libraries installed. To determine the version of glibc installed on your system, execute the following: $ /lib/ld-linux.so.2 /lib/libc.so.6 This command should produce output similar to the following (note, your output may differ, however the version number should be equal or greater). © 2009, On2 Technologies, Inc. 1 On2 Flix Engine for Linux Installation GNU C Library stable release version 2.3.2, by Roland McGrath et al. Copyright (C) 2003 Free Software Foundation, Inc. This is free software; see the source for copying conditions. There is NO warranty; not even for MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. Compiled by GNU CC version 3.3.3. Compiled on a Linux 2.4.26 system on 2004-05-24. Available extensions: GNU libio by Per Bothner crypt add-on version 2.1 by Michael Glad and others linuxthreads-0.10 by Xavier Leroy BIND-8.2.3-T5B libthread_db work sponsored by Alpha Processor Inc NIS(YP)/NIS+ NSS modules 0.19 by Thorsten Kukuk Report bugs using the `glibcbug' script to <[email protected]>.
    [Show full text]
  • Inferred Interface Glue: Supporting Language Interoperability with Static Analysis
    Inferred Interface Glue: Supporting Language Interoperability with Static Analysis by Tristan Ravitch A dissertation submitted in partial fulfillment of the requirements for the degree of Doctor of Philosophy (Computer Sciences) at the UNIVERSITY OF WISCONSIN–MADISON 2013 Date of final oral examination: 08/09/2013 The dissertation is approved by the following members of the Final Oral Committee: Ben Liblit, Associate Professor, Computer Sciences Tom Reps, Professor, Computer Sciences Susan Horwitz, Professor, Computer Sciences Somesh Jha, Professor, Computer Sciences Timothy Tautges, Adjunct Professor, Engineering Physics © Copyright by Tristan Ravitch 2013 All Rights Reserved i acknowledgments I would like to thank Aditya Thakur, Tycho Andersen, Evan Driscoll, and Steve Jackson for many productive technical discussions and valuable feedback for both practice talks and paper submissions. I would also like to thank my advisor Ben Liblit for consistent encouragement and support. Most importantly, I thank Tycho Andersen, Polina Dudnik, James Doherty, Aubrey Barnard, Erin Barnard, and Bess Berg for numerous bicycle rides and the many other things that have made Madison enjoyable. ii contents Contents ii List of Tables iv List of Figures v Abstract viii 1 Introduction 1 1.1 Preliminaries 6 2 Related Work 8 2.1 Library Binding Generation 8 2.2 FFI Checking 10 3 Error Codes 12 3.1 Algorithm 14 3.2 Related Work 30 3.3 Evaluation 31 4 Semantics of Pointer Parameters 43 4.1 Symbolic Access Paths 48 4.2 Array Parameters 50 4.3 Output Parameters 51
    [Show full text]
  • Using the Go Programming Language in Practice
    MASTER’S THESIS | LUND UNIVERSITY 2014 Using the Go Programming Language in Practice Fredrik Pettersson, Erik Westrup Department of Computer Science Faculty of Engineering LTH ISSN 1650-2884 LU-CS-EX 2014-19 Using the Go Programming Language in Practice Erik Westrup Fredrik Pettersson <[email protected]> <[email protected]> <[email protected]> <[email protected]> June 5, 2014 Master’s thesis work carried out at Axis Communications AB for the Department of Computer Science, Lund University. Supervisors: Jonas Skeppstedt <[email protected]> Mathias Bruce <[email protected]> Robert Rosengren <[email protected]> Examiner Jonas Skeppstedt Abstract When developing software today, we still use old tools and ideas. Maybe it is time to start from scratch and try tools and languages that are more in line with how we actually want to develop software. The Go Programming Language was created at Google by a rather famous trio: Rob Pike, Ken Thompson and Robert Griesemer. Before introducing Go, the company suffered from their development process not scaling well due to slow builds, uncontrolled dependencies, hard to read code, poor documenta- tion and so on. Go is set out to provide a solution for these issues. The purpose of this master’s thesis was to review the current state of the language. This is not only a study of the language itself but an investigation of the whole software development process using Go. The study was carried out from an embedded development perspective which includes an investigation of compilers and cross-compilation. We found that Go is exciting, fun to use and fulfills what is promised in many cases.
    [Show full text]
  • Extending PCL for Use with Python: Bindings Generation Using Pybind11
    Extending PCL for use with Python: Bindings generation using Pybind11 (Proposal for Google Summer of Code, 2020) Name and Contact Information Name: Divyanshu Madan ​ Github: divmadan ​ ​ Gitter: divmadan ​ ​ ​ Email: [email protected] ​ ​ Postal Address: 4-Cha-18, Jawahar Nagar, Jaipur, Rajasthan ​ Country: India ​ Phone: (+91) 9261700477 ​ Primary Language: English ​ About the document This document is very extensive and requires a section about itself, to stay sane. A few points: ● It documents various tools, existing solutions, other project’s solutions etc. along with my proposal, how to tackle insufficiencies, timeline, etc. ● The “research” part (existing solutions, analysis, etc) is very extensive, difficult to structure in tabular form, and hard to summarize. Thus, it takes up a lot of space in the document. ● I have tried to make the sections independent of each other, so you can safely skip parts of the document, in case you want to. ● I have limited the headings up to 3 levels (H2, H3, H4). A simplified skeleton or structure of the document: C++ and Python Motivation: why create bindings for PCL? Existing binding solutions (for PCL) |_Pcl.py … Analysis of other open-source projects’ bindings |_OpenCV-Python … Analysis of available support tools and libraries for binding generation ​ |_Why use tools? ... The Proposal |_The idea … Stretch Goals |_Jupyter Visualization … Timeline Biographical Information Table of Contents Extending PCL for use with Python: Bindings generation using Pybind11 1 Name and Contact Information
    [Show full text]
  • Application Programming Interface (API) Is a Specification Intended to Be Used As an Interface by Software Components to Communicate with Each Other
    Application programming interface 1 Application programming interface An application programming interface (API) is a specification intended to be used as an interface by software components to communicate with each other. An API may include specifications for routines, data structures, object classes, and variables. An API specification can take many forms, including an International Standard such as POSIX or vendor documentation such as the Microsoft Windows API, or the libraries of a programming language, e.g. Standard Template Library in C++ or Java API. An API differs from an application binary interface (ABI) in that the former is source code based while the latter is a binary interface. For instance POSIX is an API, while the Linux Standard Base is an ABI.[1] Language used An API can be: • language-dependent, meaning it is only available by using the syntax and elements of a particular language, which makes the API more convenient to use. • language-independent, written so that it can be called from several programming languages. This is a desirable feature for a service-oriented API that is not bound to a specific process or system and may be provided as remote procedure calls or web services. For example, a website that allows users to review local restaurants is able to layer their reviews over maps taken from Google Maps, because Google Maps has an API that facilitates this functionality. Google Maps' API controls what information a third-party site can use and how they can use it. The term API may be used to refer to a complete interface, a single function, or even a set of APIs provided by an organization.
    [Show full text]
  • A Software Architecture for Embedded Telematics Devices on Linux Master of Science Thesis in Secure and Dependable Computer Systems
    A software architecture for embedded telematics devices on Linux Master of Science Thesis in Secure and Dependable Computer Systems HUGO HOLGERSSON Chalmers University of Technology University of Gothenburg Department of Computer Science and Engineering Göteborg, Sweden, December 2011 The Author grants to Chalmers University of Technology and University of Gothen- burg the non-exclusive right to publish the Work electronically and in a non-commercial purpose make it accessible on the Internet. The Author warrants that he/she is the author to the Work, and warrants that the Work does not contain text, pictures or other material that violates copyright law. The Author shall, when transferring the rights of the Work to a third party (for example a publisher or a company), acknowledge the third party about this agreement. If the Author has signed a copyright agreement with a third party regarding the Work, the Author warrants hereby that he/she has obtained any necessary permission from this third party to let Chalmers University of Technology and University of Gothenburg store the Work electronically and make it accessible on the Internet. A software architecture for embedded telematics devices on Linux c HUGO HOLGERSSON, Göteborg, Sweden, December 2011 Examiner: Johan Karlsson, [email protected] Professor of Dependable and Robust Real-Time Systems Department of Computer Science and Engineering Chalmers University of Technology University of Gothenburg Department of Computer Science and Engineering SE-412 96 Göteborg Sweden Telephone: + 46 (0)31-772 1000 Abstract This master thesis proposes a Linux-based software architecture for modern telemat- ics devices. Our device is installed in trucks and has the purpose of forwarding collected GPS data to an online data center in a robust way.
    [Show full text]
  • An Introduction to the D-Bus Language Binding for Oorexx
    An Introduction to the D-Bus Language Binding for ooRexx Rony G. Flatscher ([email protected]), WU Vienna "The 2011 International Rexx Symposium", Oranjestad, Aruba, Dutch West-Indies December 4th – 7th, 2011 Abstract. This article introduces the ooRexx language binding for the D-Bus interprocess communication. In order to do so it first introduces the D-Bus concepts and how they relate to each other. The dynamically typed ooRexx language possesses a C++ API that gets used together with a matching ooRexx package to create the language binding for the D-Bus. After introducing the core ooRexx class, “DBus”, the abilities for creating ooRexx proxy objects for remote D-Bus service objects, ooRexx listeners for D-Bus signals and ooRexx D-Bus service objects get documented. ooRexx nutshell examples serve to demonstrate each of these abilities of the ooRexx D-Bus binding, which the reader can use to assess this particular language binding. ooRexx programmers should become able to understand the D-Bus concepts and put them to work for their purposes, after studying this article. 1 Introduction D-Bus is an interprocess communication wire protocol that got originally developed by Red Hat [1]. Over the course of time the D-Bus development has been anchored with the Linux “free desktop” [2], [3] initiative, that develops open source technology that can be deployed on any Linux operating system. D-Bus is being used on Linux systems for kernel programs to communicate with other parts of the Linux system and to emit signals that may be interesting for desktop application programmers, like gaining or losing access to devices and the like.
    [Show full text]
  • Introduction to GTK+
    Introduction to GTK+ Ted Gould PLUG Developers Meeting August 4th, 2003 http:/ / gould.cx/ ted/ projects/ gtkintro/ Presentation Outline ● GTK+ and helper libraries ● Glib Object Model ● GTK+ Programming <break> ● GNOME Libraries ● References GTK+ Overview ● Developed to move The GIMP off of Motif ● Realized that C could be object oriented ● Created in C for compatibility (every modern language can load C libraries) ● Large number of bindings (Effiel, Java, Ruby...) ● GUI Interface designer: Glade ● License: LGPL ● Used in the GNOME project (and many others) Helping out GTK+ Pango Text Rendering Library ● Greek 'Pan' for 'All' and Japanese 'Go' for language ● Internationalized text rendering library – not actually GTK+ specific, but used by GTK+ ● Uses Unicode internally ● Focus on 'correct' rendering of anything ● Font system and toolkit independent ● For modern Linux uses XFT Accessibility Toolkit ● Hard to find documentation on :) ● Allows GTK (and other) programs to be used by screen readers, magnifiers, etc. ● Developed by the developers that built the accessibility for Java ● Required for many corporations (especially gov't) to use software GDK: Gimp Display Kit ● Library to perform the actual rendering to the display ● Abstracts out the display so that it can be X11 or Win32 or Cocoa or whatever ● Also provides some pixmap functions if you need those (not covered today) Glib C Utility Library ● Makes C 'easy to use' ● Provides much of the functionality that is replicated in many programs ● Has things like: memory allocation, linked
    [Show full text]
  • Gtk/Gtk.H> Int Main (Int Argc, Char *Argv[]) { Gtkwidget *Window;
    CS23 2010.2.20 2 GTK+ (GIMP Toolkit) • GIMP (GNU Image Manipulation) Default graphical toolkit of GNOME and XFCE Written entirely in C Majority of GTK+ software is also written in C Language binding • C++, Python, PHP, Ruby, Perl, C#, or Java 3 4 5 Basic structure of a GTK+ application Even if clicking on ‘X’ button, this application will not be killed • should use ctrl+c 6 #include <gtk/gtk.h> int main (int argc, char *argv[]) { GtkWidget *window; /* Initialize the GTK+ and all of its supporting libraries. */ gtk_init (&argc, &argv); /* Create a new window, give it a title and display it to the user. */ window = gtk_window_new (GTK_WINDOW_TOPLEVEL); gtk_window_set_title (GTK_WINDOW (window), "Hello World"); gtk_widget_show (window); /* Hand control over to the main loop. */ gtk_main (); return 0; } 7 gcc hello.c -o hello `pkg-config --cflags --libs gtk+-2.0` Take care to type backticks, not apostrophes • backticks are instructions to the shell to execute and append the output of the enclosed command. ` (backticks) is located on the upper side of ‘tab’ key 8 9 Event • A message emitted by the X Window system • When a user performs some action, it’s sent to your application Signal • Reaction to an event • Emitted by a GtkObject Callback function • Run a function by a signal 10 gulong g_signal_connect ( gpointer object, const gchar *signal_name, GCallback handler, gpointer data); static void callback_function ( GtkWidget *widget, gpointer data); 11 #include <gtk/gtk.h> void destroy(GtkWidget *widget, gpointer data) { gtk_main_quit(); } int main(int argc, char *argv[]) { GtkWidget *window; gtk_init(&argc, &argv); window = gtk_window_new(GTK_WINDOW_TOPLEVEL); gtk_window_set_title(GTK_WINDOW(window), "Hello World!"); gtk_widget_show (window); /* Connect the main window to the destroy */ g_signal_connect(G_OBJECT(window), "destroy", G_CALLBACK(destroy), NULL); gtk_widget_show(window); gtk_main(); return 0; } 12 13 Basic building blocks of a GUI application Window widget • Basic element of all GTK+ application.
    [Show full text]