• Android文件保存和读取


    public class DataActivity extends Activity {      
        private EditText filenameText;    
        private EditText contentText;     
        private TextView resultView;      
        private static final String TAG = "DataActivity";     
        /** Called when the activity is first created. */     
        @Override         
            public void onCreate(Bundle savedInstanceState) {         
            super.onCreate(savedInstanceState);       
            setContentView(R.layout.main);        
            filenameText = (EditText) this.findViewById(R.id.filename);       
            contentText = (EditText) this.findViewById(R.id.content);         
            resultView = (TextView) this.findViewById(R.id.result);       
            String filename = filenameText.getText().toString();          
            Button button = (Button) this.findViewById(R.id.button);          
            Button showButton = (Button) this.findViewById(R.id.showButton);          
            button.setOnClickListener(listener);          
            showButton.setOnClickListener(listener);          
        }     
        private View.OnClickListener listener = new View.OnClickListener() {                  
            @Override             
                public void onClick(View v) {             
                Button button = (Button) v;           
                String filename = filenameText.getText().toString();              
                switch(button.getId()){               
                case R.id.button://如果是保存按钮                
                    int resId = R.string.success;                                                 
                    String content = contentText.getText().toString();                
                    try {                                                             
                        OutputStream outStream = DataActivity.this.openFileOutput(filename, Context.MODE_WORLD_WRITEABLE+Context.MODE_WORLD_READABLE);  
                        //四中操作模式  
                        //Context.MODE_PRIVATE=0 覆盖、私有  
                        //Context.MODE_APPEND=32768追加、私有  
                        //Context.MODE_WORLD_READABLE=1其他的程序可以访问  
                        //Context.MODE_WORLD_WRITEABLE=2  
                        try {                         
                            FileService.save(outStream, content);//保存文件                       
                        } catch (Exception e) {                       
                            Log.e(TAG, e.toString());                         
                            resId = R.string.error;                       
                        }     
                    } catch (FileNotFoundException e) {               
                        Log.e(TAG, e.toString());                     
                        resId = R.string.error;                   
                    }                 
                    Toast.makeText(DataActivity.this, resId, Toast.LENGTH_LONG).show();               
                    break;                
                case R.id.showButton://如果是显示按钮                
                    try {                     
                        InputStream inStream = DataActivity.this.openFileInput(filename);                 
                        String text = FileService.read(inStream);                     
                        resultView.setText(text);                     
                    } catch (Exception e) {                   
                        Log.e(TAG, e.toString());  
                        resId = R.string.error;  
                        Toast.makeText(DataActivity.this, "读取失败", Toast.LENGTH_LONG).show();      
                    }  
                    break;    
                }     
            }     
        };    
    }  
     
    
    //本文出自 “阿凡达” 博客,请务必保留此出处http://shamrock.blog.51cto.com/2079212/702531
  • 相关阅读:
    二进制位运算
    Leetcode 373. Find K Pairs with Smallest Sums
    priority_queue的用法
    Leetcode 110. Balanced Binary Tree
    Leetcode 104. Maximum Depth of Binary Tree
    Leetcode 111. Minimum Depth of Binary Tree
    Leetcode 64. Minimum Path Sum
    Leetcode 63. Unique Paths II
    经典的递归练习
    案例:java中的基本排序
  • 原文地址:https://www.cnblogs.com/umgsai/p/3908246.html
Copyright © 2020-2023  润新知