Search Results

Search found 25727 results on 1030 pages for 'solution'.

Page 669/1030 | < Previous Page | 665 666 667 668 669 670 671 672 673 674 675 676  | Next Page >

• How to Generate Edifact message from a xml ?

  - by Clem

  Hello, I'm currently dealing with customs messages Beans in Java. After filling in the Beans with different values, I want to produce an EDIFACT CUSDEC message corresponding to each message. For each attribute of a message Bean, I have the information to put the attribute in the right place in EDIFACT CUSEDC format. Thus, I am looking for a free tool (a Java API) which could ideally convert my full-filled Bean into an EDIFACT CUSDEC message. I found a commercial solution (not free) there : http://www.datadirect.com/products/edifact-grid/index.ssp And a quick tutorial here : http://biemond.blogspot.com/2008/09/generate-edifact-message-from-xml.html But ... unfortunately it is not free.. Thanks in advance for your help!

  Read the article

• implmenting 1 to n mapping for ORM c++

  - by karan

  I am writing a project where i need to implment a stripped down version of an ORM solution in c++. I am struck in implmenting 1-n relationships for the same. For instance, if following are the classes: class A { } class B { std::list _a_list; } I have provided load/save menthods for loading/saving to the db. Now, if i take the case of B : Say , for the following workflow : 1 entry from _a_list is removed 1 entry from _a_list is modified 1 entry is added to _a_list Now, i need to update the db using something like "b.save()". So, what would be the best way to save the changes,i.e, identify the additions, deletions and updations to _a_list.

  Read the article

