Author Archives: GauZ

My name is Gaurav Pandey. I graduated from Columbia University (Dept. of Computer Science) and have been working as a Software Developer on a variety of technologies in the beautiful city of New York :)

Restrict date range within DatePicker component

So I had to restrict days in the WPF DatePicker component. Only the days falling within a specific range should be available for selection and all others (past & future values) should be disabled. The solution is to use the DisplayDateStart & DisplayDateEnd properties on the DatePicker <DatePicker Name="dtPicker" DisplayDateStart="5/10/2012" DisplayDateEnd="5/20/2012" />

0  

N-dimensional aka N-ary Tree

N-dimensional tree is used to represent the UI of any application. Buttons, ComboBoxes and various other components are assembled together in this data structure and then rendered on the screen. I had to enhance the design of a commercial Tree UI component (add improved searching features) and thought of creating my own n-ary Tree data […]

1  

Achieving optimal performance in code

Is there any difference between the following two expressions\statements? def func1(a): return a == ‘TRUE’ def func2(a): return True if a == ‘TRUE’ else False Well, both of them do the same thing but interestingly, the former one is faster in terms of performance by atleast one CPU cycle! Let’s tear into assembly language of […]

0  

Logging in Java, C# and Python

In Java & C#, the most commonly used logging utilities are log4j and log4net. Python has it’s own inbuilt logging module which includes the exact same features as other log4X brethren! Setting up logging module in python >> import logging def initLogger(appName=’Application’, handlerType=’StreamHandler’, \ loggerLevel=’INFO’, handlerLevel=’DEBUG’): ”’ * There are many handler types available such […]

0  

Implementing a Stack in python

To implement a Stack in python, we simply need to extend the existing list class! class Stack(list): def push(self, data): self.append(data) def tos(self): if self: return self[-1] def peek(self, index): if self and 0 <= index < len(self): return self[index] def __iter__(self): if self: ptr = len(self) – 1 while ptr >= 0: yield self[ptr] […]

0