## http 404 errorThe origin server did not find a current representation for the target resource or is not willing to disclose that one exists

I am new to spring mvc and I have done have everything proper seeing a tutorial.But still I am facing Http 404 error -The origin server did not find a current representation for the target resource or is not willing to disclose that one exists.why is that so?

I’m using IntelliJ IDE and tomcat server to run my code. under WEB-INF/ I have all dispatcher-servlet,jsp,web.xml file.

this is the controller class. I tried both the methods(/hello and /hi) but I’m not able to get successful results. @Controller

public class HelloController {     @RequestMapping("/hello")          public String printHello(ModelMap model) {         model.addAttribute("message", "Hello Spring MVC Framework!");         return "hello";     }     @RequestMapping("/hi")         public ModelAndView hiworld(){         ModelAndView modelAndView=new ModelAndView("hello");         modelAndView.addObject("message","hi bro its ok");         return modelAndView;     } } 

this the dispatcher-servlet.xml.

<bean class = "org.springframework.web.servlet.view.InternalResourceViewResolver">     <property name = "prefix" value = "/WEB-INF/" />     <property name = "suffix" value = ".jsp" /> </bean> 

this is my web.xml file Spring MVC Application

<servlet>     <servlet-name>dispatcher</servlet-name>     <servlet-class>         org.springframework.web.servlet.DispatcherServlet     </servlet-class>     <load-on-startup>1</load-on-startup> </servlet>  <servlet-mapping>     <servlet-name>dispatcher</servlet-name>     <url-pattern>/</url-pattern> </servlet-mapping> 

In hello.jsp file, I am printing the message

<body> <p>\$  {message}</p> </body> </html> 

expected result was the successful execution of jsp file. but I’m getting HTTP 404 ERROR-The origin server did not find a current representation for the target resource or is not willing to disclose that one exists.

## Unity Nunit testing cannot find my class objects

I have just recently updated my Unity application and am having some issues porting over (any of) my unit tests. It seems like none of my general class objects are available in these tests. I have tried numerous things and after searching online I have yet to find anything. Here is my setup…

Here is my Asset folder structure. I added the “Editor” folder and “GivenA” test via the test runner.

Here is how things look in VS.

And here are the Tests.asmdef file settings

All of this worked perfectly previous to my Unity update, any help would be GREATLY appreciated. If more info is needed, I can supply that as well. Thanks!

## initramfs fails to find root filesystem on recently updated system

On a recent installation of Ubuntu 18.04, the system has installed fine. However attempting to upgrade the systems kernel from kernel image 4.15.0-29-generic to 4.15.0-43-generic the kernel would panic due to no found root filesystem.

[   0.327121] md: Waiting for all devices to be available before autodetect [   0.327823] md: If you don't use raid, use raid=noautodetect [   0.328622] md: Autotecting RAID arrays. [   0.629322] md: autorun ... [   0.330013] md: ... autorun DONE. [   0.330722] VFS: Cannot open root device "UUID=<UUID>" or unknown-block(0,0): error -6 [   0.331434] Please append a correct "root=" boot option; here are the available partitions: [   0.332162] Kernel panic - not syncing: VFS: Unable to mount root fs on unknown-block(0,0) [   0.332878] CPU: 2 PID: 1 Comm: swapper/0 Not tained 4.15.0-43-generic #46-Ubuntu [   0.333599] Hardware name: To Be Filled By O.E.M. To Be Filled By O.E.M./X99 Extreme4, BIOS P2.00 06/01/2015 <KERNEL CALL TRACE> 

As you can see when attempting to load the filesystem from within the current initramfs (4.15.0-43-generic) no disks are detected. Switching back to the previous initramfs (4.15.0-29-generic) still allowed the root filesystem to be detected and loaded.

At a later point (several updates) even the 4.15.0-29-generic initramfs failed to find the root filesystem.

