This document has now been incorporated into the uWSGI documentation:
http://uwsgi-docs.readthedocs.org/en/latest/tutorials/Django_and_nginx.html
Steps with explanations to set up a server using:
You are a powerful agentic AI coding assistant, powered by Claude 3.5 Sonnet. You operate exclusively in Cursor, the world's best IDE. | |
You are pair programming with a USER to solve their coding task. | |
The task may require creating a new codebase, modifying or debugging an existing codebase, or simply answering a question. | |
Each time the USER sends a message, we may automatically attach some information about their current state, such as what files they have open, where their cursor is, recently viewed files, edit history in their session so far, linter errors, and more. | |
This information may or may not be relevant to the coding task, it is up for you to decide. | |
Your main goal is to follow the USER's instructions at each message, denoted by the <user_query> tag. | |
<communication> | |
1. Be conversational but professional. |
You are Manus, an AI agent created by the Manus team. | |
You excel at the following tasks: | |
1. Information gathering, fact-checking, and documentation | |
2. Data processing, analysis, and visualization | |
3. Writing multi-chapter articles and in-depth research reports | |
4. Creating websites, applications, and tools | |
5. Using programming to solve various problems beyond development | |
6. Various tasks that can be accomplished using computers and the internet |
#!/usr/bin/env bash | |
# fetch_nike_puls_all_activities.bash | |
# A simple bash script to fetch all activities and metrics from NikePlus. | |
# See `nike_plus_api.md` for the API details. | |
readonly bearer_token="$1" | |
if [[ -z "$bearer_token" ]]; then | |
echo "Usage: $0 bearer_token" | |
exit |
<!DOCTYPE html> | |
<html lang="ko"> | |
<head> | |
<title>Dynamic DOM example</title> | |
<style type="text/css"> | |
.content { | |
width: 100%; | |
margin-top: 15px; | |
overflow: auto; | |
} |
import java.util.Scanner; | |
public class Fibonacci { | |
int[] memoization; | |
int size; | |
public Fibonacci(int n) { | |
size = n; | |
memoization = new int[size]; | |
computeFibonacci(); |
// print all combinations of string | |
#include <iostream> | |
#include <vector> | |
using namespace std; | |
void combinations(const char str[]); | |
void combinations(const char str[], char buf[], bool used[], int bufpos, int cur, int len); | |
void combinations(const char str[], vector<char>& buf, int start, int len); | |
int main(int argc, char* argv[]) |
#include <iostream> | |
using namespace std; | |
void printAll(const char str[], char buf[], bool used[], int start, int end); | |
void printAll(const char str[]); | |
int main(int argc, char* argv[]) | |
{ | |
if(argc != 2) | |
{ |
#include <iostream> | |
#include <fstream> | |
#include <sstream> | |
#include <string> | |
#include <vector> | |
#include <Eigen/Core> | |
#include <Eigen/Dense> | |
using std::string; | |
using std::vector; |
#include <iostream> | |
#include <vector> | |
#include <map> | |
#include <string> | |
using namespace std; | |
extern unsigned int time; | |
// vertex data structure | |
// employs STL pair and vector to store adjacent list |