1
So I have a lot of methods which does the same thing, they just do it on different fields.
The fields are as follows:
NUMERIC_FIELDS = [:cost_single, :cost_aggregate,
:shop_uw_single, :shop_uw_aggregate,
:line_manager_single, :line_manager_aggregate,
...
Your code is really nice, and I could even say I learnt something reading this (song.text[0:7]), but it could be improved in places:
Python's official style guide: PEP8, dictates that variables not be named like dstFile but rather, dst_file. (So on, for the rest of your variables named unaccor...
0
As a part of an internship I am expected to learn how to use SQL in SAS to run queries. I have little experience with programming, and just a week with SQL and SAS. This, the first cod I've written, was left running last night and when I came in today it had an error; unfortunately I tried to fix...
I'm making a really simple html website with CSS and I was hoping on some feedback. A few notes:
There will be more content under this, but I want the starting screen to take up the full page and then scroll under it.
I've used a bit of a hack to remove the padding from the first list element
...
I see a number of things that may help you improve your code.
Eliminate "magic numbers"
This code has a number of "magic numbers," that is, unnamed constants such as 2, 0x0e, 0x10, etc. Generally it's better to avoid that and give such constants meaningful names. That way, if anything ever ne...
This code validates the following:
enddate should not be less than startdate
startdate should not be less than or equal to the date today unless document.getElementById("ltype").value === "1"
The maximum gap between startdate and enddate is one year, more than that should cause an error alert
...
My goal is to remove whitespaces from string elements of my list, and to remove empty string elements altogether. My code:
def modifylist(lst):
lst = [elt.strip() if type(elt) is str else elt for elt in lst]
for i in lst:
if i == '':
lst(se...17
0
I have the following code:
for j in range(rows):
for i in range(cols):
k = j * rows + i
k1 = k + 1 if i < cols - 1 else k - 1
k2 = k - 1 if i > 0 else k + 1
k3 = k + cols if j < rows - 1 else k - cols
k4 = k - cols if j > 0 else k + cols
w1 ...
Is there any code review extension for Visual Studio 2013 professional + TFS as source control, for free, that already has community support or still under development?
A tourist wants to make a good trip at the weekend with his friends. They will go to the mountains to see the wonders of nature, so he needs to pack well for the trip. He has a good knapsack for carrying things, but knows that he can carry a maximum of only 4kg in it and it will have to last t...0
I am writing a solved for 15 puzzle game which will find the solution path to any NxN board. For easier boards the algorithm works great solving almost any 3x3 boards, most 4x4 boards, but when I go 5x5 and higher I will often run out of memory. This is the implementation:
@WorkerThread
public S...
I'm building a small kind of blog website and some of it's models are post, user, comment, obviously.
The question is: Is the Comment model/table structured the right way? I'm asking this because it looks like has many through association but I only use has many.
I'm a little confused.
Is this ...
so I was solving this question on a site that gives you a 1d array called grid
grid = ['top left', 'top middle', 'top right',
'middle left', 'center', 'middle right',
'bottom left', 'bottom middle', 'bottom right']
and you're expected to write a method fire(x,y) t...
Logical block addressing (LBA) is a common scheme used for specifying the location of blocks of data stored on computer storage devices, generally secondary storage systems such as hard disks. LBA is a particularly simple linear addressing scheme; blocks are located by an integer index, with the first block being LBA 0, the second LBA 1, and so on.
IDE standard included 22-bit LBA as an option, which was further extended to 28-bit with the release of ATA-1 (1994) and to 48-bit with the release of ATA-6 (2003). Most hard drives released after 1996 implement logical block addressing.
== Overview... ==
13
In honor of Star Wars day, I've put together this small Python program I'm calling JediScript. JediScript is essentially a scrapped-down version of BrainFuck without input or looping. Here are the commands in JediScript.
SlashWithSaber: Move forward on the tape.
ParryBladeWithSaber: Move backwa...
0
I've seen a lot of Brainf**k interpreters in various languages. I decided that actually interpreting Brainf**k is too hard, so instead of that, I wrote a 'compiler' in Ruby that directly transcribes BF to Ruby code. This is Version 1.0, and I'm looking for any tips on how to make it more efficien...
The Teufelsberg (German for Devil's Mountain) is a hill in Berlin, Germany, in the Grunewald locality of former West Berlin. It rises about 80 metres (260 ft) above the surrounding Teltow plateau, more precisely the north of Berlin's Grunewald Forest. It was named after the Teufelssee (i.e. Devil's lake) in its southerly vicinity.
== History ==
It is an artificial hill with a curious history: It was heaped up after the Second World War from part of the rubble of Berlin, approximately 75,000,000 m3 (98,000,000 cu yd) all over the city, during the following twenty years as the city was cleared and...
0
0
I'm converting a plain javascript infinite scroll into one using React. There's a decent delay (feels like a few hundred MS) before a new chunk is rendered, so it's a very choppy experience. Any thoughts how I can speed things up?
topOfElement = (element) ->
if !element
return 0
element....
0
0
0
Question 1:
What should the correct running time be for a well implemented topological sort. I am seeing different opinions:
Wikipedia says: O(log^2(n))
Geeksforgeeks says: O(V+E)
Question 2:
My implementation is running at O(V*E). Because at worst, I will need to loop through the graph E ti...
11
I'll start off by addressing the elephant in the room. It's been the better part of a year since the announcement that Code Review was graduating. In all those months, there haven't been any visible indications of change from us on the team. There are a few reasons for that, but they all come dow...
I'm in the process of refactoring one of my open source projects, branch here
https://github.com/AndersMalmgren/FreePIE/tree/MoveToStructureMap
The basic idea of the refactor is to allow for classes and all of its children in the graph to be scoped. I wrote a blog post about it
http://andersma...
