I have an ObservableCollection<MyType> ItemList, and I need to know the index of a specific MyType in the collection. However, when I hard-code the values like this:
ItemList.IndexOf(new MyType(val1, val2, val3));
it can't find the value because it is a different instance of MyType.
So, I ...
I decided to try my hand at making an encryption utility, which I lovingly call "FileScrambler". FileScrambler allows the user to encrypt a file (a master-password list, personal diary, or whatever) using a password, and save the resulting jumbled mess to their computer (same folder as the execut...
I decided to try my hand at making an encryption utility, which I lovingly call "FileScrambler". FileScrambler allows the user to encrypt a file (a master-password list, personal diary, or whatever) using a password, and save the resulting jumbled mess to their computer (same folder as the execut...
Ah, finally we can take a day off!
As promised:
And I made it to 2000.
What the heck, since I have a picture with my fancy hat and tie, I might as well keep posting these. Happy birthday to BoltClock!
I still confuse which better structure using mongodb?
place child in parent :
{
"_id": "528ba7691738025d11aab772",
"post": "Hello 1",
"childs": [
{
"_id": "528ba7691738025d11aab555",
"post": "Hello 2",
"childs": []
},
{
...
i have no clue what is going here, i run this code in debug, with break points, and is working fine ... but when i run i release mode with -O2 optimization all threads are working ... and they don't stop when is requests to.
What i like to obtain is have:
For each calculation type have X threads...
This question is related to another one that I have asked here.
I need to find ways to improve the runtime performance of the following piece of C-code.
I want to increase RANGE to around 1G, and still complete the execution within a reasonable time.
Auxiliary data structures:
#define RANGE...
i used BrightIdeasSoftware.TreeListView for display a tree view my treeview. i want my output like below screen but my code is not displaying correctly . MY Code With table script and Stored Procedure
My current treeview is displaying like second screen
First level of tree is displaying cor...
What interesting uses of MathJax are there, other than mathematical typesetting, that might be useful for Code Review?
I am using Rubocop to help me keep my code inline with common best practices, and i would like to adhere to this to help me write better code. The issue I have at the moment is
Class definition is too long. [108/100]
So i am not to far away and i have refactored my methods as best I can and s...
So, after years of fear and procrastination I decided to learn regular expressions. This is the result:
CoffeScript:
str = "<h2><a name=\"#{chapter._id}\">#{chapter.title}</a></h2>\n\n#{chapter.content}\n\n"
str.replace(/>([^>]+)</g, (r) ->
r.replace(/(>|\s)"/g, "$1“")
.replace(/"/g, "”")...
Code Review. A community that learns as it grows, and grows as it learns.
weekend-challenge projects are a huge opportunity to learn from each other. As individual coding marathons, these projects are fun.
Here's the proposition: each weekend-challenge project gets a dedicated GitHub repository...
I have this method that gives true if attribute is already used and false otherwise.
public boolean alreadyUsed(Node node, int attribute)
{
if (node.parent == null)
{
return false;
}
if (node.children != null)
{
if (node.splitAttribute == attribute )
...
Wasn't it already settled that we should use English on this site because the USA is the intended audience of the site?
Now I will point out an answer to a question that refers to the FAQ
Do posts have to be in English on Stack Exchange? {Answer}
There are instances where we allow other Engli...
I'm trying to create bootstrap plugin that will be used for copying content to clipboard.
I managed to build working version of my plugin but I'm wondering how I can improve it.
Idea is to show a small popover with two options: one will allow copying button content and second prepared link:
...
I made a Quicksort implementation with 3-way partitioning based on this code. Please review my c++ version. The partition swaps items around when it finds an item smaller or larger than pivot.
template<typename C>
void insertion_sort(C low, C high) {
for (auto i = low; i < high; ++i) {
...
I have two ways to encode a skeleton datatype.
data Bone = Bone {data :: Foo, children :: [Bone]}
type Skeleton = Bone
mySkeleton = Bone ... [Bone ... [], Bone ... [], ...]
Or
import Data.Tree
data Bone = Bone {data :: Foo}
type Skeleton = Tree Bone
mySkeleton = Node (Bone ...) [Node (Bone .....
So far, I've unlocked one of the secret hats. I'm wondering what other secret hats are out there and how to earn them?
For years I have dinked with and now considering making it into a real project.
I am thinking about developing a 'driver' of sorts that sits on top of RDMS( oracle, MSSQL, MySQL - others to follow). That given a table description the driver creates stored procedures and client code example(s) (...
For years I have dinked with and now considering making it into a real project.
I am thinking about developing a 'driver' of sorts that sits on top of RDMS( oracle, MSSQL, MySQL - others to follow). That given a table description the driver creates stored procedures and client code example(s) (...
Well, quite a biggie with all the foreach's. It works, it gets me 981 results, but there must be a way to shorten this code. Right?
<?php
$class = new FTPcleanup();
echo $class->index();
class FTPcleanup {
private $server = "1.1.1.1";
private $user = "ftpuser";
private $passwd ...
I posted an answer on the Winterbash 2014 secret hats post which has now been deleted. Why was my answer deleted? I'm pretty confident that post is what got me the Eureka hat, so I can't understand why it was removed.
This code is part of a data model used to create Keyword records in a database.
if (_queue
.OrderByDescending(record=>record.Primary)
.GroupBy(record=>record.Term)
.Select(record=>record.First())
.Select(Create)
.Any(result=>res...
I was playing around with some code trying to implement a sorting algorithm that also works with singly linked lists. Since the merge routine of mergesort only scans forward implementing a generic mergesort seemed like the way to go. My code is below:
#include <iostream>
#include <vector>
#include 
Can anyone help me optimise this query? I have the following table:
cdu_user_progress:
--------------------------------------------------------------
|id |uid |lesson_id |game_id |date |score |
--------------------------------------------------------------
For each user, I'...
The following code is designed to accept a string from the user that is at most 5 characters long. It will then find each possible substring of the string and print all possible permutations of each substring.
This is the first time I've done my utmost to prevent memory leaks by freeing every m...
When you pass 350 reputation you gain access to the Review Queues. One of them is the "First Post" queue.
What is this queue, what purpose does it serve, and how should I process items in that queue?
My compiler (clang) shows this message: expected-warning{{format specifies type 'char ' but the argument has type 'char () [5]'}} from the following code (greetings program):
/*
* Program: gretting2.c
* Utility: Display a greeting with your name.
* Author: Adrián Garro.
*/
#include <stdio.h>...