• Find all paths from root to leaves of tree in Scheme

  - by grifaton

  Given a tree, I want to find the paths from the root to each leaf. So, for this tree: D / B / \ A E \ C-F-G has the following paths from root (A) to leaves (D, E, G): (A B D), (A B E), (A C F G) If I represent the tree above as (A (B D E) (C (F G))) then the function g does the trick: (define (g tree) (cond ((empty? tree) '()) ((pair? tree) (map (lambda (path) (if (pair? path) (cons (car tree) path) (cons (car tree) (list path)))) (map2 g (cdr tree)))) (else (list tree)))) (define (map2 fn lst) (if (empty? lst) '() (append (fn (car lst)) (map2 fn (cdr lst))))) But this looks all wrong. I've not had to do this kind of thinking for a while, but I feel there should be a neater way of doing it. Any ideas for a better solution (in any language) would be appreciated.

  Read the article

• How to format a string as a telephone number in C#

  - by Brian G

  I have a string "1112224444' it is a telephone number. I want to format as 111-222-4444 before I store it in a file. It is on a datarecord and I would prefer to be able to do this without assigning a new variable. I was thinking: String.Format("{0:###-###-####}", i["MyPhone"].ToString() ); but that does not seem to do the trick. ** UPDATE ** Ok. I went with this solution Convert.ToInt64(i["Customer Phone"]).ToString("###-###-#### ####") Now its gets messed up when the extension is less than 4 digits. It will fill in the numbers from the right. so 1112224444 333 becomes 11-221-244 3334 Any ideas?

  Read the article

• Merging MySQL Structure and Data

  - by Shahid

  I have a MySQL database running on a deployment machine which also contains data. Then I have another MySQL database which has evolved in terms of STRUCTURE + DATA for some time. I need a way to merge the changes (ONLY) for both structure and data to the DB in deployment machine without disturbing the existing data. Does anyone know of a tool available which can do this safely. I have had a look at a few comparison tools but I need a tool which can automate the merge operation. Note also that most of the data in the tables is in BINARY so I can't use many file comparison tools. Does any one know of a solution to this? thanks

  Read the article

• jQuery Validate - Require at least one from group, plus additional items.

  - by Kevin Pullin

  I'm attempting to use 'jQuery Validate' on a form that requires an email address plus either all items of a shipping address completed or none at all. Using the sample provided by the solution to this question: jQuery Validate - “Either skip these fields, or fill at least X of them”, I have been able to successfully solve the validation of the address group. The problem, however, is that the logic for validating the email address field does not work. From debugging the Validate scripts, the "re-entrant" validation code triggered by calling 'fields.data('being_validated', true).valid();' in the linked example results in a reset of all previously validated errors (i.e. the email validation error is cleared). I have modified some existing samples, the first in which removes the offending line and the second with it included. Email Validation Working Email Validation Fails Any tips or suggestions on how to properly solve this or work around the failure?

  Read the article

• Script.PostDeployment.sql not executing in CI build VS 2010

  - by Suirtimed

  I have a database project in VS 2010 (SQL 2008). The local Deploy Solution action works and executes all of the SQL in the Script.PostDeployment.sql file. When I check changes in, the Build Definition for the continuous integration server executes. The database is deployed into the CI environment, but the PostDeployment script doesn't get executed. I wasn't able to find anything specific to this particular scenario. I also expect I'll need to provide additional information unless this is a trivial problem that I missed somewhere. Additional Information: The build is executing vsdbcmd.exe to deploy. The deployment manifest references the PostDeployment.sql file and it's present in the path with the rest of the files. Here is a reference to a thread on social.msdn.microsoft.com regarding this problem.

  Read the article

• Split a map using Groovy

  - by Tihom

  I want to split up a map into an array of maps. For example, if there is a map with 25 key/value pairs. I want an array of maps with no more than 10 elements in each map. How would I do this in groovy? I have a solution which I am not excited about, is there better groovy version: static def splitMap(m, count){ if (!m) return def keys = m.keySet().toList() def result = [] def num = Math.ceil(m?.size() / count) (1..num).each { def min = (it - 1) * count def max = it * count > keys.size() ? keys.size() - 1 : it * count - 1 result[it - 1] = [:] keys[min..max].each {k -> result[it - 1][k] = m[k] } } result } m is the map. Count is the max number of elements within the map.

  Read the article

• TeamCity Multi-Part Build - How to checkout the code just once

  - by Jeff D

  I am trying to create 1 package with multiple build configurations. The first will checkout the code, build it (Solution File configuration), and run nunit tests. If that succeeds, another will then build in release mode. If that succeeds, a final script witll package up the output, and mark it as an artifact. The problem I'm having is that I don't know how to tell TeamCity not to create new directories for each step, and as a result, the steps are failing. Is there a setting for this? It seems like the dependencies tab would be an appropriate place to look, but I don't seem to understand the instructions, and my tinkering so far has been fruitless.

  Read the article

• Spring 3 MVC : problem with form:errors and bindingresult

  - by Maxime ARNSTAMM

  Hi, I want to validate my inputs but i can't make it work : nothing appear on the page. My project is in java 5, so no JSR303 (@Valid). My only solution, if i'm not mistaken, is to use BindingResult. My controller : @Controller public class MyController { @RequestMapping(method = RequestMethod.POST, value = "myPage.html") public void myHandler(MyForm myForm, BindingResult result, Model model) { result.reject("field1", "error message 1"); } } My jsp : <form:form commandName="myForm" method="post"> <label>Field 1 : </label> <form:input path="field1" /> <form:errors path="field1" /> <input type="submit" value="Post" /> </form:form> What am i missing ? Thanks !

  Read the article

• Using JSF, JPA and DAO. Without Spring?

  - by ich-bin-drin

  Hi, till now i still worked with JSF and JPA without DAOs. Now i'd like to use DAOs. But how can i initialize the EntityManager in the DAO-Classes? public class AdresseHome { @PersistenceContext private EntityManager entityManager; public void persist(Adresse transientInstance) { log.debug("persisting Adresse instance"); try { entityManager.persist(transientInstance); log.debug("persist successful"); } catch (RuntimeException re) { log.error("persist failed", re); throw re; } } } Have I to use Spring or is there a solution that works without Spring? Thanks.

  Read the article

• What are the pre-requisites to become a Business Developer

  - by T.Raghavendra

  I am not sure if this is the right portal, But i believe many entrepreneurs are available here. I wanted to know how can someone get in to business development. what are the factors that are necessary if the person has no MBA degree. is it possible to get into such profession. I mean is it just the fact you must know how to write RFP, or estimates. Understanding client requirements and getting them the best available solution. Please guide me as I am interested, with 5+ years of industry experience is it possible to move to different domain.

  Read the article

• How can you set a time limit for a PowerShell script to run for?

  - by calrain

  I want to set a time limit on a PowerShell (v2) script so it forcibly exits after that time limit has expired. I see in PHP they have commands like set_time_limit and max_execution_time where you can limit how long the script and even a function can execute for. With my script, a do/while loop that is looking at the time isn't appropriate as I am calling an external code library that can just hang for a long time. I want to limit a block of code and only allow it to run for x seconds, after which I will terminate that code block and return a response to the user that the script timed out. I have looked at background jobs but they operate in a different thread so won't have kill rights over the parent thread. Has anyone dealt with this or have a solution? Thanks!

  Read the article

• jQuery: datepicker - Calendar activated by the icon and the date field at the same time

  - by Ricardo Zea

  Hello, I've already looked around but couldn't find the exact solution/problem I'm having right now. All I want is to have the calendar appear either by clicking on the calendar icon AND from the text field in which the date appears when selecting a date. Right now, after trying different properties, I can only have the calendar appear by one or the other, but not both: the icon and the field. This is the code I'm using to activate it via the icon: $("#datepicker").datepicker({ showOn: 'button', buttonImage: 'images/icon-calendar.gif', buttonImageOnly: true, changeMonth: true, changeYear: true, showAnim: 'slideDown', duration: 'fast' }); Is there a way to have the calendar appear by clicking on the icon AND the field as well? Thanks.

  Read the article

• advanced python autovivification

  - by Zhang18

  This question is about implementing the full PERL autovivification in python. I know similary questions were asked before and so far the best answre is http://stackoverflow.com/questions/635483/what-is-the-best-way-to-implement-nested-dictionaries-in-python/652284#652284. However, I'm looking to do this: a['x']['y'].append('z') without declaring a['x']['y'] = [] first, or rather, not declaring a['x'] = {} either. I know dict and list classes sorta don't mix so this is hard, but I'm interested in seeing if someone has an ingenius solution probably involving creating an inherited class from dict but defined a new append method on it? I also know this might throw off some python purists who will ask me to stick with Perl. But even just for a challenge, I'd like to see something. thx!

  Read the article

• How do I query/filter a to-many relationship in Core Data

  - by Kris Bixler

  I have Customer, Event and Address objects in my data model. Both Customer and Address have a one-to-many relationship to Event. I can get the distinct list of addresses for a customer's events for by doing this: NSSet *addressSet = [customer valueForKeyPath:@"events.address"]; For the part of the UI I'm working on now, I need to display the address from the most recent event prior to now that has an address. I'm starting to go down the path of creating a NSFetchRequest, setting it's entity, sort descriptors, predicate and then looping through the results, but it seems like a lot of code. Am I missing some obvious way of filtering/sorting on the "events" relationship of the Customer object or is creating the NSFetchRequest the best solution?

  Read the article

• Convert Null Value to String - C#.NET

  - by peace

  foreach (PropertyInfo PropertyItem in this.GetType().GetProperties()) { PropertyItem.SetValue(this, objDataTable.Rows[0][PropertyItem.Name.ToString()], null); } In one of the loops i get this exceptional error: Object of type 'System.DBNull' cannot be converted to type 'System.String'. The error occurs because one of the fields in the database has no value (null), so the string property could not handle it. How can i convert this null to string? I got this solution If you know a shorter or better one, feel free to post it. I'm trying to avoid checking on every loop is current value is null or not.

  Read the article

• Clone DB table row through MVC in MSSQL

  - by sslepian

  Is there a simple solution for duplicating table rows in MSSQL as well as all table rows with foreign keys pointing to the cloned table row? I've got a "master" table and a bunch of "child" tables which have a foreign key into the ID of the master table. I need to not only create a perfect copy of the master table, but clone each and every child table referencing the master table. Is there a simpler way to do this than creating a new row in the master table, copying in the information from the row to be cloned, then going through each child table and doing the same with each row pointing to the cloned row in the master table? I'm using a MSSQL 2005 Database accessed through C# ASP.net MVC 1.0.

  Read the article

• How to apply patterns when not all team members can follow them

  - by michael moore

  We're going to start a new huge project and while it's in the process of architecting the system, I have certain doubts whether I can apply patterns and be sure they won't be violated by team members. The problem is, not all team members have enough skills to develop asp.net apps let's say using MVP pattern. So maybe this question is addressed to Team leads, or experienced devs. Did you dealt with this kind of situation, and if so what was your solution. I was thinking to create the core by myself, and let 'em start building upon that core, however I'm not sure it will work out.

  Read the article

• problem in interceptor executing before action in struts2

  - by vivmal

  Hi All, I am working on struts2. I have an interceptor that executes before my action claas. Now when I submit on a jsp page control goes to interceptor and after some processing there the control goes to action class. This complete flow is running well. But I found two things – 1) Control does not go to action-validation.xml before going to action class. 2) Its not getting the values of textfield or etc that uses has entered into jsp page before submitting. Can anyone tell me how to find solution for these two points. Thanks in advance.

  Read the article

