正文
java裁剪算法代码 java剪枝算法
提示：扫一扫查出行【扫一扫了解最新限行尾号】
复制提示
求个用JAVA或者C++写的AO*算法的程序
还有下面的
C++中AO裁剪关键代码
ITopologicalOperatorPtr ipTopolog(CLSID_Line);
long lCount = 0;
while (SUCCEEDED(ipSorCursor-NextFeature(ipFeature))
(NULL != ipFeature)) {
result = ipFeature-get_Shape(ipGeometry);
if (FAILED(result) || NULL == ipGeometry) {
TRACE("%ld\n", result);
continue;
}
((IZAwarePtr)ipGeometry)-put_ZAware(VARIANT_FALSE);
((IMAwarePtr)ipGeometry)-put_MAware(VARIANT_FALSE);
// 入库图形都需要裁剪才能入库的。
ipTopolog = ipGeometry;
result = ipTopolog-Intersect((IGeometryPtr)ipGridPolygon, esriGeometry1Dimension, ipResult);
if (FAILED(result) || NULL == ipResult) {
TRACE("%ld\n", result);
continue;
}
result = ipResult-get_IsEmpty(vb);
if (VARIANT_TRUE == vb) {
TRACE("%ld\n", result);
continue;
}
...
}
希望可以帮到你
相关问答
Q1: LZSS压缩算法的java代码
可以参考一下这个代码：
import java.io.*;
public class pack
{
public final static byte F_PACK_MAGIC[]={ 0x73,0x6C,0x68,0x21};
/* magic number for packed files */
public final static byte F_NOPACK_MAGIC[]= { 0x73, 0x6C, 0x68, 0x2E};
/* magic number for autodetect */
private static void usage()
{
System.out.print("\nFile compression utility for Allegro 3.12");
System.out.print("\nBy Shawn Hargreaves, Aug 1999. Java version by Radim Kolar, Dec 1999\n\n");
System.out.print("Usage: 'pack in out' to pack a file\n");
System.out.print(" 'pack u in out' to unpack a file\n");
System.exit(1);
}
public static void main(String argv[]) throws IOException
{
String t="";
String f1="",f2="";
InputStream in;
OutputStream out;
long s1,s2;
boolean pack=true;
if (argv.length==2) {
f1 = argv[0];
f2 = argv[1];
t = "Pack";
}
else if ((argv.length==3) (argv[0].length()==1)
((argv[0].charAt(0)=='u') || (argv[0].charAt(0)=='U'))) {
f1 = argv[1];
f2 = argv[2];
t = "Unpack";
pack=false;
}
else
usage();
if (f1.equals(f2))
{
System.out.println("\nError: Files must be different.");
System.exit(1);
}
in = null;
try
{
in = new FileInputStream(f1);
}
catch ( IOException i)
{
System.out.println("\nError: "+f1+" - Can't open.");
System.exit(1);
}
s1 = new File(f1).length();
/* handle magic */
if(!pack) {
byte magic[]=new byte[4];
in.read(magic);
int bad=0;
for(int i=2;i=0;i--)
if(magic[i]!=F_PACK_MAGIC[i])
bad=1;
if(bad==0)
if(magic[3]!=F_PACK_MAGIC[3])
if(magic[3]==F_NOPACK_MAGIC[3]) bad=2;
else bad=1;
if(bad==1)
{
System.out.println("\nError: "+f1+" - Not a packed file. (No magic)");
System.exit(1);
}
if(bad==0) in = new LZSSInputStream(in);
}
out = new FileOutputStream(f2);
if(pack)
{
out.write(F_PACK_MAGIC);
out = new LZSSOutputStream(out);
}
System.out.println(t+"ing "+f1+" into "+f2+"...");
byte b[]=new byte[512];
int i;
while ( (i=in.read(b))!=-1) {
out.write(b,0,i);
}
in.close();
out.close();
if (s1 0) {
s2 = new File(f2).length();
System.out.println("\nInput size: "+s1+"\nOutput size: "+s2+"\n"+(s2*100+(s11))/s1+"%");
}
return;
}
}
Q2: java 什么算法压缩文件最小
有三种方式实现java压缩：
1、jdk自带的包java.util.zip.ZipOutputStream，不足之处，文件（夹）名称带中文时，出现乱码问题，实现代码如下：
/**
* 功能：把 sourceDir 目录下的所有文件进行 zip 格式的压缩，保存为指定 zip 文件
* @param sourceDir 如果是目录，eg：D:\\MyEclipse\\first\\testFile，则压缩目录下所有文件；
* 如果是文件，eg：D:\\MyEclipse\\first\\testFile\\aa.zip，则只压缩本文件
* @param zipFile 最后压缩的文件路径和名称,eg:D:\\MyEclipse\\first\\testFile\\aa.zip
*/
public File doZip(String sourceDir, String zipFilePath) throws IOException {
File file = new File(sourceDir);
File zipFile = new File(zipFilePath);
ZipOutputStream zos = null;
try {
// 创建写出流操作
OutputStream os = new FileOutputStream(zipFile);
BufferedOutputStream bos = new BufferedOutputStream(os);
zos = new ZipOutputStream(bos);
String basePath = null;
// 获取目录
if(file.isDirectory()) {
basePath = file.getPath();
}else {
basePath = file.getParent();
}
zipFile(file, basePath, zos);
}finally {
if(zos != null) {
zos.closeEntry();
zos.close();
}
}
return zipFile;
}
/**
* @param source 源文件
* @param basePath
* @param zos
*/
private void zipFile(File source, String basePath, ZipOutputStream zos)
throws IOException {
File[] files = null;
if (source.isDirectory()) {
files = source.listFiles();
} else {
files = new File[1];
files[0] = source;
}
InputStream is = null;
String pathName;
byte[] buf = new byte[1024];
int length = 0;
try{
for(File file : files) {
if(file.isDirectory()) {
pathName = file.getPath().substring(basePath.length() + 1) + "/";
zos.putNextEntry(new ZipEntry(pathName));
zipFile(file, basePath, zos);
}else {
pathName = file.getPath().substring(basePath.length() + 1);
is = new FileInputStream(file);
BufferedInputStream bis = new BufferedInputStream(is);
zos.putNextEntry(new ZipEntry(pathName));
while ((length = bis.read(buf)) 0) {
zos.write(buf, 0, length);
}
}
}
}finally {
if(is != null) {
is.close();
}
}
}
2、使用org.apache.tools.zip.ZipOutputStream，代码如下，
package net.szh.zip;
import java.io.BufferedInputStream;
import java.io.File;
import java.io.FileInputStream;
import java.io.FileOutputStream;
import java.util.zip.CRC32;
import java.util.zip.CheckedOutputStream;
import org.apache.tools.zip.ZipEntry;
import org.apache.tools.zip.ZipOutputStream;
public class ZipCompressor {
static final int BUFFER = 8192;
private File zipFile;
public ZipCompressor(String pathName) {
zipFile = new File(pathName);
}
public void compress(String srcPathName) {
File file = new File(srcPathName);
if (!file.exists())
throw new RuntimeException(srcPathName + "不存在！");
try {
FileOutputStream fileOutputStream = new FileOutputStream(zipFile);
CheckedOutputStream cos = new CheckedOutputStream(fileOutputStream,
new CRC32());
ZipOutputStream out = new ZipOutputStream(cos);
String basedir = "";
compress(file, out, basedir);
out.close();
} catch (Exception e) {
throw new RuntimeException(e);
}
}
private void compress(File file, ZipOutputStream out, String basedir) {
/* 判断是目录还是文件 */
if (file.isDirectory()) {
System.out.println("压缩：" + basedir + file.getName());
this.compressDirectory(file, out, basedir);
} else {
System.out.println("压缩：" + basedir + file.getName());
this.compressFile(file, out, basedir);
}
}
/** 压缩一个目录 */
private void compressDirectory(File dir, ZipOutputStream out, String basedir) {
if (!dir.exists())
return;
File[] files = dir.listFiles();
for (int i = 0; i files.length; i++) {
/* 递归 */
compress(files[i], out, basedir + dir.getName() + "/");
}
}
/** 压缩一个文件 */
private void compressFile(File file, ZipOutputStream out, String basedir) {
if (!file.exists()) {
return;
}
try {
BufferedInputStream bis = new BufferedInputStream(
new FileInputStream(file));
ZipEntry entry = new ZipEntry(basedir + file.getName());
out.putNextEntry(entry);
int count;
byte data[] = new byte[BUFFER];
while ((count = bis.read(data, 0, BUFFER)) != -1) {
out.write(data, 0, count);
}
bis.close();
} catch (Exception e) {
throw new RuntimeException(e);
}
}
}
3、可以用ant中的org.apache.tools.ant.taskdefs.Zip来实现，更加简单。
package net.szh.zip;
import java.io.File;
import org.apache.tools.ant.Project;
import org.apache.tools.ant.taskdefs.Zip;
import org.apache.tools.ant.types.FileSet;
public class ZipCompressorByAnt {
private File zipFile;
public ZipCompressorByAnt(String pathName) {
zipFile = new File(pathName);
}
public void compress(String srcPathName) {
File srcdir = new File(srcPathName);
if (!srcdir.exists())
throw new RuntimeException(srcPathName + "不存在！");
Project prj = new Project();
Zip zip = new Zip();
zip.setProject(prj);
zip.setDestFile(zipFile);
FileSet fileSet = new FileSet();
fileSet.setProject(prj);
fileSet.setDir(srcdir);
//fileSet.setIncludes("**/*.java"); 包括哪些文件或文件夹 eg:zip.setIncludes("*.java");
//fileSet.setExcludes(...); 排除哪些文件或文件夹
zip.addFileset(fileSet);
zip.execute();
}
}
测试一下
package net.szh.zip;
public class TestZip {
public static void main(String[] args) {
ZipCompressor zc = new ZipCompressor("E:\\szhzip.zip");
zc.compress("E:\\test");
ZipCompressorByAnt zca = new ZipCompressorByAnt("E:\\szhzipant.zip");
zca.compress("E:\\test");
}
}
Q3: 寻求一个面板切割最优解的算法，可以用C、C++或Java编写。寻求高手帮助，如果算法正确高效，将再补10分
这时一个多目标组合优化问题，NP完全问题，没有那么简单，属于世界性的难题。可以使用遗传算法、粒子群算法等模拟演化算法求解得到一个近优解，没有算法能保证得到一个最优解。
java裁剪算法代码的介绍就聊到这里吧，感谢你花时间阅读本站内容，更多关于java剪枝算法、java裁剪算法代码的信息别忘了在本站进行查找喔。
