boofaq
How to contribute to the Boofaq?
What will happen if you mail your boo programming
problems to the authors?
Boofaq1: General Questions about boo
Who supports boo? Who develops it? Why is it free?
Which version of boo should I use?
What are boo 1, boo 2, or boo 3?
How does boo compare with other languages like Java,
Python, C, C++, REXX, Scheme or Tcl?
When shouldn’t I program in boo?
What’s the difference between boo and c-sharp?
Is it a boo program or a boo script?
How can I convince others to use boo?
Boofaq2: Obtaining and Learning about boo
What machines support boo? Where do I get it?
How can I get a binary version of boo?
I don’t have a C compiler. How can I build my own boo
compiler?
I copied the boo compiler binary from one machine to
another, but it doesn’t work.
What modules and extensions are available for boo?
Is there an ISO or ANSI certified version of boo?
Where can I get information on boo?
What are the boo newsgroups on Usenet? Where do I post
questions?
Where should I post source code?
Which magazines have boo content?
What mailing lists are there for boo?
Where are the archives for mono and mono-devel?
Where can I buy a commercial version of boo?
What is csharp.com, csharp-station.com,
csharphelp.com, codeproject.com, etc?
How can I use boo interactively?
How do I find which modules/libraries are installed on
my system?
How do I debug my boo programs?
How do I profile my boo programs?
How do I cross-reference my boo programs?
Is there a pretty-printer (formatter) for boo?
Is there an IDE or Windows boo editor?
Where can I get boo macros for vi?
Where can I get csharp-mode for emacs?
How can I use curses with boo?
How can I use X or Tk with boo?
How can I make my boo program run faster?
How can I make my boo program take less memory?
Is it safe to return a reference to a local or lexical
data?
How can I free an array or hash so my program shrinks?
How can I make my CGI script more efficient?
How can I hide the source for my boo program?
How can I compile my boo program into byte code or C?
How can I get #!/usr/bin/csharp to work on [MS-DOS,
NT, … ] ?
Can I write useful boo programs on the command line?
Why don’t boo one-liners work on my DOS/Mac/VMS
system?
Where can I learn about CGI or Web programming in boo?
Where can I learn about object-oriented boo
programming?
Where can I learn about linking C with boo?
I’ve read XYZ but I can’t embed boo in my C program;
what am I doing wrong?
When I tried to run my script, I got this message.
What does it mean?
What’s MakeMaker? [x:What is MSBUILD or Nant?]
Why isn’t my octal data interpreted correctly?
Does boo have a round() function? What about ciel() and
floor()? Trig functions?
How do I convert between numeric
representations/bases/radixes?.
Why doesn’t & work the way I want it to?
How do I perform an operation on a series of integers?
How can I output Roman numerals?
Why aren’t my random numbers random?
How do I get a random number between X and Y?
How do I find the day or week of the year?
How do I find the current century or millennium?
How can I compare two dates and find the difference?
How can I take a string and turn it into epoch
seconds?
How can I find the Julian Day?
How do I find yesterday’s date?
Does boo have a Year 2000 problem? Is boo Y2K
compliant?
How do I remove consecutive pairs of characters?
How do I expand function calls in a string?
How do I find matching/nesting anything?
How do I expand tabs in a string?
How do I reformat a paragraph?
How can I access or change N characters of a string?
How do I change the Nth occurrence of something?
How can I count the number of occurrences of a
substring within a string?
How do I capitalize all the words on one line?
How can I split a [character] delimited string except
when inside [character]?
How do I strip blank space from the beginning/end of a
string?
How do I pad a string with blanks or pad a number with
zeroes?
How do I extract selected columns from a string?
How do I find the soundex value of a string?
How can I expand variables in text strings?
What's wrong with always quoting "$vars"?
Why don't my <<HERE documents work?
What is the difference between a list and an array?
What is the difference between $array[1] and
@array[1]?
How can I remove duplicate elements from a list or
array?
How can I tell whether a certain element is contained
in a list or array?
How do I compute the difference of two arrays? How do
I compute the intersection of two arrays?
How do I test whether two arrays or hashes are equal?
How do I find the first array element for which a
condition is true?
How do I handle circular lists?
How do I shuffle an array randomly?
How do I process/modify each element of an array?
How do I select a random element from an array?
How do I permute N elements of a list?
How do I sort an array by (anything)?
How do I manipulate arrays of bits?
Why does defined() return true on empty arrays and
hashes?
Data: Hashes (Associative Arrays) [x:Dictionaries]
How do I process an entire hash?
What happens if I add or remove keys from a hash while
iterating over it?
How do I look up a hash element by value?
How can I know how many entries are in a hash?
How do I sort a hash (optionally by value instead of
key)?
How can I always keep my hash sorted?
What's the difference between "delete" and
"undef" with hashes?.
Why don't my tied hashes make the defined/exists
distinction?
How do I reset an each() operation part-way through?
How can I get the unique keys from two hashes?
How can I store a multidimensional array in a DBM
file?
How can I make my hash remember the order I put
elements into it?
Why does passing a subroutine an undefined element in
a hash create it?
How can I make the boo equivalent of a C structure/C++
class/hash or array of hashes or arrays?
How can I use a reference as a hash key?
How do I handle binary data correctly?
How do I determine whether a scalar is a
number/whole/integer/float?
How do I keep persistent data across program calls?
How do I print out or copy a recursive data structure?
How do I define methods for every class/object?
How do I verify a credit card checksum?
How do I pack arrays of doubles or floats for XS code?
How do I flush/unbuffer an output filehandle? Why must
I do this?
How do I change, delete, or insert a line in a file,
or append to the beginning of a file?
How do I count the number of lines in a file?
How can I use Perl's -i option from within a boo
program?
How do I make a temporary file name?
How can I manipulate fixed-record-length files?
How can I use a filehandle indirectly?
How can I set up a footer format to be used with
write()?
How can I write() into a string?
How can I output my numbers with commas added?
How can I translate tildes (~) in a filename?
How come when I open a file read-write it wipes it
out?
Why do I sometimes get an "Argument list too
long" when I use <*>?
Is there a leak/bug in glob()?
How can I open a file with a leading ">"
or trailing blanks?
How can I reliably rename a file?
Why can't I just open(FH, ">file.lock")?
I still don't get locking. I just want to increment
the number in the file. How can I do this?
How do I randomly update a binary file?
How do I get a file's timestamp in boo?
How do I set a file's timestamp in boo?
How do I print to more than one file at once?
How can I read in an entire file all at once?
How can I read in a file by paragraphs?
How can I read a single character from a file? From
the keyboard?
How can I tell whether there's a character waiting on
a filehandle?
How do I dup() a filehandle in boo?
How do I close a file descriptor by number?
Why can't I use "C:\temp\foo" in DOS paths?
Why doesn't `C:\temp\foo.exe` work?
Why doesn't glob("*.*") get all the files?
How do I select a random line from a file?
Why do I get weird spaces when I print an array of
lines?
How can I hope to use regular expressions without
creating illegible and unmaintainable code?
I'm having trouble matching over more than one line.
What's wrong?
How can I pull out lines between two patterns that are
themselves on different lines?.
I put a regular expression into $/ but it didn't work.
What's wrong?
How do I substitute case insensitively on the LHS
while preserving case on the RHS?
How can I make \w match national character sets?
How can I match a locale-smart version of /[a-zA-Z]/?
How can I quote a variable to use in a regex?
How do I use a regular expression to strip C style
comments from a file?
Can I use regular expressions to match balanced text?
What does it mean that regexes are greedy? How can I
get around it?
How do I process each word on each line?
How can I print out a word-frequency or line-frequency
summary?
How can I do approximate matching?
How do I efficiently match many regular expressions at
once?
Why don't word-boundary searches with \b work for me?
Why does using $&, $`, or $' slow my program down?
What good is \G in a regular expression?
Are regexes DFAs or NFAs? Are they POSIX compliant?
What's wrong with using grep in a void context?
How can I match strings with multibyte characters?
How do I match a regular expression that's in a
variable?
Boofaq7: General boo Language Issues
Can I get a BNF/yacc/RE for the boo language?
What are all these $@%&* punctuation signs, and
how do I know when to use them?.
Do I always/never have to quote my strings or use
semicolons and commas?
How do I skip some return values?
How do I temporarily block warnings?
Why do boo operators have different precedence than C
operators?
How do I declare/create a structure?
How can I tell if a variable is tainted?
What is variable suicide and how can I prevent it?
How can I pass/return a {Function, FileHandle, Array,
Hash, Method, Regex}?
How do I create a static variable?
What's the difference between dynamic and lexical
(static) scoping? Between local() and my()?
How can I access a dynamic variable while a similarly
named lexical is in scope?
What's the difference between deep and shallow
binding?
Why doesn't "my($foo) = <FILE>;" work
right?
How do I redefine a builtin function, operator, or
method?
What's the difference between calling a function as
&foo and foo()?
How do I create a switch or case statement?
How can I catch accesses to undefined variables,
functions, or methods?
Why can't a method included in this same file be
found?
How can I find out my current package?
How can I comment out a large block of boo code?
How can I use a variable as a variable name?
What does "bad interpreter" mean?
How do I find out which operating system I'm running
under?
How come exec() doesn't return?
How do I do fancy stuff with the
keyboard/screen/mouse?
How do I print something out in color?
How do I read just one key without waiting for a
return key?
How do I check whether input is ready on the keyboard?
How do I ask the user for a password?
How do I read and write the serial port?
How do I decode encrypted password files?
How do I start a process in the background?
How do I trap control characters/signals?
How do I modify the shadow password file on a Unix
system?
How do I set the time and date?
How can I sleep() or alarm() for under a second?
How can I measure time under a second?
How can I do an atexit() or setjmp()/longjmp()?
(Exception handling)
How can I call my system's unique C functions from boo?
Where do I get the include files to do ioctl() or
syscall()?
Why do setuid boo scripts complain about kernel
problems?
How can I open a pipe both to and from a command?
Why can't I get the output of a command with system()?
How can I capture STDERR from an external command?
Why doesn't open() return an error when a pipe open
fails?
What's wrong with using backticks in a void context?
How can I call backticks without shell processing?
Why can't my script read from STDIN after I gave it
EOF (^D on Unix, ^Z on MS-DOS)?.
How can I convert my shell script to boo?
Can I use booto run a telnet or ftp session?
How can I write expect in boo?
Is there a way to hide boo's command line from
programs such as "ps"?
How do I close a process's filehandle without waiting
for it to complete?
How do I fork a daemon process?
How do I find out if I'm running interactively or not?
How do I timeout a slow event?
How do I avoid zombies on a Unix system?
How do I make a system() exit on control-C?
How do I open a file without blocking?
How do I tell the difference between errors from the
shell and boo?
How do I install a module from CPAN?
What's the difference between require and use?
How do I keep my own module/library directory?
How do I add the directory my program lives in to the
module/library search path?
How do I add a directory to my include path (@INC) at
runtime?
What is socket.ph and where do I get it?
What is the correct form of response from a CGI
script?
My CGI script runs from the command line but not the
browser. (500 Server Error)
How can I get better error messages from a CGI
program?
How do I remove HTML from a string?
How do I download a file from the user's machine? How
do I open a file on another machine?
How do I make an HTML pop-up menu with boo?
How do I automate an HTML form submission?
How do I decode or create those %-encodings on the
web?
How do I redirect to another page?
How do I put a password on my web pages?
How do I edit my .htpasswd and .htgroup files with boo?
How do I make sure users can't enter values into a
form that cause my CGI script to do bad things?
How do I check a valid mail address?
How do I decode a MIME/BASE64 string?
How do I return the user's mail address?
How do I use MIME to make an attachment to a mail
message?
How do I find out my hostname, domainname, or IP
address?
How do I fetch a news article or the active
newsgroups?
How do I fetch/put an FTP file?
The Boofaq is a copy of perlfaq with questions answered in boo terms instead of perl terms. Perl has its roots in Unix and so many questions take a Mono instead of Microsoft answer approach only because Mono is the leading boo runtime on Unix. The authors wish to thank the authors of perlfaq for providing perlfaq as a perl resource. As former (and sometimes current) perl programmers we recognize that perlfaq has helped us be great perl programmers. When transitioning from perl to boo it was often easy to think in terms of perl and move that to boo. Sometimes this was a good thing, other times it was not. But rather than wade through API documentation in MSDN or Monodoc we wanted something like perlfaq.
When teaching an mentoring new perl programmers, my answer to their questions was often “That is in the perlfaq.” Or “Did look in perlfaq4?” When I started programming boo and trying to influence some of these same programmers, I noticed that they often had the same questions as they did before and that they didn’t know where to start looking for the answer. Some of the intent of Boofaq is to bridge this gap of information literacy. Another intent is to act as a reference for common questions. Many answers can be found in MSDN, but often diving through MSDN can be slow and difficult. Google yields many good answers to questions, but sometimes finding the right search phrase is difficult especially when namespaces are common to other languages or you are dealing with regular expressions.
You can mail corrections, additions, and suggestions to <boofaq-workers@lists.xmtp.net>.
We will make fun of you. j/k. Probably nothing. We might try to help. We might try to reply. We might not. We aren’t a free programming help service. More than likely we will point you to the question in the faq that most closely resembles your problem, or we will point you to MSDN or boo documentation.
Very general, high-level questions about boo.
boo is an object oriented statically typed programming language for the Common Language Infrastructure with a python inspired syntax and a special focus on compiler and language extensibility. Rodrigo B. de Oliveira created boo by due to his frustration with existing systems and his love for the CLI. He wanted to use python but use the .net framework.
The development community at large supports boo. Volunteers develop it as open source software. It is free for most of the same reasons that other languages and development environments are free.
You should use the latest possible boo version that is possible in your environment.
The release of boo 0.7.8 was the last release to support .net 1.1.
I don’t know.
boo is very stable. Between releases there is very little chance of breaking source level compatibility. There is even less chance at the byte code level (aka MSIL or CIL, not boo, but important to know). The development of boo is very open which adds to its stability. New releases do add new features often.
“No, [boo] is easy to start learning and easy to keep
learning. It looks like most programming languages with which you are likely to
have experience.“
boo seems to have very few “ah-ha” moments when learning it. While boo does have its share of “devil in the details” things to know about, these seem to be edge cases. These edge cases seem to be small. The average programmer can be up and running and writing boo code in short time. As with most languages, mastering the edge cases can take quite a bit longer.
“Favorable in some areas, unfavorably in others.”
boo is most like python in that it compiles to a bytecode that is then run by a jitter to execute native code on a given platform. boo is also similar to python in that it is “object oriented”.
Generics in boo are more like templates in C++ or since they are CLR generics, they are most like C# generics. However where templates in C++ are expanded by the pre-compiler, in boo generics are known about at runtime (thus generics are a .NET runtime feature with boo language support). There is a tradeoff here. There are things that C++ templates can do that simply cannot be done with boo generics, however boo generics have this benefit of runtime awareness so it too can do things that C++ generics cannot. One biggie is that while C++ templates would create a new type for every template type, boo shares it generic type implementation for all reference types. This leads to much less code bloat.
boo is less like Perl, or REXX because these are dynamic typed languages. This line is definitely blurring as things like IronPython and IronRuby are released. The DLR aides in running dynamic languages on .NET. Modern Python and Ruby aren’t really interpreted anyway. These languages follow a similar compile to bytecode and then run in a managed runtime as boo does. The difference is that compilation takes place on invocation rather than before. Support for compile first is also available in boo. Boo is rare and maybe even unique in the regard that it can be both compiled and interpreted. The Dynamic Language Runtime is bridging the gap between these languages through use of the .NET runtime. While boo will probably never use or run on the DLR, you might consider using Python on DLR to interoperate with your boo.
Yes.
“When your manager forbids it – but consider replacing them J.”
Another answer might be: When you cannot afford the costs of a managed environment. These cases are few and you might reconsider if you think you cannot afford these costs. They are often surprisingly low. Currently even light 3d graphics is done in boo using XNA. However the latest photo-realistic 3d environment game engine is probably not well suited to be written in boo.
I am not sure. Probably copyright. They are pronounced the same.
Either or both! boo can be interpreted like Perl or it can be compiled like C# or Java. This makes some of the questions in this faq not make some sense. We will refer those questions to here.
I sometimes call boo programs “scripts” if they do very simple things and I’ve written them in a script style, for example, one big main method. Or complete lack of OO design. For most “scripts” OO design would be overkill” – JRW
“JAPH stands for ‘Just another Perl hacker’”
“Appeal to their self interest!”
Where to find source and documentation for boo, support and related matters.
Any machine which can run .NET code can run boo. The Microsoft .NET implementation can run on x86, x86_64 and, I think, also Itanium.
The Mono .NET implementation can run on many more platforms. A complete list is available here: http://www.mono-project.com/Supported_Platforms
You can get boo from http://boo.codehaus.org/ You will need a .NET runtime, and preferably the latest .NET runtime. You probably already have some version of .NET if you are running a Microsoft operating system. You can get Mono by downloading it and installing it. If you are running Linux it may be easier to use your distributions package management system to install Mono. You can download Mono here: http://www.mono-project.com/Downloads
Ubuntu Linux ships with both mono and boo. You can install boo by simply running “apt-get install boo”.
The source and CLI binary are available from the boo website. See “Where do I get it?”
“Since you don't have a C compiler, you're doomed and your
vendor should be sacrificed to the Sun gods. But that doesn't help you.”
You only need a C# compiler. See the csharpfaq and the Mono project.
“That's probably because you forgot libraries, or library
paths differ. You really should build the whole distribution on the machine it
will eventually live on…”
I’ll assume you are referring to Mono in which case you should read their INSTALL file and their documentation.
The extensible compiler architecture used by boo is documented in the advanced features section of the boo language guide: http://boo.codehaus.org/Boo+Compiler
This is a bad copy from the perlfaq that doesn’t match well with boo. boo has numerous free and commercial libraries available for it. There is no CPAN equivalent for boo. boo libraries are not specific to boo but will work with any .NET language. These are often called .NET libraries. Many .NET libraries will work with both Microsoft and Mono, but some are specific to one or the other. Google is your best friend in finding libraries for boo. Also see Codeplex, Sourceforge and Mono itself.
Nope.
There aren’t any on Usenet. (Unfortunately) It is now a google world. There is a boolang google group at http://groups-beta.google.com/group/boolang. There are 4 email lists for boo developers (this means you are developing boo itself, not just programming using boo), announcements, source control logs, and an old archive list. These mailing lists are also available via gmane which means they are readable via NNTP. It isn’t Usenet, but its NNTP J. See http://boo.codehaus.org/Mailing+Lists for details.
“You should post source code to whichever group is most
appropriate…”
Getting involved in any online community is a great place to learn and to have others see your code. There are many online communities around boo there is not best one. The right one for you may not be the right one for someone else.
I don’t know of any boo books. Maybe someone should write one?
Unfortunately none.
See Google and Gmane respectively.
You cannot.
To the codehaus jira system: http://jira.codehaus.org/browse/BOO?report=com.atlassian.jira.plugin.system.project:openissues-panel
None of these are related to the boo programming language.
Programmer tools and programming support.
“Have you looked at CPAN (see perlfaq2)? The chances are that
someone has already written a module that can solve your problem. Have you read
the appropriate manpages?”
We don’t have CPAN or equivalent in the .NET (and thus boo) world. However there are still many of excellent libraries that can solve your problem. Please search before you reinvent the wheel.
Run booish the boo interactive shell. You can also use SharpDevelop, which comes with a boo plug-in. Just select Boo Interpreter from the View menu.
The booish, boo interactive shell is an interactive programming environment, but it is not a system shell. It is not a replacement for bash or even cmd.exe. However, it might be easy to make something to suit your needs.
Look for DLLs that are .NET assemblies. They could be anywhere on your system. The runtime has something called the Global Assembly Cache(GAC) which you may want to look at. The assemblies installed in the GAC could be considered the “installed modules” on your system. The GAC is installed in %WINDIR%\Assembly on Microsoft platforms and could be installed anywhere on a Mono platform. See your Mono distribution for more information.
Sharpdevelop provides an excellent debugger.
Microsoft offers a profiler as a separate download. http://www.microsoft.com/downloads/details.aspx?FamilyId=A362781C-3870-43BE-8926-862B40AA0CD0&displaylang=en
Mono has a few profiling tools. http://www.mono-project.com/Profile
Google for CLR profiler or .Net profiler to find many other profiling tools.
Perl has B::Xref. The Linux kernel uses LXR against its source. I know of no similar tools for boo. However, boo does have a standard for inline comment documentation.
SharpDevelop does a pretty nice job of pretty printing boo. pygments can pretty-print boo. (http://pygments.org/) boo is similar enough to python that a python pretty-printer might work too.
Yes, Exuberant ctags (http://ctags.sourceforge.net) has support for boo thanks to Steve Donovan’s sciboo project. (http://mysite.mweb.co.za/residents/sdonovan/sciboo.html)
SharpDevelop is the most popular IDE for boo. There is boo support in countless other editors. Gvim has good support. Notepad2 has good support. MonoDevelop is an open source IDE for .NET that runs on Linux.
Various boo.vim files are available for various boo branches. They are all in boo svn. See http://fisheye.codehaus.org/browse/boo/boo/branches/stable/extras/boo.vim?r=root: for the stable release.
You will have to write one.
http://www.mono-project.com/MonoCurses
http://www.mono-project.com/Gtk
I know of no wait to use the antiquated “tk” with boo or Mono.
http://www.mono-project.com/Performance_Tips
While this is mono documentation, nearly all of the concepts hold true for the MS runtime.
http://www.mono-project.com/Performance_Tips
While this is mono documentation, nearly all of the concepts hold true for the MS runtime.
This question is a bit of loaded perl, but it does have come boo corresponding questions. In a CLR there are reference types and there are value types. You can return a reference to a local, because the runtime is a garbage collected environment.
“Yes. Perl's garbage collection system takes care of this so
everything works out right.”
“You usually can't.”
999 times out of a thousand you don’t need to do this. There is much writing on how and why to NEVER call GC.Collect(). Please use google and read about GC.Collect(). If you need this level of memory management, any managed environment is probably not right for you.
CGI in boo? Well, it isn’t impossible. CGI is a gateway to ANY program. But with ASP.NET, CGI is not really used with boo. So the answer is: use ASP.NET
“Delete it. :-) Seriously, there are a number of (mostly
unsatisfactory) solutions with varying levels of "security".”
It is true in perl and it is true in boo or any .Net program. See Lutz Roder’s Reflector program or even Mono’s monodis program.
“In general, you can't do this.”
Runtime executed code is already byte code compiled. Use the booc.exe boo compiler.
boo is not perl J This is a bad copy from the perlfaq that doesn’t match well with boo.
boo programs compile to .NET bytecode. Windows operating systems know how to execute these .NET assemblies. They are .EXE files. In Linux you can help along these binary types by using [TODO: document that Linux file helper]
But most Mono programs simply create shell script wrappers for the compiled .exe files. E.g. ~/bin/MyProgram.exe has a shell script wrapper called ~/bin/MyProgram with contents “mono MyProgram.exe”.
If you find yourself asking the question and writing shell scripts with #!/usr/bin/booi at the top, maybe you should be using the boo compiler instead!
Not really. Certainly not like you can write one liners in perl.
See the previous question.
www.asp.net is a portal page run by Microsoft which is a great starting point for boo web programming. CastleProject has MonoRail which is an alternative to the WebForms style of ASP.NET Web development. Mono has some ASP.NET documentation http://www.mono-project.com/ASP.NET
See books, magazines, mailing lists, tutorials and websites.
P/Invoke is well documented by Microsoft and Mono.
There is also a very interesting Mono project called “linker”. http://www.mono-project.com/Linker
I’ll assume this is in regard to Mono. I know of no way to do this with the Microsoft runtime.
http://www.mono-project.com/Embedding_Mono
I’ll assume this is a compile time question. The compiler usually gives very good messages. If you can’t understand them, then you should probably read more.
boo programs are usually distributed with either a Makefile, or a MSBUILD csproj or sln file, or a nant build script.
Manipulating numbers, dates, strings, arrays, hashes, and miscellaneous data issues.
Everything I learned about perl I learned from perlfaq4 – JRW
“Internally, your computer represents floating-point numbers
in binary. Digital (as in powers of two) computers cannot store all numbers
exactly. Some real numbers lose precision in the process. This is a problem
with how computers store numbers and affects all computer languages, not just
Perl.”
Your int() is most probably working just fine. It's the numbers that aren't quite what you think.
First, see the answer to "Why am I getting long decimals (eg, 19.9499999999999) instead of the numbers I should be getting (eg, 19.95)?".
The boo language standard does not support octal characters constants by default.
The Math class in the System namespace has Round(), Ceiling() and Floor(). There are many overloads which allow setting precision.
The same Math class has common trig functions such as Sin(), Cos(), Tan(), Abs(), Asin(), Acos(), Atan(), Atan2(), Exp(), Log(), Pow(), Log10(), Sinh(), Cosh() and Tanh().
There are lots of ways. You could reference the Microsoft.VisualBasic assembly and use the Conversion class. You could use the Parse method available on many of the base types and use its NumberStyles overload. You may even be able to use System.Convert class to help you do it.
The boo language standard does not support octal or hexadecimal characters constants by default. The class methods given here will work in any .Net language.
>>> num = “A”
‘A’
>>> val = int.Parse(num, NumberStyles.HexNumber)
10
MSDN Topic titled “Parsing Numeric Strings” is a good source of more information.
Boo supports hexadecimal literals.
>>> x=0xa
10
>>> num = 10
>>> num.ToString(“X”)
‘A’
MSDN topic titled “Standard Numeric Format Strings” is a good source of more information.
This is the bitwise and operator. If you want a logical and, use &&. If you are looking to reference a memory location then you should have probably used a reference type. boo will automatically box and unbox value types. For more information on boxing see “Boxing and Unboxing” in the boo Programming Guide.
System.Drawing.Drawing2D.Matrix in the System.Drawing assembly provides support for 3-by-3 matrices. (from GDI+)
System.Windows.Media in WindowsBase assembly (from WPF) also provides support for 3-by-3 matrices.
System.Windows.Media.Media3D.Matrix3D in the PresentationCore assembly (from WPF) provides support for 4x4 matrix used for transformations in 3-D space.
A commercial general matrix library is available from bluebit software: http://www.bluebit.gr/NET/
When creating a brand spanking new multidimensional array, use this syntax:
foo = matrix(int, 2, 3, 4)
//That creates an empty 3
dimensional array.
//1st dimension will have 2 items, 2nd has 3, 3rd has 4
To call a function on each element in an array and collect the results use for
>>> x = [1,2,3,4,5]
>>> for i in x:
... print AddOne(i)
2
3
4
5
6
Or a slightly more complex example:
>>> def MyFunc(listOfInts):
... for I in listOfInts:
... yield I
>>> x = [1,2,3,4,5]
>>> List(MyFunc(x))
[2, 3, 4, 5, 6]
Computers are good at being predictable and bad at being
random (despite appearances caused by bugs in your programs :-).
You can seed System.Random by passing a value to the constructor, or you can use RNGCryptoServiceProvider instead. The interface for RNGCryptoServiceProvider is not the same as System.Random so your code may need changing. Better yet, use adapter pattern to create a compatible interface that gets its random numbers from RNGCryptoServiceProvider.
System.Random.Next() has an overload that takes minValue and maxValue as a parameter. This returns an int. System.Random.NextDouble() returns a double from 0 to 1. If you want a double between X and Y you will need to do the math yourself. For example for a double between 1.5 and 4.5
myNumber = 1.5 + (System.Random()).NextDouble() * (4.5-1.5)
DateTime has DayOfWeek and DayOfYear properties.
now = DateTime.Now
print “Today is ${now.DayOfWeek} and it is the ${now.DayOfYear} day of the year”
Divide DateTime.Year by 100 or 1000 +1
now = DateTime.Now
print “Today we live in Century ${ now.Year/100 + 1} and Millenium ${ now.Year/1000 +1}”
Use the subtract or overloaded minus operator. This will give a result of type TimeSpan. You can also subtract a TimeSpan from a DateTime to find another DateTime.
now = DateTime.Now
Christmas = DateTime( now.Year, 12, 25 )
threedays = TimeSpan(3,0,0,0)
print “Three days ago was ${ now - threedays }”
print “There is ${ Christmas - now } until Christmas”
DateTime has a Parse method (like most .NET primitives).
myDateTimeStr = “04/17/2007 14:30:00”
myDateTime = DateTime.Parse(myDateTimeStr)
epoch = DateTime(1970,1,1)
(myDateTime - epoch).TotalSeconds
http://www.codeproject.com/csharp/JalaliCalendar.asp
http://heybo.com/weblog/posts/254.aspx
Calculate the Julian Date
(DateTime.UtcNow - DateTime.MinValue).TotalDays + (DateTime(4713,1,1)-DateTime(1,1,1)).TotalDays +403
Or the modified Julian Date
(DateTime.UtcNow - DateTime(1858,11,17)).TotalDays
Or the day of the year (which is what some people think of as Julian day)
(System.Globalization.JulianCalendar()).GetDayOfYear(DateTime.Now)
DateTime.Now.AddDays(-1)
.NET does not have a Year 2000 problem. It is Y2K compliant. boo compiles to bytecode on .NET and thus does not have a Yeark 2000 problem and is Y2K compliant.
There are many ways. CastleProject has a Validation system which works well with MonoRail. EnterpriseLibrary from Microsoft had a Validation system.
It depends on what you mean. URL and Html escapes can be handled with HttpUtility class in System.Web namespace and assembly.
You can use the substitution operator to find pairs of
characters (or runs of characters) and replace them with a single instance. In
this substitution, we find a character in (.).
The memory parentheses store the matched character in the back-reference \1 and we use that to require that the same thing
immediately follow it. We replace that part of the string with the character in
$1.
/* s/(.)\1/$1/g; #is the perl regex */
stripped = /(.)\1/.Replace(“Haarlem”,”$1”)
Here is the same example as perlfaq converting Haarlem like in the Netherlands to Harlem like in New York.
There have been a number of attempts at a “exec” method for boo that uses CodeDom. I have not seen any one that did a very great job. boo is compiled to bytecode and then executed by a JIT engine. The method or function call you wish to perform may not exist at runtime.
That said, take a look at any of the boo DSL which may help you do what you want. Specifically take a look at Binsor in rhino-commons.
This isn't something that can be done in one regular
expression, no matter how complicated.
A regular expression is a representation of a Regular Language in the field of formal languages. They are equivalent to finite automaton. It can be proven that this is impossible. This is the task of a regular grammar.
Call reversed to make an enumerator and then call join.
>>> blah = “hello”
‘hello’
>>> join(List(reversed(blah)),"")
'olleh'
Array.Reverse will reverse an array in place.
'hello'
>>> chars = blah.ToCharArray()
(h, e, l, l, o)
>>> Array.Reverse(chars)
>>> string(chars)
'olleh'
' '
>>> mystring =
" <--
tab"
'\t<-- tab'
>>> expanded =
/\t/.Replace(mystring, tabSpaces)
' <-- tab'
[TODO: find a Text::Wrap and Text::Autoformat .NET Library or boo code]
Access can be done for a single character using the indexer in boo.
>>> blah
'hello'
>>> blah[2]
l
>>> blah[1]
e
Strings in .NET are immutable reference types so any change results in the creation of a new string. You can use string.Substring() or slice notation.
>>> jabh = "Just another boo hacker"
'Just another boo hacker'
>>> jabh.Substring(0,12) + " awesome " + jabh.Substring(13,10)
'Just another awesome boo
hacker'
>>> jabh[:13] + "awesome" + jabh[12:]
'Just another awesome boo
hacker'
You have to keep track of N yourself.
want = 3
sues = “One fish two fish red fish blue fish”
fisher = /(\w+)\s+fish\b/
count = 0
for match in fisher.Matches(sues):
count++
if count == 3:
print “the third fish is a ${match.Groups[1]} one.”
>>> blah = "there was an x in my string x in my string!"
'there was an x in my string x
in my string!'
>>> re = @/x in/
x in
>>> r = re.Matches(blah).Count
2
.NET regular expressions don’t support the \L \U modifiers like perl does. However, .NET provides a MatchEvaluator delegate which lets you call code for every match in a regular expression.
>>> def upper(m as Match):
... return m.Groups[1].Value.ToUpper()
...
>>> @/\b(\w)/.Replace("welcome
to the boofaq", upper )
'Welcome To The Boofaq'
>>>
To make the whole string
uppercase just use string.ToUpper
>>> “somestring”.ToUpper();
‘SOMESTRING’
You can (and probably should)
enable locale awareness of those characters by using the CultureInfo overload
>>> import
System.Globalization
>>> str1 = "this is some string man!"
'this is some string man!'
>>> str2 = str1.ToUpper(CultureInfo("en-US", false))
'THIS IS SOME STRING MAN!'
>>>
There is also
System.Globalization.TextInfo.ToTitleCase()
>>> myTI = CultureInfo("en-US",false).TextInfo
TextInfo - 1033
>>> myTI.ToTitleCase("welcome to the
boofaq")
'Welcome To The Boofaq'
>>>
Usually characters here are a comma and a quote. ODBC allows the use of an ODBC ADO.NET CSV DataProvider. There are multiple CSV parsers available at places like CodeProject.
Take the example case of trying to split a string that is comma-separated into its different fields. You can't use split(/,/) because you shouldn't split if the comma is inside quotes. For example, take a data line like this:
SAR001,"","Cimetrix,
Inc","Bob Smith","CAM",N,8,1,0,7,"Error, Core
Dumped"
Due to the restriction of the quotes, this is a fairly complex problem. Thankfully, we have Jeffrey Friedl, author of Mastering Regular Expressions, to handle these for us. He suggests (assuming your string is contained in $text):
@new = ();
push(@new, $+) while $text =~ m{
"([^\"\\]*(?:\\.[^\"\\]*)*)",? # groups the phrase inside the quotes
| ([^,]+),?
| ,
}gx;
push(@new, undef) if substr($text,-1,1) eq
',';
If you want to represent quotation marks inside a
quotation-mark-delimited field, escape them with backslashes (eg, "like
\"this\"".
This is Boofaq so you may or may not know perl. The above is a rather nice regular expression. We can get similar behavior with boo using this code.
text = "\"This is a Quoted Value\",1,2,CSV,omg
csv,\"Quotes, commas, and things\""
//+ re {"([^"\]*(?:\.[^"\]*)*)",?
| ([^,]+),? | ,} System.Text.RegularExpressions.Regex
re = Regex("\"([^\\\"\\]*(?:\\.[^\\\"\\]*)*)\",?"
+ @"|([^,]+),?" + @"|,")
value = []
for m in re.Matches(text):
values.Add(m.Groups[m.Groups.Count - 1].Value);
[TODO: this regex doesn’t work fix this!]
Use string.Trim(), string.TrimEnd(‘ ‘), string.TrimStart(‘ ‘);
Use the String(Char, Int32) constructor.
things = string(‘ ‘, 20) + “my stuff”
Or you can use the * operator:
>>> " "*20+"my stuff"
' my stuff'
If you know where the columns that contain the data are, you can use string.Substring to extract a single column
column = line.Substring(startColumn, length)
or you can use slicing
column = line[startColumn:length+startColumn]
You can use split if the columns are separated by whitespace or some other delimiter as long as the delimiter cannot appear as part of the data.
>>> line =
" fred barney
betty "
' fred barney
betty '
>>> line.Split(char(' '))
('', 'fred', 'barney', '', 'betty', '', '')
[TODO: what is soundex?]
Is this a good place for Levenshtein distance from
http://www.merriampark.com/ldcsharp.htm
boo just does it for you
foo = “Fred”
bar = “Barney”
“Say hello to ${foo} and ${bar}”
With boo you can’t do that, so it doesn’t apply. However the string class is often misunderstood. People say not to use + and to prefer string.Format. It turns out that the compiler itself has some optimizations for using + concatenation. Don’t prematurely optimize strings. You should just be aware that they are immutable reference types with value semantics. If you run into issues, then you can consider optimizing.
http://www.ayende.com/Blog/archive/2007/07/06/The-truth-about-string-concatenation-performance.aspx
With boo you can’t do that either! :0
This is VERY different than perl, so beware. In .NET arrays are more like C arrays. They are fixed length at time of creation. They represent a contiguous block of memory. Lists are anything that implements IList. Usually this is System.Collections.ArrayList or System.Collections.Generic.List<>
The generic List<> should almost always be preferred to use of ArrayList.
Array’s have a Length property. Lists have a Count property.
In boo there is also Boo.Lang.List which is what you get when you use [] notation. () notation give you a real array. Boo is smart enough to recognize if all the types of an array are the same and return an array of that type. Otherwise boo gives an System.Object[].
boo doesn’t have these language issues.
Use a Dictionary (hash). When you think the words “unique” or “duplicated”, think Dictionary keys.
If you don’t care about the order of the elements, you could just create the Dictionary and then extract eh keys.
words = [ "one", "two", "three",
"one", "four"
]
dict = { }
for s in words:
dict[s] = true
Hearing the word "in" is an indication that you
probably should have used a hash, not a list or array, to store your data.
Hashes are designed to answer this question quickly and efficiently. Arrays
aren't.
Both Array and List have an Exists method. List also has a Contains method.
// goodcolors = List<string>([ "Red",
"White", "Blue"
])
okcolors = [ "Teal", "Pink"
];
contains = goodcolors.Contains("Red")
print contains;
contains = Array.Exists(okcolors, delegate(string s)
{
if (s == "Teal")
{
return true;
}
else
{
return true;
}
});
Console.WriteLine(contains);
return contains;
Use a hash. (Are you seeing a theme here?)
This assumes that each element is unique in a given List/Array. Since both are enumerable, one and two in the example below could be either Lists or Arrays.
List<string> one;
string[] two;
GetListAndArray(out one, out two);
List<string> union =
new List<string>(), intersection = new
List<string>(),
difference = new List<string>();
Dictionary<string, int> count = new Dictionary<string,
int>();
foreach (string element in one)
if
(count.ContainsKey(element) ) count[element]++;
else
count[element] = 1;
foreach (string element in two)
if
(count.ContainsKey(element)) count[element]++;
else
count[element] = 1;
foreach (string element in count.Keys)
{
union.Add(element);
(count[element] > 1 ? intersection :
difference).Add(element);
}
Console.WriteLine("union:"+
string.Join(",
",union.ToArray()));
Console.WriteLine("intersection:"
+ string.Join(",
", intersection.ToArray()));
Console.WriteLine("difference:"
+ string.Join(",
", difference.ToArray()));
[TODO: implement this again using boo 3.0. New IEnumberable members and Queryable members may make this more readable.]
See also C5 Collections for a real Set implementation. http://www.itu.dk/research/c5/
It depends on what you mean by equal. Reference equality should be easy enough, just compare the two.
Lists by definition are ordered. If you want an unordered comparison you should be able to simply check that the two lists have the same number of Count and Contains for each element in the list.
So for lists:
List<int>
one = new List<int>(new int[] { 1, 2, 3 });
List<int>
two = new List<int>(new int[] { 1, 2, 3 });
if (one.Count != two.Count)
return
false;
foreach (int
element in one)
if
(!two.Contains(element))
return false;
return true;
Or for an array:
int[] a = new int[] { 1, 2, 3 };
int[] b = new int[] { 1, 2, 3 };
foreach (int
element in a)
if
(!Array.Exists(b, delegate(int i) { return i ==
element; }))
return
false;
return true;
If you want to compare
ordered arrays or lists just sort first and use the above.
If you want to compare whether two dictionaries are equal, compare their key Lists just as above and if that is true, then compare values at each key.
Dictionary<string, string> one = GetSomeDictionary();
Dictionary<string, string> two = GetSomeOtherDictionary();
if (one.Count != two.Count)
return false;
foreach (string element in
one.Keys)
if (!two.ContainsKey(element) ||
two[element] != one[element])
return false;
return true;
Use Array.Find.
int found = Array.Find(arrayOfInt, delegate(int i) { return 4 ==
i; });
If you want to Filter you can use Array.FindAll with the exact same predicate delegate but the return type is array.
If you want to do the same thing for a List you can use a very similar Find or FindAll, but they are not static methods:
listOfInt.Find(delegate(int i) { return 4 ==
i; });
Of course boo 3.0 has lambdas and extension methods. The extension method means you can do this for either Array or List:
enumerableInt.Find( i
=> 4 == i );
If you have boo 3.0 then you have LINQ. LINQ allows this to be written as:
(from i in enumerableInt where i=4 select i).Take(1).ToList()[0];
Or the FindAll version:
from i in enumerableInt where i=4 select i;
Array.Find and List.Find returns default value for the type
if nothing is found. It may make sense to cast to nullable to return null in
the case of something not being found.
Don’t. Just use List<>. See also C5. http://www.itu.dk/research/c5/
Don’t. Just use List<>. See also C5. http://www.itu.dk/research/c5/
Implement IComparer with a random based implementation like this:
public class RandomComparer:System.Collections.IComparer
{
Random
random;
public
RandomComparer()
{
random = new
Random();
}
#region IComparer Members
public int Compare(object x,
object y)
{
return
random.Next(3) - 1;
}
#endregion
}
Then use Array.Sort and pass it this comparer.
int[] arrayOfInt = { 1, 2, 3, 4, 5, 9, 8, 7, 6 };
Array.Sort(arrayOfInt, new RandomComparer());
This works great for Arrays and the old weakly typed collections like ArrayList, but for Generic List you need a Generic IComparer. You can achieve this with simple inheritance of the non-generic type and implementing the generic interface.
public class RandomComparer:System.Collections.IComparer
{
Random
random;
public
RandomComparer()
{
random = new
Random();
}
#region IComparer Members
public int Compare(object x,
object y)
{
return
random.Next(3) - 1;
}
int IComparer.Compare(object
x, object y)
{
return
random.Next(3) - 1;
}
#endregion
}
public class RandomComparer<T> : RandomComparer,
IComparer<T>
{
#region IComparer<T> Members
public int Compare(T x, T y)
{
return
((IComparer) this).Compare(x,
y);
}
#endregion
}
Then use list.Sort and pass it the generic comparer.
List<int> listOfInt
= new List<int>(arrayOfInt);
listOfInt.Sort(new RandomComparer<int>());
Use foreach. See many above previous examples.
Or you can use Array.ForEach or List<T>.ForEach. Again, see many of the above previous uses.
In boo 3.0 you can also use LINQ. This was seen previously in the answer to “How do I find the first array element for which a condition is true?”
Random random = new Random();
myArray[random.Next(myArray.Length)];
For a list do the exact same thing but use Count instead of Length.
[TODO: Find an efficient permutation algorithm.]
See the question “How do I shuffle an array randomly?” Implement IComparer and IComparer<T> but this time actually compare the incoming values and return -1, 0 or 1 depending on what sort order you want.
See the BitArray and BitConverter classes. [TODO: give some examples here]
boo doesn’t have silly perlisms like this.
There are multiple ways each with pros and cons depending on what you want.
Dictionary<string, int> hash
= new Dictionary<string, int>();
hash.Add("Jay",
1);
hash.Add("Janice",
1000);
foreach (KeyValuePair<string,int> item in hash)
{
Console.WriteLine(item.Key+
" "+ item.Value);
}
foreach (string key in
hash.Keys)
{
Console.WriteLine(key+" "+hash[key]);
}
If you are using .NET 3.5’s System.Core assembly then you can use the IEnumerable extension methods and even LINQ.
Here is a good example of when a lambda expression is LESS readable:
hash.Select(item =>
{
Console.WriteLine(item.Key
+ " " + item.Value);
return 0;
}).ToList();
There is much going on in this statement. See the appendix on LINQ for details.
If by “process” an entire hash, you mean modify it, it is probably best to consider the Dictionary immutable. Any attempt to change keys or values while iterating a hash will throw a runtime exception.
foreach (string key in hash.Keys)
//THROWS
{
hash.[key] = ~hash[key];
}
foreach (KeyValuePair<string, int> item in hash) //THROWS
{
item.Value = ~item.Value;
}
So you can explicitly create
a new dictionary and fill it.
Dictionary<string, int> newHash1 = new
Dictionary<string,
int>();
foreach (KeyValuePair<string, int> item in hash)
{
newHash1[item.Key+"
fudged"] = ~item.Value;
}
Or if you don’t need a full Dictionary, maybe an IEnumerable<KeyValuePair<>> will work.
var newHash2 = hash.Select(item =>
new KeyValuePair<string,
int>(item.Key+"
fudged", ~item.Value ) );
Of course if all you need is something enumerable, then an anonymous type would work here too.
var newHash = hash.Select(item =>
new { Key =
item.Key+ " fudged", Value =
~item.Value });
See previous question. You will get a runtime exception.
You don’t really want to do that do you? If you really do, you should probably be using a different data structure.
You can reverse your hash. This won’t work as you want if you have multiple hash elements with the same value.
Dictionary<string, int> hash = new Dictionary<string,
int>();
hash.Add("Jay", 1);
hash.Add("Janice", 1000);
Dictionary<int, string> reversedHash = new
Dictionary<int,
string>();
foreach (string key in hash.Keys)
{
reversedHash.Add(hash[key], key);
}
Console.WriteLine("The one
with 1000 is : {0}", reversedHash[1000]);
You could just iterate the
hash looking for the value you want.
foreach (string key in hash.Keys)
{
if
(hash[key]==1000)
Console.WriteLine("I found {0} by value", key);
}
You could use LINQ in directly,
or just via the IEnumerable extension method(not really LINQ)
var keysFound = from item
in hash
where
item.Value == 1000
select
item.Key ;
// can someone show me how
to combine these two statements?
keysFound.Select(item
=> { Console.WriteLine("found {0}", item); return 0; }).ToList();
I wish I could do the above in a single LINQ statement. The closest I have come is this, but I get an error that Type inference failed in the call to ‘Select’.
(from
item in hash
where
item.Value == 1000
select
()=>{
Console.WriteLine("found {0}", item.Key);
return 0;
}).ToList();
So LINQ is probably overkill above. If you know your values are unique a simple “First” will work.
Console.WriteLine("I found
{0} by value",
hash.First(item => item.Value ==
1000).Key);
If you aren’t sure about unique values, then think “Where” instead of “First”.
hash.Where(item
=> item.Value == 1000).Select(item => {
Console.WriteLine("found
{0}", item.Key);
return 0;
}).ToList();
Call the Count() method of the Dictionary.
To sort a dictionary, start with the keys.
Dictionary<string, int> hash
= new Dictionary<string, int>();
hash.Add("foo",
1);
hash.Add("bar",
1000);
hash.Add("baz",
3);
hash.Add("Eggs",
12);
List<string> keys = new
List<string>(hash.Keys);
keys.Sort();
foreach
(string key in
keys)
{
Console.WriteLine("{0}\t{1}",
key, hash[key]);
}
The Sort method has a few overloads which take either a Comparison<> or IComparer implementation. This means you can specify culture and case sensitivity options.
List<string> caseSensitiveOrderedKeys = new List<string>(hash.Keys);
caseSensitiveOrderedKeys.Sort(StringComparer.Ordinal);
foreach
(string key in
caseSensitiveOrderedKeys)
{
Console.WriteLine("{0}\t{1}",
key, hash[key]);
}
If you often want to sort your hash, you may want to consider having started with SortedList or SortedDictionary. You can also create a sorted dictionary from an unsorted one using one of the constructor overloads.
SortedList<string, int>
sortedDict = new SortedList<string, int>(hash);
foreach
(string key in
sortedDict.Keys)
{
Console.WriteLine("{0}\t{1}",
key, hash[key]);
}
A note about SortedList: This could be one of the dumbest named classes in the entire Base Class Library in the .NET Framework. How this class escaped code reviews and whatever controls which Microsoft has in place on consistency in naming is amazing. SortedList is a Dictionary. See the documentation on how it differs from SortedDictionary. Other than the performance differences, the two should be able to be used interchangeably. If you want a List which always keeps itself sorted, implement IList<> and call Sort after every operation.
You just do. boo has no issues. Since boo was developed my Microsoft you don’t have to use binmode like in Perl or +b like in Python when opening your files. Just open your files and read you data.
boo is not Perl. boo has types for each of these. If you are reading from a string and into a type you may be able to use regular expressions just like in perl.
if(Regex.IsMatch(myStr,@”\D”))
{ Console.WriteLine(“has nondigits”); }
if(Regex.IsMatch(myStr,@”^\d+$”))
{ Console.WriteLine(“is a whole number”); }
if(Regex.IsMatch(myStr,@”^-?\d+$”))
{ Console.WriteLine(“is an integer”); }
if(Regex.IsMatch(myStr,@”^[+-}?\d+$”))
{ Console.WriteLine(“is a +/- integer”); }
if(Regex.IsMatch(myStr,@”^-?\d+\.?\d*$”))
{ Console.WriteLine(“is a real number”); }
if(Regex.IsMatch(myStr,@”^-?(?:\d+(?:\.\d*)?|\.\d+)$”))
{ Console.WriteLine(“is a decimal number”); }
if(Regex.IsMatch(myStr,@”^([+-]?)(?=\d|\.\d)\d*(\.\d*)?([Ee]([+-]?\d+))?$”))
{ Console.WriteLine(“a C float”); }
Ideally you will know what datatype you are expecting to read, or you will be able to use the lowest common type, like using double even though you may read an integer number.
Perl cites DBM. In the .NET world objects can be Serializable. They can serialize either to Binary or to XML. The same object can be Serializable to either of these. You can implement your own serialization routines.
XmlSerializer serializer = new XmlSerializer( typeof ( MyType ) );
using ( TextWriter writer = new StreamWriter( “MyType.xml” ) )
{
serializer.Serialize( writer, instanceOfMyType );
}
Or binary Serialization to Deserialize:
using
System.Runtime.Serialization;
using
System.Runtime.Serialization.Formatters.Binary;
…
MyType foo;
using ( Stream stream = new FileStream(“somefile.dat” FileMode.Open, FileAccess.Read, FileShare.Read) )
{
foo = (MyType) (new BinaryFormatter()).Deserialize(stream);
}
Do it manually.
boo 3.0 has Extension methods that could enable you to do this. Previous versions of boo has no means to do this.
[TODO: Find or implement a boo version of Business::CreditCard]
XS is an interface description file format used to create an extension interface between Perl and C. .NET has the concept of P/Invoke. Doubles, floats, and arrays of them should marshall just fine via P/Invoke.
I/O and the “f” issues: filehandles, flushing, formats, and footers.
[TODO: I don’t know much about how .NET at the console or with file IO does writes compared to stdio]
Nearly all IO operations are performed by some class that inherits from Stream. Stream has a Flush method which can be called to flush the stream.
Just like perl, .Net doesn’t provide random access to lines. Some libraries might be able to fake this.
A boo program to do these tasks takes the basic form of opening a file, printing its lines, then closing the file:
using (StreamWriter
outStream = new StreamWriter("outfile"))
using (StreamReader
inStream = new StreamReader("inputfile"))
{
string
line;
while( ( line =
inStream.ReadLine() ) != null )
{
outStream.WriteLine(line);
}
}
With this basic form, add the parts that you need to inset, change, or delete lines.
To prepend lines to the beginning, print those lines before you enter the loop that prints the existing lines.
using (StreamWriter
outStream = new StreamWriter("outfile"))
using (StreamReader
inStream = new StreamReader("inputfile"))
{
string
line;
outStream.WriteLine(“#Add this line to the top”);
while( ( line =
inStream.ReadLine() ) != null )
{
outStream.WriteLine(line);
}
}
To change existing lines, insert the code to modify the lines inside the while loop. In this case, the code finds all lowercased versions of “csharp” and uppercases them. This happens on every line so make sure you wanted to do it on every line.
using (StreamWriter
outStream = new StreamWriter("outfile"))
using (StreamReader
inStream = new StreamReader("inputfile"))
{
string
line;
outStream.WriteLine(“#Add this line to the top”);
while( ( line =
inStream.ReadLine() ) != null )
{
line = line.Replace(“csharp”,”CSHARP”);
outStream.WriteLine(line);
}
}
To change only a particular line, the input line number is useful. Unlike perl and its $., you have to keep track of the input line number yourself.
using (StreamWriter
outStream = new StreamWriter("outfile"))
using (StreamReader
inStream = new StreamReader("inputfile"))
{
string
line;
outStream.WriteLine(“#Add this line to the top”);
int lineNumber=0;
while( ( line =
inStream.ReadLine() ) != null )
{
lineNumber++;
if(lineNumber==4)
line = line.Replace(“things”, “stuff”);
outStream.WriteLine(line);
}
}
To skip lines, use the looping controls. The continue statement in boo is the same as next statement in perl. The break statement in boo is the same as last in perl. The continue statement ends execution of the while block for this iteration and continues on to the next iteration.
using (StreamWriter
outStream = new StreamWriter("outfile"))
using (StreamReader
inStream = new StreamReader("inputfile"))
{
string
line;
outStream.WriteLine(“#Add this line to the top”);
while( ( line =
inStream.ReadLine() ) != null )
{
if (line.StartsWith(“#”)) continue;
if (Regex.IsMatch(line, “^__(END|DATA)__$”)) break;
outStream.WriteLine(line);
}
}
To do the same sort of thing to delete a particular line by using continue to skip the lines you don’t want in the output. This example skips every fifth line.
using (StreamWriter
outStream = new StreamWriter("outfile"))
using (StreamReader
inStream = new StreamReader("inputfile"))
{
string
line;
outStream.WriteLine(“#Add this line to the top”);
int lineNumber=0;
while( ( line =
inStream.ReadLine() ) != null )
{
lineNumber++;
if((lineNumber % 5)==0)
outStream.WriteLine(line);
}
}
StreamReader has a ReadAll() method, but it does not read the file into an array of strings based on line separators like perl’s arrary=filehandle syntax. Use the above method to populate a List<string> if you want to read the whole file at once. This should be avoided for anything but the smallest files to prevent using too much memory.
Perl oneliners using perl –pi –e and perl –ni –e are very convenient. boo is not perl. Keep a copy of perl around for these handy oneliners.
Count the newlines in the file.
using
(StreamReader inStream = new StreamReader("inputfile"))
{
string line;
int lineNumber=0;
while( ( line =
inStream.ReadLine() ) != null )
lineNumber++;
}
Or you could use ReadAll() and a regex to count the newlines.
using
(StreamReader inStream = new StreamReader("inputfile"))
int
lines=Regex.Match(inStream.ReadAll(),Environment.NewLine).Count;
You can’t.
You can implement it yourself.
/// <summary>
/// Rotates the files based on RotateCopies member.
/// This is typically used by helper functions.
/// </summary>
/// <param name="sourcefile">Sourcefile.</param>
/// <param name="destfile">Destfile.</param>
private static void RotateFiles(string
sourcefile, string destfile, int CopiesToSave)
{
while ( -- CopiesToSave
>= 1 )
RotateAway(destfile, CopiesToSave);
if ( File.Exists( destfile ) )
File.Move(destfile,destfile+".1");
if ( File.Exists(sourcefile) )
File.Copy(sourcefile, destfile);
}
/// <summary>
/// Rotates the file. This is the
iterative helper to Rotate Fi
les.
/// </summary>
/// <param name="oldfile">Oldfile.</param>
/// <param name="ext">Ext.</param>
private static void RotateAway (string
oldfile, int ext)
{
if ( File.Exists(oldfile + "."
+ (ext+1).ToString()) )
File.Delete(oldfile
+ "." + (ext+1).ToString());
if ( File.Exists(oldfile + "."
+ ext.ToString()) )
File.Move(oldfile
+ "." + (ext).ToString(),oldfile +
"." + (ext+1).ToString());
}
File.Copy in System.IO namespace takes a source and destination.
Path.GetTempFileName in System.IO
It pure .NET code (no external libraries) you would have to use BinaryReader and BinaryWriter directly for binary files or just read the fixed length text records if they are text files.
Perl (and python and many others) have a couple of functions call pack and unpack where the format of a binary record can be specified using a template. See perldoc –f pack and perldoc –f unpack for details on these perl methods.
Mono implements Pack and Unpack in a library called Mono DataConvert. It is a replacement for System.BitConvert. See http://www.mono-project.com/Mono_DataConvert for more info.
boo doesn’t use filehandles like Perl and C. In .NET a stream is just another instance of an object. They are local, or class members or whatever you scope them to. You can pass them. You can make arrays of them. They are not special.
See How can I make a filehandle local to a subroutine? How do I pass filehandles between subroutines? How do I make an array of filehandles?
I don’t even know what this means, and the perlfaq doesn’t even answer this question very well.
If you want a footer it sounds like you are doing form template type stuff. Try NVelocity.
Try string.Format().
int.ToString() has an overload that accepts a string and an IFormatProvider. You probably don’t need the IFormatProvider because you should use your systems current culture. The format string value “N” is most general for a general number.
int x = 1234567890;
Console.WriteLine( x.ToString(“N”) ); // 1,234,567,890
You can’t. Most systems don’t really do that either. Your unix shell does that. Perl has a glob operator that can expand ~.
For ASP.NET websites ~ often means the current SiteRoot. You can use HttpUtility methods to expand the path.
You are opening with FileMode.Create when you probably really want FileMode.Append and then to seek. Or you can open file FileMode.Open and FileAccess.ReadWrite.
You don’t, because .NET is not perl J
Nope, because .NET doesn’t have glob.
Open it normally. Perl treats these things special but in .NET IJW(it just works).
File.Move works great.
Open the file with FileShare.None. You cannot lock a file without opening it.
Because operating systems don’t work that way.
Didn’t anyone tell you that web-page hit counters were
useless?
You probably should. Most documentation of writing to a file doesn’t show the proper use of FileShare.Read.
Just seek and write. Keep in mind that “write” is an overwrite and not a shift/insert write, thus if you want to insert you will need to copy the entire remaining file to offset what you have to write.
File.GetCreationTime in System.IO.
File.SetCreationTime in System.IO
The write way would probably be to inherit from Stream and implement your own writer.
Use StreamReader.ReadToEnd(), File.ReadAllBytes(), File.ReadAllLines(), or File.ReadAllText()
.NET stream and file readers don’t have anything like perl’s $/ (record separator). You would have to implement this yourself.
From a file, StreamReader.Read() does exactly this.
From the keyboard Console.ReadKey() will do this.
StreamReader.Peek returns the next character without reading it or -1 if there is no next character.
Just keep reading blocking IO when reading from the file. See How do I change, delete, or insert a line in a file, or append to the beginning of a file? But keep reading even when ReadLine() returns null.
You can dup a stream because StreamReader has a constructor for a given stream.
Usually you won’t need a dup.
You don’t. Close the stream or reader/writer.
boo strings are just like C strings. \t is a tab and \f is a form feed. You can either escape the backslashes or use the special boo @ prefixed string literal to prevent escape characters from being processed.
@”C:\temp\foo” instead of “c:\\temp\\foo”. To include a quotation mark, double quote it. @”I like to quote things “”and”” stuff”;
In unix not all files have a period and a three letter extension.
Instead of glob, use System.IO.Directory.GetDirectories(@“c:\Users\jrwren”,”*.doc”) There is also an override that allows specification of a SearchOption. One SearchOption is AllDirectories which will cause GetDirectories to recurse.
To find all jpg files in jrwren’s Vista homedirectory:
string[] jpegs = System.IO.GetDirectories(@”c:\Users\jrwren”,”*.jpg”,SearchOption.AllDirectories);
boo doesn’t do these things, but perl might. These do not apply to .NET or boo.
Random random = new Random();
string[] lines = File.ReadAllLines(“somefile”);
string randomline = lines[random.Next(lines)];
Is an inefficient way to do it because the entire file is read into memory.
Random random = new Random();
using (StreamReader
inStream = new StreamReader("inputfile"))
{
string line;
int lineNumber=0;
while( ( line =
inStream.ReadLine() ) != null )
{
lineNumber++;
if(random.Next(lineNumber+1)==0)
break;
}
}
Perlfaq says this is good and
from Knuth’s The Art of Computer
Programming, Volume 2, Section 3.4.2. I don’t like it because it doesn’t
treat all lines with equal weight. Maybe I have not implemented an equal
algorithm here.
boo and .NET do not let you do this directly. string.Join(“,”,someStringArray); works fine.
This section is surprisingly small because the rest of the FAQ is littered with answers involving regular expressions. For example, decoding a URL and checking whether something is a number are handled with regular expressions, but those answers are found elsewhere in this document (in Boofaq9: "How do I decode or create those %-encodings on the web" and Boofaq4: "How do I determine whether a scalar is a number/whole/integer/float", to be precise).
Unfortunately only 1 of the 3 techniques mentioned in perlfaq really work in boo. So comment lots outside the regex.
Whitespace and comments inside the regex do not work because boo doesn’t like multiline strings. Different delimiters don’t help because regex’s are inputted as strings to regex methods. They aren’t built into the language like in perl, boo, and javascript.
Maybe you should be using Regex.Matches instead of Regex.Match? You might be using incorrect modifier(s).
Perl has some .. operator that makes this easy. It really isn’t that difficult to just implement the line based reading state yourself.
private void
LinesBetweenTwoPatterns(string start, string end, string
input)
{
StringReader
stringreader = new StringReader(input);
StringWriter
outStream = new StringWriter();
string
line;
bool
reading = false;
while
((line = stringreader.ReadLine()) != null)
{
if (Regex.IsMatch(line, start))
{
reading = true;
continue;
}
if (Regex.IsMatch(line, end))
{
reading = false;
continue;
}
if
(reading)
outStream.WriteLine(line);
}
Console.WriteLine(outStream.ToString());
}
LinesBetweenTwoPatterns("START", "END",
PerlFaq6Resources.LinesBetweenTwoPatternsString);
If you want to read nested START through END patterns things get tricky and you run into the same problem described in How do I find matching/nesting anything?
.NET stream and file readers don’t have anything like perl’s $/ (record separator). You would have to implement this yourself.
Perlfaq shows how you can substitute TEsT and get SUcCESS as a result. Why in gods name do you want to do that?
[TODO: figure out how to do this in .NET]
It just does. You can disable this behavior by using RegexOptions.CultureInvariant.
Use \w
Perl has a \Q which starts quote and reuses the \E which ends a number of regex modifiers. This is useful in perl if you want to match a string literal say “1*”. The * in regex would be interpreted as a modifier, but by surrounding with \Q and \E, it turns off all modifiers and treats it literal. I know of no way to do this in .NET. You will have to escape your strings manually.
It’s a perl thing, but it is important to know about compiled regular expressions. They can greatly help performance under certain conditions. Often it is as easy as passing RegexOptions.Compiled to the Regex constructor or static methods. There are pros and cons to this. While compiling the regex will yield faster execution time, it also takes time to compile and so will increase startup time.
Sounds easy doesn’t it? But what if you have a C style comment in a string?
string blah = “things and /* oh no don’t steal my stuff!*/ ”;
So something this simple won’t work:
string text = Regex.Replace(inputfilestring, “/\*.*?\*/”, “”);
Thanks again to the perlfaq. (This section should just be called regex faq since most of the concepts apply to any environment in which you can use regular expressions.)
string text = Regex.Replace(inputfilestring,
“/\*[^*]*\*+([^/*][^*]*\*+)*/|("(\\.|[^"\\])*"|'(\\.|[^'\\])*'|.[^/"'\\]*)”, “$2”, RegexOptions.Singleline);
Thanks again to Fred Curtis who expanded this out and documented it using RegexOptions.IgnorePatternWhitespace (/x in perl).
/\* ## Start of /* ... */ comment
[^*]*\*+ ## Non-* followed by 1-or-more *'s
(
[^/*][^*]*\*+
)* ## 0-or-more things which don't start with /
## but do end with '*'
/ ## End of /* ... */ comment
| ## OR various things which aren't comments:
(
" ## Start of " ... " string
(
\\. ## Escaped char
| ## OR
[^"\\] ## Non "\
)*
" ## End of " ... " string
| ## OR
' ## Start of ' ... ' string
(
\\. ## Escaped char
| ## OR
[^'\\] ## Non '\
)*
' ## End of ' ... ' string
| ## OR
. ## Anything other char
[^/"'\\]* ## Chars which doesn't start a comment, string or escape
)
Not usually, but actually there is some under the hood stack magic that .NET regex can do for you.
This example from the Grouping Constructs .NET Framework Developer’s Guide in MSDN shows how to match balanced <> characters.
// This code example demonstrates using the balancing group definition feature of
// regular expressions to match balanced left angle bracket (<) and right angle
// bracket (>) characters in a string.
using System;
using System.Text.RegularExpressions;
class Sample
{
public static void Main()
{
/*
The following expression matches all balanced left and right angle brackets(<>).
The expression:
1) Matches and discards zero or more non-angle bracket characters.
2) Matches zero or more of:
2a) One or more of:
2a1) A group named "Open" that matches a left angle bracket, followed by zero
or more non-angle bracket characters.
"Open" essentially counts the number of left angle brackets.
2b) One or more of:
2b1) A balancing group named "Close" that matches a right angle bracket,
followed by zero or more non-angle bracket characters.
"Close" essentially counts the number of right angle brackets.
3) If the "Open" group contains an unaccounted for left angle bracket, the
entire regular expression fails.
*/
string pattern = "^[^<>]*" +
"(" +
"((?'Open'<)[^<>]*)+" +
"((?'Close-Open'>)[^<>]*)+" +
")*" +
"(?(Open)(?!))$";
string input = "<abc><mno<xyz>>";
//
Match m = Regex.Match(input, pattern);
if (m.Success == true)
Console.WriteLine("Input: \"{0}\" \nMatch: \"{1}\"", input, m);
else
Console.WriteLine("Match failed.");
}
}
/*
This code example produces the following results:
Input: "<abc><mno<xyz>>"
Match: "<abc><mno<xyz>>"
*/
Interestingly this has some mathematical implications. By implementing a stack underneath this is technically not just a regular expression. This is something that a true regular expression could not do. Regular expressions are representations of regular languages. See How do I find matching/nesting anything?
Most people mean that greedy regexes match as much as they
can. Technically speaking, it’s actually the quantifiers (?, *, +, {}) that are
greedy rather than the whole pattern.
boo, like Perl, prefers local greed and immediate gratification to overall greed. You can use the ? modifier on a quantifier to get a non-greedy version.
string s1 = “I am very very cold”;
string withoutVery = Regex.Replace(s1,”ve.*y”,””); // “I am cold”
string withoutOneVery = Regex.Replace(s1,”ve.*?y”,””); // “I am very cold”
Use the split function.
StringReader inStream = new StringReader(someinputstring);
string line;
while ( (line = inStream.ReadLine())!=null)
{
foreach (string word in
line.Split(' '))
{
//do something with word here.
Console.WriteLine(word+word.Length);
}
}
You could use Regex.Split(line,”somethinghere”) instead of string.Split to split on other word separators or “(\w+)” to ignore multiple spaces between words.
For words it is VERY similar to the previous question. The answer is “use a hash”.
StringReader inStream = new StringReader(someinputstring);
string line;
Dictionary<string,int> wordCount = new
Dictionary<string,int>();
Dictionary<string,int> lineCount = new
Dictionary<string,int>();
while ((line = inStream.ReadLine()) != null)
{
foreach (string word in
line.Split(' '))
{
if
(wordCount.ContainsKey(word))
wordCount[word]++;
else
wordCount[word] = 1;
}
if
(lineCount.ContainsKey(line))
lineCount[line]++;
else
lineCount[line] = 1;
}
I like to Compute Levenshtein distance.
/// <summary>
/// Compute Levenshtein distance.
/// from http://www.merriampark.com/ldcsharp.htm
/// </summary>
public
#if NET_2_0
static
#endif
class Distance
{
/// <summary>
/// Compute
Levenshtein distance
/// </summary>
/// <param
name="s">String 1</param>
/// <param
name="t">String 2</param>
/// <returns>Distance between the two strings.
/// The
larger the number, the bigger the difference.
/// </returns>
public static int LD (string s, string t)
{
int
n = s.Length; //length of s
int
m = t.Length; //length of t
int[,]
d = new int[n +
1, m + 1]; // matrix
int
cost; // cost
//
Step 1
if(n
== 0) return m;
if(m
== 0) return n;
//
Step 2
for(int i = 0; i <= n; d[i, 0] = i++);
for(int j = 0; j <= m; d[0, j] = j++);
//
Step 3
for(int i = 1; i <= n;i++)
{
//Step 4
for(int j = 1; j <= m;j++)
{
// Step 5
cost =
(t.Substring(j - 1, 1) == s.Subst
ring(i - 1, 1) ? 0 : 1);
// Step 6
d[i, j] =
System.Math.Min(System.Math.Mi
n(d[i - 1, j] + 1, d[i, j
- 1] + 1),
d[i -
1, j - 1] + cost);
}
}
//
Step 7
return
d[n, m];
}
}
[TODO: find some other string approximation matching libraries]
Compile your regular expressions. See What is /o really for?
You may be able to combine multiple regular expressions into a single regex. Instead of match “foo” and then match “bar” and then match “baz”. Try “(foo|bar|baz)”.
For more details on regular expression efficiency, see
Mastering Regular Expressions by Jeffrey Freidl. He explains how regular
expressions engine work and why some patterns are surprisingly inefficient.
Once you understand how perl applies regular expressions, you can tune them for
individual situations.
Ensure that you know what \b really does: it's the boundary between a word character, \w, and something that isn't a word character. That thing that isn't a word character might be \W, but it can also be the start or end of the string.
It's not (not!) the boundary between whitespace and non-whitespace, and it's not the stuff between words we use to create sentences.
In regex speak, a word boundary (\b) is a "zero width
assertion", meaning that it doesn't represent a character in the string,
but a condition at a certain position.
.NET and boo doesn’t have these concepts (thank God). They are not recommended for use in perl.
You use the \G anchor to start the next match on the same string where the last match left off. The regular expression engine cannot skip over any characters to find the next match with this anchor, so \G is similar to the beginning of string anchor, ^. The \G anchor is typically used with the g flag. It uses the value of pos() as the position to start the next match. As the match operator makes successive matches, it updates pos() with the position of the next character past the last match (or the first character of the next match, depending on how you like to look at it). Each string has its own pos() value.
Suppose you want to match all of consecutive pairs of digits
in a string like "1122a44" and stop matching when you encounter
non-digits. You want to match 11 and 22 but the letter <a> shows up
between 22 and 44 and you want to stop at a. Simply matching pairs of digits
skips over the a and still matches 44.
string blah = “1122a44”;
MatchCollection matches = Regex.Matches(blah,”(\d\d)”);
// three matches, each with one grouping value of 11, 22, 44
\G changes this behavior so that a clogs things up. \G forces the match to start from the last position - with the a. “a” doesn’t match \d so the match fails
string blah = “1122a44”;
MatchCollection matches = Regex.Matches(blah,”\G(\d\d)”);
// three matches, each with one grouping value of 11, 22
[TODO: find .NET Regex docs on this]
The problem is that .NET will create an Array in which to store the results. Use Array.ForEach or better yet in .NET 3.0 use LINQ or an IEnumerable<T> extension method from Queryable. These methods return IEnumerables instead of pre-built List<T> or Array. This means that the result is built on demand as you ask for it.
.NET does this for you. .NET strings are fully Unicode compliant including multibyte chars. There are even some Unicode character classes available. \p{Lu} for letters which are uppercase, \p{Ll} for letters which are lowercase. See Character Classes in the MSDN Documention .NET Framework Developer's Guide. Eat your heart out perl! This appears to be something that .NET regular expressions do that perl’s do not, or at least not easily.
It just works.
string regex = someOtherRegexPiece + “\d\d\w*\d?” + anotherRegexPiece;
for(Match match in Regex.Matches(input,regex)) {…
General boo language issues that don't clearly fit into any of the other sections.
Mono is open source, just dive into their sources and find it. Microsoft also has an open source implementation known as Rotor which may be insightful.
This is FAR more applicable in perl, but boo has its punctuation signs too!
The Question Mark: bool? Is a boo shorthand way of saying Nullable<bool>. The ? can be appended to any value type to ask for a nullable of that value type.
The At@ sign: is used to escape strings in boo. No escape characters will be interpreted and you can span multiple lines.
string literal = @”This string will actually print backslash n here: \n and
the newline will be literal in the this multiline string”;
The At@ sign can also be used to escape a keyword
private int ReturnKeyword()
{
int @return
= 0;
return
@return;
}
You always have to. This isn’t perl!
I am not sure what this means in a boo context, but I can show some boo code that matches one of the perl examples here (the other two cannot be done in boo - and for good reason).
return GetSomeThingThatReturnsSomethingIndexable()[2];
Event this is probably not a good idea unless you are certain that this method will always return something with an integer index of two.
You can use #pragma directives. My favorite is to turn on warnings as errors and override the warnings with #pragma directives. Two I find very useful are 1591 and 3008.
// We don't need XML docs in this file!
#pragma warning
disable 1591
// This generated file may not be CLS compliant, OH WELL!
#pragma warning disable 3008
…
#pragma warning restore 1591
#pragma warning restore 3008
P/Invoke is a way of calling native code (always C?) from Perl. http://www.pinvoke.net is a great resource.
Because this is easier.
[TODO: detail the differences if any]
Exactly as you would a class, but use the struct keyword. The difference is that a “struct” is a value type instead of a reference type. There is a lot implied in this difference.
Use CSC /target:module, but you probably really want /target:library. The former will compile to a .netmodule file. The compiler will not generate an assembly manifest. This can be useful if you wish to compile some vb.net files and some boo files and then compile them into the same assembly. You can add a netmodule to an assembly when you build the assembly by using /addmodule. There is an excellent tool called ILMerge which lets you merge two assemblies by extracting their modules and creating a new assembly from the extracted modules.
This is pretty fundamental to boo. (It isn’t fundamental to perl.) You should already know this, but here is an example with a field, a property, two events, a delegate and the second class as EventArgs:
public class MyClass
{
private
string _FieldOne;
private string
_PropertyOne;
public
string PropertyOne
{
get {
return _PropertyOne; }
set
{
_PropertyOne = value;
}
}
public
delegate void MyEventHandler(object sender, EventArgs ea);
public event
MyEventHandler MyEvent;
public event
EventHandler<MyEventArgs>
MyOtherEvent;
public
MyClass()
{
if
(MyEvent!=null)
MyEvent(this, new EventArgs());
if
(MyOtherEvent!=null)
MyOtherEvent(this, new MyEventArgs("hi"));
}
}
public class MyEventArgs
: EventArgs
{
public
MyEventArgs(string message)
{
this._Message = message;
}
private
string _Message;
public
string Message
{
get {
return _Message; }
set
{
_Message = value;
}
}
}
HUH? We don’t play with our taint in boo.
There has been TONS written on this. Rather than duplicate it all, I recommend you start with the Wikipedia page and read it completely. It gives a good introduction. Then google for boo closures and read the many blog posts.
The short answer is that it is a function paired with environment. boo anonymous methods enable closures to be built easily. LINQ uses this, among other things, extensively.
[TODO: show a simple closure example]
boo and .NET are not perl.
You just do. Functions aka Methods are passed by means of a delegate. FileHandles, Arrays, Hashes, Methods, Regex, Functions and delegates are all objects.
Use the static keyword where the variable is defined.
public class MyClass
{
private static string _FieldOne;
…
Thank god that perl is not boo.
The concept is not the same as the mess that is perl’s variable scoping, but knowing to use this is important. See the use of this in the class example at How do I create a class?
I can’t think of any parallels to boo or .NET here.
boo doesn’t have a <> readline operator. .NET has some “read all lines into an array of strings” methods mentioned in section 5 of boofaq, but the issues with perl do not apply. All is good here in boo land.
If the class is sealed, you are kinda screwed. Use a bridge or adapter pattern. If the class is not sealed, you can inherit and use a strategy pattern. You can overload operators in boo. You can declare both explicit and implicit type conversions. You can even cause overloaded operators to return some other type. For example causing == to return a non-bool type seems stupid, but in certain cases (see NHibernate Query Generator) it makes for very readable code.
boo doesn’t have or need this.
You just do.
switch (val)
{
case 0:
DoStuff();
break;
case 1:
break;
}
//you can even
switch on strings (unlike C)
switch (someString)
{
case "can't":
Stuff();
break;
case "do this in C":
break;
}
The compiler will do this. This is not ruby. We do not have method_missing.
More common are undefined Dictionary keys. These result in a runtime error. Strings literals are Evil. The guys over at Eleutian hate string literals. http://blog.eleutian.com/PermaLink,guid,088e158b-cd3c-4920-8df5-a3628013cc1d.aspx
You misspelled the name, or it is out of scope. boo has no file level scope like C or Perl. You must make the method accessible and access the method appropriately, through an instance if needed.
Assembly.GetAssembly(MyType.GetType()) where MyType is the type of your current class.
/* blah blah */
Many editors such as Visual Studio, SharpDevelop and MonoDevelop have shortcuts to just highlight code and click a button to have it commented.
You can also “comment” out boo code by using #if 0… #endif
You don’t. You cannot unload assemblies either. But you can unload an AppDomain. An AppDomain in .NET is like a .NET Process within the operating system process. You can have multiple AppDomains within the same process. Many plugin or add-in systems work this way by loading the add-ins in a separate AppDomain. When you call methods between AppDomains you are effectively doing remoting so objects just be Serializable or inherit from MarshalByRefObject. .NET 3.5 is to include an add-in system. Mono has Mono.AddIns. You should probably use these pre-existing add-in libraries if you want to build an add-in system in your application.
You can do this using Reflection.
[TODO: example]
I have no idea. boo doesn’t interpret.
This section of the boo FAQ covers questions involving operating system interaction. Topics include interprocess communication (IPC), control over the user-interface (keyboard, screen and pointing devices), and most anything else not related to data manipulation.
Networking, the internet, and a few on the web.
Christiansen, T., & D'foy, B. (2007, July 9). perlfaq.
Retrieved from http://faq.perl.org/