• Given an even number of vertices, how to find an optimum set of pairs based on proximity?

  - by Alex Z

  The problem: We have a set of n vertices in 3D euclidean space, and there is an even number of these vertices. We want to pair them up based on their proximity. In other words, we'd like to be able to find a set of vertex pairs, where the vertices in each pair are as close as possible together. We want to minimise sacrificing the proximity between the vertices of any other pairs as much as possible in doing this. I am not looking for the most optimal solution (if it even strictly exists/can be done), just a reasonable one that can be computed relatively quickly. A relatively awful brute force approach involves choosing a vertex and looping through the rest to find its nearest neighbor and then repeating until there are none left. Of course as we near the end of the list the closest vertex could be very far away, but it is the only choice, therefore this can fail badly on the third point above.

  Read the article

• Push notification does not happening when app is not running - android

  - by iShare

  I am using Urban Airship for Push notification. Its works like a charm but just found that its did not sending push notification when application is not running. How to handle this? I am sure its a common scenario and there will be a solution. I checked many posts in stack overflow but most of them are for iOS. I want for Android AirshipConfigOptions options = AirshipConfigOptions.loadDefaultOptions(this); UAirship.takeOff(this, options); Logger.logLevel = Log.VERBOSE; PushManager.shared().setIntentReceiver(IntentReceiver.class); PushManager.enablePush();

  Read the article

