|
Black holes. Worm holes.
"(I) am amazed to see myself here rather than there ... now rather than then".
― Blaise Pascal
|
|
|
|
|
Architecture of his thoughts? Well, the four major urges will still be determining his being. Untill a professor steals his browser-history we will not know wheter he thinks as often about sex as the average man.
Bastard Programmer from Hell 
If you can't read my code, try converting it here[^]
|
|
|
|
|
Foxxx F wrote: our master asked me
And how is someone else giving you the conceptual idea going to help you going to fit that criteria.
I do think you are safe asking this question on a geek site, an architecture professor is unlikely to be browsing the forums 
Never underestimate the power of human stupidity
RAH
|
|
|
|
|
Hi, I'm looking for a classic and simple N-Tier design using earlier .NET architecture rather than MVC. I haven't done this for years.
I was thinking of having a class with my table structure in terms of the properties/fields. Then maybe having a separate DAL class for the methods such as Read, Save, Update and Delete. In terms of the class design, if I have several tables using the same methods, is there a particular design I should follow.
I realise there are many ways of achieving this but I'm looking for something simple that junior developers can follow easily. Can somebody please recommend or maybe offer a link to a good article for this? Thanks
|
|
|
|
|
I need to design a system where I need to check if a key exists or not.
Currently I am already using aerospike for the cause but my use case is slightly different.
I will have a key like this ( A group of 3 integers)
<clientid>-<campaignid>-<userid>
For eg.
1-105-1133441
222-1000-1891893
I just need to know if this key exists or not in the set.
If exists return 1 else set the key and return 0. So that next time the query will return 1
This has to be a tcp service because the checks/set will happen from multiple servers
The point is if a campaign is live the queries will be very dense ( upto 20k/s ). So the key lookup has to be in memory. But after that I still have to retain the set but it has to be on disk , so that memory can be freed up for other campaigns. I do not expect more that 20-30 campaigns to be live.
Whenever the next time an old campaign gets a query again , the server should bring it back to memory and serve the requests from memory. The first query will be slow because it has to kickoff a read from disk but next query onwards will be very fast.
I am using aerospike for now , but there is a problem that aeorspike stores all keys in memory. When it is practically useless to have old campaigns in memory unless they get triggered again
The total number of keys is practially unlimited. But let us consider 50 million keys per campaign and I may need to store 100k campaign data. Of which only < 50 will be live at any given point of time.
Any ideas how I can implement this
So what should I use for this
|
|
|
|
|
A 16GB machine can keep 50 campaigns completely in memory. Transfering compressed keys from files to memory is not an issue. Paging will handle any extras.
"(I) am amazed to see myself here rather than there ... now rather than then".
― Blaise Pascal
|
|
|
|
|
i apologize if this is not the right forum.
We are looking to have 2 programs developed that will auto generate the following 2 puzzle types:
1. Word Search Puzzle -
* auto-generate a word-search puzzle (without curse words embedded),
* based on a list of words (up to 30 words)
* 15 letters across x 15 letters down
* words at least 3-letters in length
* answer key
2. Crossword Puzzle -
* auto-generate a crossword puzzle (without curse words embedded),
* based on a list of clues(approx 60-70 clues up + 60-70 clues down)
* words at least 3-letters in length
* answer key
|
|
|
|
|
Not only is this not the right forum, it's not the right site. If you are looking for someone to write code for you, try rentacoder.
This space for rent
|
|
|
|
|
When you get stuck on a specific part of the code then come back and ask and we'll gladly help you through it; but no, no one is going to write all this code for you.
There are two kinds of people in the world: those who can extrapolate from incomplete data.
There are only 10 types of people in the world, those who understand binary and those who don't.
|
|
|
|
|
Hello all,
I have just moved from Windows environment to Linux, and have been asked to update a project - still learning but tips would be helpful!
I have a directory structure:
RootMakefile.mk
.
.--\GUI1 (Folder)
. |
--dataprep(Folder)
. ---makefile1.mk
--config(Folder)
.--\GUI2 (Folder)
. |
--dataprep(Folder)
....makefile2.mk
--config(Folder)
.
.---\GUI(n) (Folder)
|
--dataprep(Folder)
....makefile(n).mk
--config(Folder)
makefile1.mk...makefile(n).mk are similar with just the variables within changing the paths, and the task is to move all makefiles to the root so they don't need to updated each time a new GUI is added to the project.
I changed the root makefile as following:
GUI_PATH := $(wildcard GUI*/)
TARGET_FILE := GuiDetails.rb
ACTIVE_GUIS := $(filter %, $(wildcard SMA*/$(TARGET_FILE)))
GUIS_OF_INTEREST := $(filter %, $(dir $(ACTIVE_GUIS)))
DATAPREP_FOLDER := dataprep
CONFIG_FOLDER := config
DATAPREP_PATHS := $(foreach GUIS_OF_INTEREST,$(GUIS_OF_INTEREST), $(GUIS_OF_INTEREST)$(DATAPREP_FOLDER))
CONFIG_PATHS := $(foreach GUIS_OF_INTEREST,$(GUIS_OF_INTEREST), $(GUIS_OF_INTEREST)$(CONFIG_FOLDER))
Now I seem to have all the folders that containing the Target file and so the makefile(1)...makefile(n), tried this to make sure:
test:
$(warning The following paths have guis $(GUIS_OF_INTEREST))
$(warning The following gui paths have dataprep $(foreach GUIS_OF_INTEREST, $(GUIS_OF_INTEREST), $(GUIS_OF_INTEREST)$(DATAPREP_FOLDER)))
$(warning The following gui paths have config $(foreach GUIS_OF_INTEREST, $(GUIS_OF_INTEREST), $(GUIS_OF_INTEREST)$(CONFIG_FOLDER)))
Is there a way now to move the makefiles within the folders to the root, and change the path variables dynamically so the guis can be generated for all different folders from a single makefile?
examples are:
(Within .\GUI1):
$(call DEF_RULES,GUI1,nodll)
$(call INCL,dataprep)
(Within .\GUI1\dataprep\):
GUI1_ALL:=$(call CANONICAL_PATH,$(GUI1_CONFIG)/GUI1_generated.txt)
GUI1_GWM:=$(call CANONICAL_PATH,$(GUI1_CONFIG)/gwm.xml)
GUI1_SSH:=$(call CANONICAL_PATH,$(GUI1_CONFIG)/ssh.xml)
GUI1_SSH_SUB:=$(call CANONICAL_PATH,$(GUI1_CONFIG)/ssh_sub.xml)
GUI1_SSH_APPROACH:=$(call CANONICAL_PATH,$(GUI1_CONFIG)/ssh_approach.xml)
This would be helpful as new GUIs are added and all the variables in the nested makefile don't have to updated with the new GUI path. The number of GUIs will increase as the project progresses.
Thanks in advance! I know this might sound really novice, but this is the first time I have had to use makefile and really would appreciate the help!
|
|
|
|
|
|
Thanks! It was not my intention, the original post was sent to the spam folder:
Your message 'Make a general makefile at root to search subdirectories and pick the path variables' has been marked as potentially being spam and is currently in the moderation queue pending approval.
That's why I reposted it.
|
|
|
|
|
It hadn't "gone to the spam folder" - it was in a queue to be reviewed. I think it was me that actually cleared it to be posted. Just be patient ... we're all volunteers here. Don't take it personally by the way ... we have been hit very hard with spam in the past and the filters are still learning... which is why there is always a human asked to check 
|
|
|
|
|
Thanks CHill60! Appreciate the effort! 
Will keep in mind to wait before reposting!
|
|
|
|
|
We used TFS 2015 in our company. There were many branches in our project and we made separate build definition for every branch. So, we had quite a large number of build definitions. It was not good and we made one build definition for several branches. We could specify which branch to work with when starting a build.
For downloading source files we used "DownloadFiles" activity from:
clr-namespace:Microsoft.TeamFoundation.Build.Workflow.Activities;assembly=Microsoft.TeamFoundation.Build.Workflow
It worked fine. Until we moved to TFS 2017.
Downloading files began taking twice as much time from that moment. If it had taken 10 minutes before it began to take 20 minutes then.
Build definitions which continue to use "TfsBuild" activity work fine and quickly. Although "DownloadFiles" and "TfsBuild" have the same internal logic for downloading files. Only "DownloadFiles" activity works slowly. Nothing changed in build definitions. Only TFS version.
Any ideas what can be the reason of downloading files running slowly?
Thanks.
|
|
|
|
|
Hi! Sorry for a simple question but I know nothing and have to create a table that I will put on my site in wordpress. I don't want a simple table like from excel. is there any good tool? I read somewhere that coding is needed but I know nothing about coding. thank you for your help.
|
|
|
|
|
You haven't explained what you want, if not a table like that from Excel.
The difficult we do right away...
...the impossible takes slightly longer.
|
|
|
|
|
|
I don't want a "simple table like from Excel" ... ?
You can "style" Excel sheets / tables any way you want. There are also "thousands" of templates available.
You can then "save as" HTML.
That is "simple"; beyond that, you can have Excel generate tabs; navigation; etc.
"(I) am amazed to see myself here rather than there ... now rather than then".
― Blaise Pascal
|
|
|
|
|
We need more info. Do you mean a table in a database that will store information? Or do you mean a table of information printed out on a web page?
If you mean the latter, then yes, WordPress has tools to add images, tables, fields, etc. It is where you create your pages. I don't have access so I can't walk you through it but it should be pretty easy to find.
There are two kinds of people in the world: those who can extrapolate from incomplete data.
There are only 10 types of people in the world, those who understand binary and those who don't.
|
|
|
|
|
I thinks that unity containers should check child containers instead of the parent container.
That way, during registration after the manager registers global modules, it can pass a child container to every module to register it's services.
Then resolution can then be done using the parent container after it's wrapped in an IServiceLocator.
What do you think?
The only way of discovering the limits of the possible is to venture a little way past them into the impossible.
|
|
|
|
|
Why would you be wrapping the parent container in a service locator? You're providing IoC and then subverting it by using service location.
This space for rent
|
|
|
|
|
'Cause in resolution you don't want modules changing other modules services.
The only way of discovering the limits of the possible is to venture a little way past them into the impossible.
|
|
|
|
|
I wasn't talking about the child container part - I got that. It was the use of the service locator I was questioning.
This space for rent
|
|
|
|
|
IServiceLocator does not have a RegisterService(). So all modules will be able to use the services registered on the parent container (and child containers) without being able to block the configuration of child containers by adding services to the parent.
The only way of discovering the limits of the possible is to venture a little way past them into the impossible.
|
|
|
|
General 
News 
Suggestion 
Question 
Bug 
Answer 
Joke 
Praise 
Rant 
Admin 
Submit an article or tip
