java.awt.EventQueue.invokeLater(new Runnable() {
@Override //myFrame is object of Window or JFrame
public void run() {
myFrame.toFront();
myFrame.repaint();
}
});
public static T[] concat(T[] first, T[] second) {
T[] result = Arrays.copyOf(first, first.length + second.length);
System.arraycopy(second, 0, result, first.length, second.length);
return result;
}
BufferedImage myPicture = ImageIO.read(new File("path-to-file"));
JLabel picLabel = new JLabel(new ImageIcon( myPicture ));
add( picLabel );
:Dimport java.io.*;
import java.net.*;
import java.util.*;
/**
* This program makes a socket connection to the atomic clock in Boulder,
* Colorado, and prints the time that the server sends.
*/
public class Time_Server_Socket_Test_Java {
public static void main(String[] args) {
try {
Socket s = new Socket("time-A.timefreq.bldrdoc.gov", 13);
try {
InputStream inStream = s.getInputStream();
Scanner in = new Scanner(inStream);
while (in.hasNextLine()) {
String line = in.nextLine();
System.out.println(line);
}
} finally {
s.close();
}
} catch (IOException e) {
e.printStackTrace();
}
}
}
Mapmap = ...;
for (String key : map.keySet()) {
// ...
}
Pattern.quote("$5");
import java.util.HashSet;
import java.util.Set;
/**
* Override_Annotation_Usage_Example, from Effective Java
*/Method method = foo.getClass().getMethod("doSomething", null);
method.invoke(foo, null);
#include <stdio.h>
#include <iostream.h>
void bubbleSort(int *array,int length)//Bubble sort function
{
int i,j;
for(i=0;i<length;i++)
{
for(j=0;j<i;j++)
{
if(array[i]>array[j])
{
int temp=array[i]; //swap
array[i]=array[j];
array[j]=temp;
}
}
}
}
void printElements(int *array,int length) //print array elements
{
int i=0;
for(i=0;i<length;i++)
cout<<array[i]<<endl;
}
void main()
{
int a[]={9,6,5,23,2,6,2,7,1,8}; // array to sort
bubbleSort(a,10); //call to bubble sort
printElements(a,10); // print elements
}
#include<iostream.h>
#include<conio.h>
float f1(float ,float,float);
float f2(float, float ,float);
int main()
{
int i;/************** SIPMPSONS 1/3 RULE ***********************/
#include<iostream.h>
#include<conio.h>
#include<math.h>
float funct(float a);
int main()
{
char choice='y';
float f,x,h,a,b,sum;
clrscr();
cout<<"a & b ? ";cin>>a>>b;
do
{
sum=0;
x=a;
cout<<"Enter value of h ? ";cin>>h;
while(x<b)
{
sum+=(funct(x)+4*funct(x+h)+funct(x+2*h));
x=x+2*h;
}
cout<<endl<<"The integration is: "<<sum*h/3<<endl;
cout<<endl<<"wanna continue (y/n) ? ";cin>>choice;
}while(choice=='y');
getch();
return 0;
}
float funct(float x)
{
return x*exp(x)-2; // sin takes arguments in radian........
}
/************* TRAPEZOID FULE FOR INTEGRATION *****************/
#include<iostream.h>
#include<conio.h>
#include<math.h>
float funct(float a);
int main()
{
char choice='y';
float f,x,h,a,b,sum;
clrscr();
cout<<"a & b ? ";cin>>a>>b;
do{
sum=0;
x=a;
cout<<"Enter value of h ? ";cin>>h;
while(x<b)
{
sum+=(funct(x)+funct(x+h));
x=x+h;
}
cout<<endl<<"The integration is: "<<sum*h/2<<endl;
cout<<endl<<"wanna continue (y/n) ? ";cin>>choice;
} while(choice=='y');
getch();
return 0;
}
float funct(float x)
{
return x*exp(x)-2; // sin takes arguments in radian........
}
/************************ INTEGRATION FOR TABULAR DATA *****************/
#include<iostream.h>
#include<conio.h>
int main()
{
int n,i;
float x[10],f[10],h,sum=0,a;
clrscr();
cout<<"No of datas ? ";cin>>n;
cout<<"Enter datas : ";
for(i=0;i<n;i++)
cin>>x[i]>>f[i];
for(i=0;i<n;i++)
{
if(i==0||i==n-1)
sum+=f[i];
else
sum+=2*f[i];
}
h=x[1]-x[0];
cout<<"The value using trapezoide: "<<h*sum/2;
a=x[0];
sum=0;
while((a-h)<x[n])
{
sum+=(f[a]+4*f[a+h]+f[a+2*h]);
a+=2*h;
}
cout<<"\nThe value using simpsons 1/3 is : "<<h*sum/3;
getch();
return 0;
}
/************* Eigen value and eigen vector by Power method ***********/
#include<iostream.h>
#include<conio.h>
#include<math.h>
#include<stdlib.h>
int main()
{
float a[10][10],x[10],c[10],d=0,temp;
int n,i,j;/*************** Gauss Jordan method ********************/
#include<iostream.h>
#include<conio.h>
int main()
{
int i,j,k,n;
float a[10][10],d;
clrscr();
cout<<"No of equations ? ";cin>>n;
cout<<"Read all coefficients of matrix with b matrix too "<<endl;
for(i=1;i<=n;i++) // read nxn matrix - cofficients
for(j=1;j<=n+1;j++)
cin>>a[i][j];
/************** partial pivoting **************/
for(i=n;i>1;i--)
{
if(a[i-1][1]<a[i][1])
for(j=1;j<=n+1;j++)
{
d=a[i][j];
a[i][j]=a[i-1][j];
a[i-1][j]=d;
}
}
cout<<"pivoted output: "<<endl;
for(i=1;i<=n;i++)
{
for(j=1;j<=n+1;j++)
cout<<a[i][j]<<" ";
cout<<endl;
}
/********** reducing to diagonal matrix ***********/
for(i=1;i<=n;i++)
{
for(j=1;j<=n;j++)
if(j!=i)
{
d=a[j][i]/a[i][i];
for(k=1;k<=n+1;k++)
a[j][k]-=a[i][k]*d;
}
}
/************** reducing to unit matrix *************/
for(i=1;i<=n;i++)
{
d=a[i][i];
for(j=1;j<=n+1;j++)
a[i][j]=a[i][j]/d;
}
cout<<"your solutions: "<<endl;
for(i=1;i<=n;i++)
{
for(j=1;j<=n+1;j++)
cout<<a[i][j]<<" ";
cout<<endl;
}
getch();
return 0;
}
/*************** Gauss Jordan method for inverse matrix ********************/
#include<iostream.h>
#include<conio.h>
int main()
{
int i,j,k,n;
float a[10][10]={0},d;
clrscr();
/************** LU Decomposition for solving linear equations ***********/
#include<iostream.h>
#include<conio.h>
int main()
{
int n,i,k,j,p;
float a[10][10],l[10][10]={0},u[10][10]={0},sum,b[10],z[10]={0},x[10]={0};
clrscr();
cout<<"Enter the order of matrix ! ";
cin>>n;
/************* Gauss elimination for solving linear equations *************/
#include<iostream.h>
#include<stdio.h>
#include<conio.h>
#include<math.h>
int main()
{
int n,i,j,k,temp;
float a[10][10],c,d[10]={0};
clrscr();
cout<<"No of equation ? ";
cin>>n;/*************** least square fitting ******************/
#include<iostream.h>
#include<conio.h>
#include<math.h>
int main()
{
int n,i,j;
float a,a0,a1,x[10],f[10],sumx=0,sumy=0,sumxy=0,sumx2=0;
clrscr();
cout<<"Enter no of sample points ? ";cin>>n;/********** Lagrange's interpolation ***************/
#include<iostream.h>
#include<conio.h>
int main()
{
int n,i,j;
float mult,sum=0,x[10],f[10],a;
clrscr();/***************** Newtons interpolation **************/
#include<iostream.h>
#include<conio.h>
int main()
{
int n,i,j;
float x[10],f[10],a,sum=0,mult;
clrscr();/********************* Cubic Spline Interpolation **********************/
#include<iostream.h>
#include<conio.h>
#include<math.h>
int main()
{
char choice='y';
int n,i,j,k;//horner's polynomial soln, synthetic division
#include <iostream.h>
#include <conio.h>
#include <complex.h>
void main()
{
int it,n;
complex a[10],b[10],c[10],x;
clrscr();
cout<<"Enter the degree of the polynomial:";
cin>>n;/***************** Newton horner's method ******************/
#include<iostream.h>
#include<conio.h>
#include<complex.h>
#include<math.h>
int main()
{
complex a[20],b[20],c[20];
complex x;
int n,i;
clrscr();
/***************** NUMERICAL DIFFERENTION *********************/
#include<iostream.h>
#include<conio.h>
#include<math.h>
float funct(float a);
int main()
{
char choice='y';#include<iostream.h>
#include<conio.h>
#include<math.h>
float funct(float);
int main()
{/*Newton Rapsons method : for solving non linear equations*/
#include<iostream.h>
#include<conio.h>
#include<math.h>
double funct(double);
double derv(double);