As of right now I have checked all disks to SMART, flashed the motherboard with an updated UEFI firmware, and performed multiple fscks against the filesystem. At this point the GPT layout looks fine, there are no filesystem errors, and SMART has come back with no disk faults or errors.

The only way I have found to continue booting the system is to pull the initramfs modules from the Ubuntu 18.04 Live CD and rebuilt the original initramfs for 4.15.0-29-generic. This process has at least been met with limited success in that I can once again boot the system albeit without any extra modules such as the nvidia display drivers.

Any suggestions would be appreciated.

## In Gmail, how can I find the oldest message from a person?

I want to find the first message that a specific person sent me, but I don’t know when that was – except that it was ages ago. I know I can use the search operator from:janedoe but the result is listed in reverse chronological order and the page indicator says 1-20 of hundreds.

Do I have to click “next page” fifty times, or is there another way to find out?

## Where can I find an Android Jetpack paging library source code? [on hold]

I want to see how android jetpack paging library is implemented. Where can I find an Android Jetpack paging library source code?

## Given a string S and a set of words D, find the longest word in D that is a subsequence of S

I’m trying to improve my code and algorithm to find out the longest word from a dictionary occurring as the sub-sequence in the given string.

Example : For example, given the input of S = “abppplee” and D = {“able”, “ale”, “apple”, “bale”, “kangaroo”} the correct output would be “apple”.

Currently my algorithm compares each character of the dictionary-word with the given-word and advances to next char in dictionary-word on finding a match and so on till either the dictionary-word is iterated over completely(which means the word is a valid sub-sequence) or the given word is iterated over completely(which means not a valid string).

Being a beginner to c++ and algorithms in general, my methods and logic could be further improved. So kindly suggest if any improvements in the algorithm or code which can improve the performance. Thanks.

#include <iostream> #include <string> #include <tuple> #include <vector>  class StringManipulater {   public:   StringManipulater(const std::string& p) : given_string_{p} {}   std::string given_string_;   std::tuple<std::string, typename std::string::size_type> current_longest_ = {       "", 0};    const std::string&& FindLongestSubSeq(const std::vector<std::string>& dict)   {     // flag determines whether current word is present in given_string input     bool flag;      // iterate through each of the dict-words     for (const std::string& word : dict) {       flag = false;       auto word_len = word.size();        // fair optimization : only consider current word if its       // length is greater than previous one       if (word_len > std::get<1>(this->current_longest_)) {         // iterate through the letters in both given string and current word         // to be compared         for (typename std::string::size_type i = 0, j = 0; j < word_len; ++i) {           // no need to go further checking if we have iterated over given           // string           if (i == this->given_string_.size()) break;            // compare each letter of both words           if (word[j] == given_string_[i]) {             flag = true;             // advance to next charcter in the dictionary word             ++j;           }           else {             // if the char couldn't be found             flag = false;           }         }  // end of comparison loop         if (flag) {           std::get<0>(this->current_longest_) = word;           std::get<1>(this->current_longest_) = word_len;         }       }  // top if     }    // end of iteration of dictionary words     return std::move(std::get<0>(this->current_longest_));   } };  int main() {   StringManipulater s_manip{"abppplee"};   std::cout << "Longest subsequence = "             << s_manip.FindLongestSubSeq(                    {"able", "ale", "apple", "bale", "kangaroo"})             << "\n";   return 0; } 

## Regular pentagon: find the minimal value of the expression

Find such a point $$X$$ on the plain of the regular pentagon $$ABCDE$$, that the value of expression $${XA+XB \over XC+XD+XE}$$ is the lowest.

I tried using Ptolemy’s theorem but don’t know how to make use of inequalities it gives…

I’d be really grateful for any help 🙂

## Powershell script to find sites having property bag in sharepoint 2013

We are using SharePoint 2013 and there is one property bag having key as “DATA”. i want a powershell script to know in what all sites this “DATA” property is there and what is the value of this in those sites. I dont want any other property bag result.Please help