Skip to main content

Sasa.IO.DisposableFile - Simple Temporary File Handling

This is the twenty first post in my ongoing series covering the abstractions in Sasa. Previous posts:

Sasa.IO.DisposableFile is a simple object intended to automate the handling of temporary files. Like most IDisposable objects, a DisposableFile is intended to be used within a "using" block, and the file it references is deleted upon exiting the block:

using (var tmp = new DisposableFile(true, "foo.txt"))
{
    File.WriteAllText(tmp.Path, "hello world!");
    Console.WriteLine(File.ReadAllText(tmp.Path));
}
Console.WriteLine(File.Exists("foo.txt"));
     
// output:
// hello world!
// false

Any FileNotFoundException's thrown on dispose are ignored, so you can safely move the file within the "using" block.

Sasa.IO.DisposableFile Constructor

The DisposableFile constructor creates a temporary file:

using (var tmp = new DisposableFile(createIfNotExists: true,
                                    path: "foo.txt"))
{
    ...
}

Sasa.IO.DisposableFile.Path

The Path property exposes the path to the disposable file:

using (var tmp = new DisposableFile(createIfNotExists: true,
                                    path: "foo.txt"))
{
    Console.WriteLine(tmp.Path);
}
// output:
// foo.txt

Sasa.IO.DisposableFile.CreateTemporary

The CreateTemporary static method invokes System.IO.Path.GetTempFileName and returns a DisposableFile instance encapsulating the created file:

using (var tmp = DisposableFile.CreateTemporary())
{
    File.WriteAllText(tmp.Path, "hello world!");
}

Comments

Popular posts from this blog

async.h - asynchronous, stackless subroutines in C

The async/await idiom is becoming increasingly popular. The first widely used language to include it was C#, and it has now spread into JavaScript and Rust. Now C/C++ programmers don't have to feel left out, because async.h is a header-only library that brings async/await to C! Features: It's 100% portable C. It requires very little state (2 bytes). It's not dependent on an OS. It's a bit simpler to understand than protothreads because the async state is caller-saved rather than callee-saved. #include "async.h" struct async pt; struct timer timer; async example(struct async *pt) { async_begin(pt); while(1) { if(initiate_io()) { timer_start(&timer); await(io_completed() || timer_expired(&timer)); read_data(); } } async_end; } This library is basically a modified version of the idioms found in the Protothreads library by Adam Dunkels, so it's not truly ground bre...

Easy Automatic Differentiation in C#

I've recently been researching optimization and automatic differentiation (AD) , and decided to take a crack at distilling its essence in C#. Note that automatic differentiation (AD) is different than numerical differentiation . Math.NET already provides excellent support for numerical differentiation . C# doesn't seem to have many options for automatic differentiation, consisting mainly of an F# library with an interop layer, or paid libraries . Neither of these are suitable for learning how AD works. So here's a simple C# implementation of AD that relies on only two things: C#'s operator overloading, and arrays to represent the derivatives, which I think makes it pretty easy to understand. It's not particularly efficient, but it's simple! See the "Optimizations" section at the end if you want a very efficient specialization of this technique. What is Automatic Differentiation? Simply put, automatic differentiation is a technique for calcu...

Easy Reverse Mode Automatic Differentiation in C#

Continuing from my last post on implementing forward-mode automatic differentiation (AD) using C# operator overloading , this is just a quick follow-up showing how easy reverse mode is to achieve, and why it's important. Why Reverse Mode Automatic Differentiation? As explained in the last post, the vector representation of forward-mode AD can compute the derivatives of all parameter simultaneously, but it does so with considerable space cost: each operation creates a vector computing the derivative of each parameter. So N parameters with M operations would allocation O(N*M) space. It turns out, this is unnecessary! Reverse mode AD allocates only O(N+M) space to compute the derivatives of N parameters across M operations. In general, forward mode AD is best suited to differentiating functions of type: R → R N That is, functions of 1 parameter that compute multiple outputs. Reverse mode AD is suited to the dual scenario: R N → R That is, functions of many parameters t...