• Replace CR/LF in a text file only after a certain column

  - by Olav

  I have a large text file I would like to put on my ebook-reader, but the formatting becomes all wrong because all lines are hard wrapped at or before column 80 with CR/LF, and paragraphs/headers are not marked differently, only a single CR/LF there too. What I would like is to replace all CR/LF's after column 75 with a space. That would make most paragraphs continuous. (Not a perfect solution, but a lot better to read.) Is it possible to do this with a regex? Preferably a (linux) perl or sed oneliner, alternatively a Notepad++ regex.

  Read the article

• Implementation of a distance matrix of a binary tree that is given in the adjacency-list representation

  - by Denise Giubilei

  Given this problem I need an O(n²) implementation of this algorithm: "Let v be an arbitrary leaf in a binary tree T, and w be the only vertex connected to v. If we remove v, we are left with a smaller tree T'. The distance between v and any vertex u in T' is 1 plus the distance between w and u." This is a problem and solution of a Manber's exercise (Exercise 5.12 from U. Manber, Algorithms: A Creative Approach, Addison-Wesley (1989).). The thing is that I can't deal properly with the adjacency-list representation so that the implementation of this algorithm results in a real O(n²) complexity. Any ideas of how the implementation should be? Thanks.

  Read the article

• How to access project files from NUnit tests

  - by Daren Thomas

  I have some Tests that I run with ReSharpers "Run All Tests from Solution" feature. One of the classes being tested has a dependency on a file in the same folder as the assembly containing it. This file is copied to the output directory via MSBuild (set "Copy To Output Directory" to "Copy always"). Problem: The tests are not being run from the normal assembly output directory, but instead some temporary location in my user profile. Therefore, I don't really know where to look for the file - the test runner does not copy it there. Can I force it to?

  Read the article

< Previous Page | 665 666 667 668 669 670 671 672 673 674 675 676  | Next Page >