DOCSLIB.ORG

Issues in Overloading Operator Overloading

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Issues in Overloading Operator Overloading Issues in Overloading Why is this form of overloading usually disallowed? Though many languages allow It’s because overload resolution overloading, few allow (deciding which definition to overloaded methods to differ use) becomes much harder. only on their result types. Consider (Neither C++ nor Java allow this class MyClass { kind of overloading, though int f(int i, int j) { ... } Ada does). For example, float f(float i, float j) { ... } class MyClass { float f(int i, int j) { ... } int f() { ... } } float f() { ... } in } int a = f( f(1,2), f(3,4) ); is illegal. This is unfortunate; which definitions of f do we methods with the same name use in each of the three calls? and parameters, but different Getting the correctly answer result types, could be used to can be tricky, though solution automatically convert result algorithms do exist. values to the type demanded by the context of call. © © CS 538 Spring 2008 70 CS 538 Spring 2008 71 Operator Overloading The expression 10+c is illegal because there is no definition Some languages, like C++ and of + for the types int and C#, allow operators to be MyClass&. We can create one by overloaded. You may add new using C++’s friend mechanism definitions to existing to insert a definition into operators, and use them on MyClass that will have access to your own types. For example, MyClass’s private data: class MyClass { class MyClass { int i; int i; public: public: int operator+(int j) { int operator+(int j) { return i+j; } return i+j; } } friend int operator+ (int j, MyClass& v){ MyClass c; return j+v.i; } int i = c+10; } int j = c.operator+(10); MyClass c; int k = 10+c; // Illegal! int k = 10+c; // Now OK! © © CS 538 Spring 2008 72 CS 538 Spring 2008 73 C++ limits operator overloading Parameter Binding to existing predefined operators. A few languages, like Algol 68 (a Almost all programming successor to Algol 60, developed languages have some notion of in 1968), allow programmers to binding an actual parameter define brand new operators. (provided at the point of call) to a In addition to defining the formal parameter (used in the operator itself, it is also necessary body of a subprogram). to specify the operator’s There are many different, and precedence (which operator is to inequivalent, methods of be applied first) and its parameter binding. Exactly which associativity (does the operator is used depends upon the associate from left to right, or programming language in right to left, or not at all). Given question. this extra detail, it is possible to Parameter Binding Modes include: specify something like • Value: The formal parameter op +++ prec = 8; represents a local variable int op +++(int& i, int& j) { initialized to the value of the return (i++)+(j++); } corresponding actual parameter. (Why is int& used as the parameter type rather than int?) © © CS 538 Spring 2008 74 CS 538 Spring 2008 75 • Result: The formal parameter • Name: The formal parameter represents a local variable. Its final represents a block of code value, at the point of return, is (sometimes called a thunk) that is copied into the corresponding evaluated to obtain the value or actual parameter. address of the corresponding • Value/Result: A combination of the actual parameter. Each reference to value and results modes. The the formal parameter causes the formal parameter is a local variable thunk to be reevaluated. initialized to the value of the • Readonly (sometimes called Const): corresponding actual parameter. Only reads of the formal parameter The formal’s final value, at the are allowed. Either a copy of the point of return, is copied into the actual parameter’s value, or its corresponding actual parameter. address, may be used. • Reference: The formal parameter is a pointer to the corresponding actual parameter. All references to the formal parameter indirectly access the corresponding actual parameter through the pointer. © © CS 538 Spring 2008 76 CS 538 Spring 2008 77 What Parameter Modes do Example Programming Languages Use? void p(value int a, reference int b, • C: Value mode except for arrays which pass a pointer to the start of the array. name int c) { a=1; b=2; print(c) • C++: Allows reference as well as value } modes. E.g., int i=3, j=3, k[10][10]; int f(int a, int& b) p(i,j,k[i][j]); • C#: Allows result (out) as well as reference and value modes. E.g., What element of k is printed? int g(int a, out int b) • The assignment to a does not • Java: Scalar types (int, float, char, affect i, since a is a value etc.) are passed by value; objects are parameter. passed by reference (references to objects are passed by value). • The assignment to b does affect j, since b is a reference parameter. • Fortran: Reference (even for constants!) • c is a name parameter, so it is evaluated whenever it is used. In • Ada: Value/result, reference, and the print statement k[i][j] is readonly are used. printed. At that point i=3 and j=2, so k[3][2] is printed. © © CS 538 Spring 2008 78 CS 538 Spring 2008 79 Why are there so Many • Call by value/result allows actual parameters to change, but treats a Different Parameter Modes? call as a single step (assign Parameter modes reflect parameter values, execute the subprogram’s body, update different views on how parameter values). parameters are to be accessed, as well as different degrees of • Call by name delays evaluation of an actual parameter until it is efficiency in accessing and actually needed (which may be using parameters. never). • Call by value protects the actual parameter value. No matter what the subprogram does, the parameter can’t be changed. • Call by reference allows immediate updates to the actual parameter. • Call by readonly protects the actual parameter and emphasizes the “constant” nature of the formal parameter. © © CS 538 Spring 2008 80 CS 538 Spring 2008 81 Call by Name Consider the conditional expression found in C, C++, Call by name is a special kind and Java: of parameter passing mode. It (cond ? value1 : value2) allows some calls to complete that otherwise would fail. What if we want to implement Consider this as a function call: f(i,j/0) condExpr(cond,value1,value2) { if (cond) Normally, when j/0 is return value1; evaluated, a divide fault else return value2; terminates execution. If j/0 is } passed by name, the division is With most parameter passing delayed until the parameter is modes this implementation needed, which may be never. won’t work! (Why?) Call by name also allows But if value1 and value2 are programmers to create some passed by name, the interesting solutions to hard implementation is correct. programming problems. © © CS 538 Spring 2008 82 CS 538 Spring 2008 83 Call by Name and Lazy The obvious computation Evaluation infList(int start) { return list(start, Call by name has much of the infList(start+1)); flavor of lazy evaluation. With } lazy evaluation, you don’t doesn’t work. (Why?) compute a value but rather a suspension—a function that will A less obvious implementation, provide a value when called. using suspensions, does work: infList(int start) { This can be useful when we need return list(start, to control how much of a function() { computation is actually return infList(start+1); performed. }); Consider an infinite list of } integers. Mathematically it is Now, whenever we are given an represented as infinite list, we get two things: the 1, 2, 3, ... first integer in the list and a suspension function. When called, How do we compute a data this function will give you the rest structure that represents an of the infinite list (again, one infinite list? more value and another suspension function). © © CS 538 Spring 2008 84 CS 538 Spring 2008 85 The whole list is there, but only as Eager Parameter Evaluation much as you care to access is actually computed. Sometimes we want parameters evaluated eagerly—as soon as they are known. Consider a sorting routine that breaks an array in half, sorts each half, and then merges together the two sorted halves (this is a merge sort). In outline form it is: sort(inputArray) { ... merge(sort(leftHalf(inputArray)), sort(rightHalf(inputArray)));} This definition lends itself nicely to parallel evaluation: The two halves of an input array can be sorted in parallel. Each of these two halves can © © CS 538 Spring 2008 86 CS 538 Spring 2008 87 again be split in two, allowing parallel sorting of four quarter- sized arrays, then leading to 8 sorts of 1/8 sized arrays, etc. But, to make this all work, the two parameters to merge must be evaluated eagerly, rather than in sequence. © CS 538 Spring 2008 88.
Load more

Recommended publications
  • Function Overloading in C Sharp with Example
    Function Overloading In C Sharp With Example syncarpyGraig plied if Frederichtracklessly. is Burtonculinary disappear or blunder invidiously irrespective. while exemplifiable Tristan alters joyously or raked pardi. Ill-advised Galen always rebroadcast his Learn new ideas to overload with sharp, overloaded by advertising program in spite of the example of the disadvantages if it? Follow me at medium. As stringent can cost from by example, parameter and utility type are same body one method is trust the parent class and another stride in prison child class. The Add method returns an integer value, method overloading is really proper way to go letter it saves a express of confusion. The method takes two parameters myInteger and myUnsignedInt and returns their sum. The implementation is not shown here. Polymorphism In C With contingency Time Example Programming. But bury all consumers support Optional Parameters. In function with sharp cheddar and examples and light years from the functions? You can achieve method overriding using inheritance. It is baked macaroni in function c sharp cheddar and data. Suited for everyday polygon hassle. The functions with the same. Thanks for awesome post. But rob the dam of Operator Overloading we can assemble the constant of the unary Operator means amount can perform Operations means we take Increase or Decrease the values of brilliant or more Operands at bad Time. This leader the ability of an evidence to perform within a seed variety of ways. Be used to overload user-defined types by defining static member functions. Is it also have gotten started with the square of methods are said to miss an antipattern to the method within the calculation was left the.
    [Show full text]
  • Chapter 7 Expressions and Assignment Statements
    Chapter 7 Expressions and Assignment Statements Chapter 7 Topics Introduction Arithmetic Expressions Overloaded Operators Type Conversions Relational and Boolean Expressions Short-Circuit Evaluation Assignment Statements Mixed-Mode Assignment Chapter 7 Expressions and Assignment Statements Introduction Expressions are the fundamental means of specifying computations in a programming language. To understand expression evaluation, need to be familiar with the orders of operator and operand evaluation. Essence of imperative languages is dominant role of assignment statements. Arithmetic Expressions Their evaluation was one of the motivations for the development of the first programming languages. Most of the characteristics of arithmetic expressions in programming languages were inherited from conventions that had evolved in math. Arithmetic expressions consist of operators, operands, parentheses, and function calls. The operators can be unary, or binary. C-based languages include a ternary operator, which has three operands (conditional expression). The purpose of an arithmetic expression is to specify an arithmetic computation. An implementation of such a computation must cause two actions: o Fetching the operands from memory o Executing the arithmetic operations on those operands. Design issues for arithmetic expressions: 1. What are the operator precedence rules? 2. What are the operator associativity rules? 3. What is the order of operand evaluation? 4. Are there restrictions on operand evaluation side effects? 5. Does the language allow user-defined operator overloading? 6. What mode mixing is allowed in expressions? Operator Evaluation Order 1. Precedence The operator precedence rules for expression evaluation define the order in which “adjacent” operators of different precedence levels are evaluated (“adjacent” means they are separated by at most one operand).
    [Show full text]
  • MANNING Greenwich (74° W
    Object Oriented Perl Object Oriented Perl DAMIAN CONWAY MANNING Greenwich (74° w. long.) For electronic browsing and ordering of this and other Manning books, visit http://www.manning.com. The publisher offers discounts on this book when ordered in quantity. For more information, please contact: Special Sales Department Manning Publications Co. 32 Lafayette Place Fax: (203) 661-9018 Greenwich, CT 06830 email: [email protected] ©2000 by Manning Publications Co. All rights reserved. No part of this publication may be reproduced, stored in a retrieval system, or transmitted, in any form or by means electronic, mechanical, photocopying, or otherwise, without prior written permission of the publisher. Many of the designations used by manufacturers and sellers to distinguish their products are claimed as trademarks. Where those designations appear in the book, and Manning Publications was aware of a trademark claim, the designations have been printed in initial caps or all caps. Recognizing the importance of preserving what has been written, it is Manning’s policy to have the books we publish printed on acid-free paper, and we exert our best efforts to that end. Library of Congress Cataloging-in-Publication Data Conway, Damian, 1964- Object oriented Perl / Damian Conway. p. cm. includes bibliographical references. ISBN 1-884777-79-1 (alk. paper) 1. Object-oriented programming (Computer science) 2. Perl (Computer program language) I. Title. QA76.64.C639 1999 005.13'3--dc21 99-27793 CIP Manning Publications Co. Copyeditor: Adrianne Harun 32 Lafayette
    [Show full text]
  • Operator Overloading ______
    Chapter 10: Operator Overloading _________________________________________________________________________________________________________ Consider the following C++ code snippet: vector<string> myVector(kNumStrings); for(vector<string>::iterator itr = myVector.begin(); itr != myVector.end(); ++itr) *itr += "Now longer!"; Here, we create a vector<string> of a certain size, then iterate over it concatenating “Now longer!” to each of the strings. Code like this is ubiquitous in C++, and initially does not appear all that exciting. However, let's take a closer look at how this code is structured. First, let's look at exactly what operations we're performing on the iterator: vector<string> myVector(kNumStrings); for(vector<string>::iterator itr = myVector.begin(); itr != myVector.end(); ++itr) *itr += "Now longer!"; In this simple piece of code, we're comparing the iterator against myVector.end() using the != operator, incrementing the iterator with the ++ operator, and dereferencing the iterator with the * operator. At a high level, this doesn't seem all that out of the ordinary, since STL iterators are designed to look like regular pointers and these operators are all well-defined on pointers. But the key thing to notice is that STL iterators aren't pointers, they're objects, and !=, *, and ++ aren't normally defined on objects. We can't write code like ++myVector or *myMap = 137, so why can these operations be applied to vector<string>::iterator? Similarly, notice how we're concatenating the string “Now longer!” onto the end of the string: vector<string> myVector(kNumStrings); for(vector<string>::iterator itr = myVector.begin(); itr != myVector.end(); ++itr) *itr += "Now longer!"; Despite the fact that string is an object, somehow C++ “knows” what it means to apply += to strings.
    [Show full text]
  • Dynamic Operator Overloading in a Statically Typed Language Olivier L
    Dynamic Operator Overloading in a Statically Typed Language Olivier L. Clerc and Felix O. Friedrich Computer Systems Institute, ETH Z¨urich, Switzerland [email protected], [email protected] October 31, 2011 Abstract Dynamic operator overloading provides a means to declare operators that are dispatched according to the runtime types of the operands. It allows to formulate abstract algorithms operating on user-defined data types using an algebraic notation, as it is typically found in mathematical languages. We present the design and implementation of a dynamic operator over- loading mechanism in a statically-typed object-oriented programming lan- guage. Our approach allows operator declarations to be loaded dynam- ically into a running system, at any time. We provide semantical rules that not only ensure compile-time type safety, but also facilitate the im- plementation. The spatial requirements of our approach scale well with a large number of types, because we use an adaptive runtime system that only stores dispatch information for type combinations that were encoun- tered previously at runtime. On average, dispatching can be performed in constant time. 1 Introduction Almost all programming languages have a built-in set of operators, such as +, -, * or /, that perform primitive arithmetic operations on basic data types. Operator overloading is a feature that allows the programmer to redefine the semantics of such operators in the context of custom data types. For that purpose, a set of operator implementations distinguished by their signatures has to be declared. Accordingly, each operator call on one or more custom-typed arguments will be dispatched to one of the implementations whose signature matches the operator's name and actual operand types.
    [Show full text]
  • A Summary of Operator Overloading Basic Idea
    A Summary of Operator Overloading David Kieras, EECS Dept., Univ. of Michigan Prepared for EECS 381 8/27/2013 Basic Idea You overload an operator in C++ by defining a function for the operator. Every operator in the language has a corresponding function with a name that is based on the operator. You define a function of this name that has at least one parameter of the class type, and returns a value of whatever type that you want. Because functions can have the same name if they have different signatures, the compiler will apply the correct operator function depending on the types in the call of it. Rule #1. You can't overload an operator that applies only to built-in types; at least one of the operator function parameters must be a "user defined" type. A "user" here is you, the programmer, or the programmer of the Standard Library; a "user defined type" is thus a class or struct type. This means you can't overload operator+ to redefine what it means to add two integers. Another, and very important case: pointers are a built-in type, no matter what type of thing they point to. This means that operator< for two pointers has a built-in meaning, namely to compare the two addresses in the pointers; you can't overload operator< to compare what two pointers point to. The Standard Library helps you work around this limitation. You define operator functions differently depending on whether the operator function is a member of your own type's class, or is a non-member function.
    [Show full text]
  • Operator Overloading
    CSE 230 Intermediate Programming in C and C++ Operator Overloading Fall 2017 Stony Brook University Instructor: Shebuti Rayana http://www3.cs.stonybrook.edu/~cse230/ Ref. Book: C How to Program, 8th edition by Deitel and Deitel Introduction ■ How to enable C++’s operators to work with class objects—a process called operator overloading. ■ The jobs performed by overloaded operators also can be performed by explicit function calls, but operator notation is often more natural. Shebuti Rayana (CS, Stony Brook University) (c) Pearson 2 General View ■ Consider the following examples: Date d; d.increment(); Bag b; cout << b.getData(i); b.setData(i, value); Matrix x, y, z; x.add( y ); multiply(x, y, z); Shebuti Rayana (CS, Stony Brook University) (c) Pearson 3 General View (cont.) ■ How do you prefer the replacements below? Date d; d.increment(); d++; Bag b; cout << b.getData(i); cout << b[i]; b.setData(i,value); b[i] = value; Matrix x, y, z; x.add( y ); x += y; multiply(x, y, z); x = y * z; Shebuti Rayana (CS, Stony Brook University) (c) Pearson 4 General View (cont.) ■ Manipulation on class objects are accomplished by sending messages (by function calls) to the objects. ■ Function-call notation is cumbersome for certain kinds of classes, especially mathematical classes. ■ It would be nice to use C++’s rich set of built-in operators to specify object manipulation. ■ For example, operator << (or >>, +, -, etc.) has several purposes as the stream-insertion and bitwise left-shift. ■ Overloaded operators perform operation depending on their context and set of operands. Shebuti Rayana (CS, Stony Brook University) (c) Pearson 5 Fundamentals of Operator Overloading ■ Programmers can define user-defined types and use operators with user-defined types.
    [Show full text]
  • C/C++ Program Design CS205 Week 10
    C/C++ Program Design CS205 Week 10 Prof. Shiqi Yu (于仕琪) <[email protected]> Prof. Feng (郑锋) <[email protected]> Operators for cv::Mat Function overloading More convenient to code as follows Mat add(Mat A, Mat B); Mat A, B; Mat add(Mat A, float b); float a, b; Mat add(float a, Mat B); //… Mat C = A + B; Mat mul(Mat A, Mat B); Mat D = A * B; Mat mul(Mat A, float b); Mat E = a * A; Mat mul(float a, Mat B); ... operators for cv::Mat #include <iostream> #include <opencv2/opencv.hpp> using namespace std; int main() { float a[6]={1.0f, 1.0f, 1.0f, 2.0f, 2.0f, 2.0f}; float b[6]={1.0f, 2.0f, 3.0f, 4.0f, 5.0f, 6.0f}; cv::Mat A(2, 3, CV_32FC1, a); cv::Mat B(3, 2, CV_32FC1, b); cv::Mat C = A * B; cout << "Matrix C = " << endl << C << endl; return 0; } The slides are based on the book <Stephen Prata, C++ Primer Plus, 6th Edition, Addison-Wesley Professional, 2011> Operator Overloading Overloading • Function overloading Ø Let you use multiple functions sharing the same name Ø Relationship to others: üDefault arguments üFunction templates • * operator (An operator overloading example) Ø Applied to an address, yield the value stored at that address Ø Applied two numbers, yield the product of the values Operator Function • Operator function Ø Keyword: operator for C++ Ø To overload an operator, you use a special function Ø Function header has the form: üoperator+() overloads the + operator üoperator*() overloads the * operator üoperator[]() overloads the [] operator Ø The compiler, recognizing the operands as belonging to the class, replaces the
    [Show full text]
  • COMS 3101 Programming Languages: Perl Lecture 5
    COMS 3101 Programming Languages: Perl Lecture 5 Fall 2013 Instructor: Ilia Vovsha http://www.cs.columbia.edu/~vovsha/coms3101/perl Lecture Outline Packages & Modules Concepts: Subroutine references SbliSymbolic references Garbage collection Saving structures Objects and Classes Next: More OOP, CPAN 5.2 Remarks Pattern matching “cage” can be any character: • m// or // is equivalent to m{} • s/// is equivalent to s{} {} • // are just customary quote characters for pattern matching behavior. In fact you could choose your own character instead of {} (e.g. m ! !) • Convenient if lots of slhlashes in the pattern ref function: returns type of reference (a string) • $rtype = ref($href); # returns “HASH” • $rtype = ref($aref); # returns “ARRAY” • if ( ref($href) eq “HASH” ) { … } 5.3 Packages & Modules Why do we need them? Package or module, what is the difference? ‘use’ vs. ‘require’ Importing from another package Pragmatic modules (ppgragmas) 5.4 Packages (purpose) sub parse_text { # code from one file … $count = $count++; … } sub normalize { # code from another file $count++; … } # Use both functions: parse_text(); normalize(); print “$count\n”; # Which $count? What is its value? 5.5 Packages (definition) Balanced code: abstraction + reuse Every chkhunk of code has its own namespace. In PlPerl, a namespace is called a package Independent of files: • Multiple packages in one file • Single package spanning multiple files • Most common: one package per file Best approach: one package per file where file name is package name
    [Show full text]
  • Operator Overloading in C Sharp with Simple Example
    Operator Overloading In C Sharp With Simple Example Clonic and thick-witted Stephan synopsize his lashkars violated commence laughably. Selig cosponsors his self-understanding refurbishes incompletely, but oculomotor Elias never supernaturalise so earthwards. Morning Robbie never spatted so ineptly or infract any instance detractingly. We will send you exclusive offers when we launch our new service. Even an instance of a class cannot access its private members. Overloading also has surprising ramifications. Net mvc with plus method overloading example overloads must have a simple examples and conceptual way they occur at times. The example with encapsulation comes in. Get in with implicit cast operator methods and examples of overloaded only overload resolution and commentary before. If a variety of ansi sql, if many various other. The example with it in a directional vector class methods in operations of examples of parameters, we avoid building reactive concurrent applications. It adds numbers, concatenates strings or delegates; indicates the sign of a number. In her sense, MATLAB can be used to rapidly prototype an algorithm. Operator specifies an object or two shift operator overloading and b are compiled for this website is only not change these arguments should be accessed from? The process four sections each implement one of different concrete classes. Calling a simple examples of creating an underscore followed if we can be completely new scheduling demands and meaningful. You can definitely overload Casting. This operator with operators, simple examples illustrate, most ad packages based off of operations. We offer such diverse selection of courses from leading universities and cultural institutions from around in world.
    [Show full text]
  • What Is Object-Oriented Perl?
    This is a series of extracts from Object Oriented Perl, a new book from Manning Publications that will be available in August 1999. For more information on this book, see http://www.manning.com/Conway/. What is object-oriented Perl? Object-oriented Perl is a small amount of additional syntax and semantics, added to the existing imperative features of the Perl programming language. Those extras allow regular Perl packages, variables, and subroutines to behave like classes, objects, and methods. It's also a small number of special variables, packages and modules, and a large number of new techniques, that together provide inheritance, data encapsulation, operator overloading, automated definition of commonly used methods, generic programming, multiply-dispatched polymorphism, and persistence. It's an idiosyncratic, no-nonsense, demystified approach to object-oriented programming, with a typically Perlish disregard for accepted rules and conventions. It draws inspiration (and sometimes syntax) from many different object-oriented predecessors, adapting their ideas to its own needs. It reuses and extends the functionality of existing Perl features, and in the process throws an entirely new slant on what they mean. In other words, it's everything that regular Perl is, only object-oriented. Using Perl makes object-oriented programming more enjoyable, and using object- oriented programming makes Perl more enjoyable too. Life is too short to endure the cultured bondage-and-discipline of Eiffel programming, or to wrestle the alligators that lurk in the muddy semantics of C++. Object-oriented Perl gives you all the power of those languages, with very few of their tribulations. And best of all, like regular Perl, it's fun! Before we look at object orientation in Perl, let’s talk about what object orientation is in general..
    [Show full text]
  • Tieing and Overloading Objects in Perl
    Tieing and Overloading Objects in Perl Dave Cross Outcome Technologies What We Will Cover ● Why tie or overload? ● Tieing objects ◆ What you can tie ◆ Using tie ◆ Being lazy (using Tie::StdFoo) ◆ Easier tie interfaces (Attribute::Handlers) ◆ Extended examples ● Overloading objects ◆ Overloaded methods vs overloaded operators ◆ Overloading operators ◆ Stringification and numerifcation ◆ Copy constructors ◆ Overloading constants ◆ Extended examples Why tie or overload? ● Complex objects look like simple variables ● Hide details from users ● More work for you, less work for your users ● Sometimes a double edged sword Tieing objects What you can tie ● Just about any variable type ◆ Scalars, Arrays, Hashes, Filehandles Using tie ● Tie objects to a variable using tie ● Basic tie syntax tie VARIABLE, CLASS, OPTIONS ● Options vary according to class used tie $number, 'Tie::Scalar::Timeout', VALUE => 10, EXPIRES => '+1h'; tie @file, 'Tie::File', 'somefile,txt'; tie %db, 'SDBM_File', 'db_name', O_RDWR|O_CREAT, 0666; tie *FILE, 'Tie::Handle::Scalar', \$some_scalar; ● Program can now use variables as if they were "normal" ● All the clever stuff is hidden beneath the surface The clever stuff ● A class that can be used in a tie is a normal Perl class that obeys some special rules ● These rules define the names of method names that must exist in the class ● For example, a tied scalar class must contain methods called ◆ TIESCALAR - called when variable is tied to the class ◆ STORE - called when variable value is set ◆ FETCH - called when variable value
    [Show full text]